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


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


Checking for ERROR reachability
Using default analysis
Version 8fc3dc66
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.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 bfae9982cbfcfc5b22127da3f7d6677e3eac54b1fbca7af42ac502541c03eb9a
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-8fc3dc6-m
[2025-03-16 19:39:39,466 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-16 19:39:39,523 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:39,530 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-16 19:39:39,530 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-16 19:39:39,549 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-16 19:39:39,550 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-16 19:39:39,550 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-16 19:39:39,551 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-16 19:39:39,551 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-16 19:39:39,551 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-16 19:39:39,551 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-16 19:39:39,552 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-16 19:39:39,552 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-16 19:39:39,552 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-16 19:39:39,552 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-16 19:39:39,552 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-16 19:39:39,552 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-16 19:39:39,552 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-16 19:39:39,553 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-16 19:39:39,553 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-16 19:39:39,553 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-16 19:39:39,553 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-16 19:39:39,553 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-16 19:39:39,553 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-16 19:39:39,553 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-16 19:39:39,553 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-16 19:39:39,553 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-16 19:39:39,553 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-16 19:39:39,554 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-16 19:39:39,554 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-16 19:39:39,554 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-16 19:39:39,554 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-16 19:39:39,554 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-16 19:39:39,554 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-16 19:39:39,554 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-16 19:39:39,555 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-16 19:39:39,555 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-16 19:39:39,555 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-16 19:39:39,555 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-16 19:39:39,555 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-16 19:39:39,555 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-16 19:39:39,555 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-16 19:39:39,555 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 -> bfae9982cbfcfc5b22127da3f7d6677e3eac54b1fbca7af42ac502541c03eb9a
[2025-03-16 19:39:39,782 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-16 19:39:39,789 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-16 19:39:39,793 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-16 19:39:39,793 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-16 19:39:39,793 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-16 19:39:39,794 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c
[2025-03-16 19:39:41,006 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2db3bb99/d9160688f3a34366b3d9fd4bfec10ff5/FLAG3996ee931
[2025-03-16 19:39:41,367 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-16 19:39:41,367 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c
[2025-03-16 19:39:41,386 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2db3bb99/d9160688f3a34366b3d9fd4bfec10ff5/FLAG3996ee931
[2025-03-16 19:39:41,583 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2db3bb99/d9160688f3a34366b3d9fd4bfec10ff5
[2025-03-16 19:39:41,585 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-16 19:39:41,586 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-16 19:39:41,586 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-16 19:39:41,587 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-16 19:39:41,589 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-16 19:39:41,590 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:39:41" (1/1) ...
[2025-03-16 19:39:41,590 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@631d6180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:41, skipping insertion in model container
[2025-03-16 19:39:41,590 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:39:41" (1/1) ...
[2025-03-16 19:39:41,629 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-16 19:39:41,851 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c[13674,13687]
[2025-03-16 19:39:41,907 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-16 19:39:41,920 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-16 19:39:41,982 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c[13674,13687]
[2025-03-16 19:39:42,010 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-16 19:39:42,024 INFO  L204         MainTranslator]: Completed translation
[2025-03-16 19:39:42,025 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:42 WrapperNode
[2025-03-16 19:39:42,025 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-16 19:39:42,026 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-16 19:39:42,026 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-16 19:39:42,026 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-16 19:39:42,031 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:42" (1/1) ...
[2025-03-16 19:39:42,041 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:42" (1/1) ...
[2025-03-16 19:39:42,089 INFO  L138                Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1447
[2025-03-16 19:39:42,090 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-16 19:39:42,090 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-16 19:39:42,091 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-16 19:39:42,091 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-16 19:39:42,097 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:42" (1/1) ...
[2025-03-16 19:39:42,097 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:42" (1/1) ...
[2025-03-16 19:39:42,109 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:42" (1/1) ...
[2025-03-16 19:39:42,142 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:42,142 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:42" (1/1) ...
[2025-03-16 19:39:42,142 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:42" (1/1) ...
[2025-03-16 19:39:42,163 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:42" (1/1) ...
[2025-03-16 19:39:42,167 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:42" (1/1) ...
[2025-03-16 19:39:42,173 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:42" (1/1) ...
[2025-03-16 19:39:42,179 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:42" (1/1) ...
[2025-03-16 19:39:42,189 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-16 19:39:42,190 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-16 19:39:42,190 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-16 19:39:42,190 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-16 19:39:42,191 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:42" (1/1) ...
[2025-03-16 19:39:42,195 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-16 19:39:42,205 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 19:39:42,218 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:42,223 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:42,241 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-16 19:39:42,242 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-16 19:39:42,242 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-16 19:39:42,242 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-16 19:39:42,359 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-16 19:39:42,361 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-16 19:39:43,362 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L569: havoc main_~node3__newmax~0#1;
[2025-03-16 19:39:43,362 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L1368: 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:43,362 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L611: havoc main_~node4__newmax~0#1;
[2025-03-16 19:39:43,362 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L1208: 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:43,362 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L485: 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:43,362 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L1048: 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:43,362 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L888: 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:43,362 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L723: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;
[2025-03-16 19:39:43,362 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L527: havoc main_~node2__newmax~0#1;
[2025-03-16 19:39:43,466 INFO  L?                        ?]: Removed 124 outVars from TransFormulas that were not future-live.
[2025-03-16 19:39:43,466 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-16 19:39:43,484 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-16 19:39:43,484 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-16 19:39:43,484 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:39:43 BoogieIcfgContainer
[2025-03-16 19:39:43,484 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-16 19:39:43,486 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-16 19:39:43,486 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-16 19:39:43,489 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-16 19:39:43,489 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:39:41" (1/3) ...
[2025-03-16 19:39:43,489 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77022d30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:39:43, skipping insertion in model container
[2025-03-16 19:39:43,489 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:39:42" (2/3) ...
[2025-03-16 19:39:43,490 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77022d30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:39:43, skipping insertion in model container
[2025-03-16 19:39:43,490 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:39:43" (3/3) ...
[2025-03-16 19:39:43,491 INFO  L128   eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c
[2025-03-16 19:39:43,500 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-16 19:39:43,503 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c that has 1 procedures, 341 locations, 1 initial locations, 0 loop locations, and 1 error locations.
[2025-03-16 19:39:43,543 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-16 19:39:43,556 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;@73d31536, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-16 19:39:43,556 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-16 19:39:43,559 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 341 states, 339 states have (on average 1.7994100294985251) internal successors, (610), 340 states have internal predecessors, (610), 0 states have call successors, (0), 0 states 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:43,568 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 118
[2025-03-16 19:39:43,568 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:43,569 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:43,569 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:43,573 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:43,573 INFO  L85        PathProgramCache]: Analyzing trace with hash 208879837, now seen corresponding path program 1 times
[2025-03-16 19:39:43,578 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:43,579 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440166612]
[2025-03-16 19:39:43,579 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:43,579 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:43,669 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes.
[2025-03-16 19:39:43,819 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements.
[2025-03-16 19:39:43,819 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:43,819 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:44,154 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:44,155 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:44,155 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440166612]
[2025-03-16 19:39:44,156 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440166612] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:44,156 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:44,156 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 19:39:44,158 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359758193]
[2025-03-16 19:39:44,158 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:44,161 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 19:39:44,161 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:44,177 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 19:39:44,178 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 19:39:44,181 INFO  L87              Difference]: Start difference. First operand  has 341 states, 339 states have (on average 1.7994100294985251) internal successors, (610), 340 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:44,284 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:44,284 INFO  L93              Difference]: Finished difference Result 627 states and 1090 transitions.
[2025-03-16 19:39:44,286 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 19:39:44,288 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117
[2025-03-16 19:39:44,288 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:44,296 INFO  L225             Difference]: With dead ends: 627
[2025-03-16 19:39:44,297 INFO  L226             Difference]: Without dead ends: 472
[2025-03-16 19:39:44,300 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:44,302 INFO  L435           NwaCegarLoop]: 610 mSDtfsCounter, 256 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-16 19:39:44,302 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 1131 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-16 19:39:44,314 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 472 states.
[2025-03-16 19:39:44,350 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 470.
[2025-03-16 19:39:44,352 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 470 states, 469 states have (on average 1.6588486140724947) internal successors, (778), 469 states have internal predecessors, (778), 0 states have call successors, (0), 0 states 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,358 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 778 transitions.
[2025-03-16 19:39:44,360 INFO  L78                 Accepts]: Start accepts. Automaton has 470 states and 778 transitions. Word has length 117
[2025-03-16 19:39:44,360 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:44,360 INFO  L471      AbstractCegarLoop]: Abstraction has 470 states and 778 transitions.
[2025-03-16 19:39:44,360 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:44,361 INFO  L276                IsEmpty]: Start isEmpty. Operand 470 states and 778 transitions.
[2025-03-16 19:39:44,363 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 121
[2025-03-16 19:39:44,363 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:44,363 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:44,364 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-16 19:39:44,364 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:44,364 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:44,364 INFO  L85        PathProgramCache]: Analyzing trace with hash -581988173, now seen corresponding path program 1 times
[2025-03-16 19:39:44,364 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:44,365 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633537906]
[2025-03-16 19:39:44,365 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:44,365 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:44,399 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes.
[2025-03-16 19:39:44,456 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements.
[2025-03-16 19:39:44,456 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:44,456 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:44,677 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:44,678 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:44,678 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633537906]
[2025-03-16 19:39:44,678 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633537906] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:44,678 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:44,678 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 19:39:44,678 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017915151]
[2025-03-16 19:39:44,678 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:44,679 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 19:39:44,679 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:44,680 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 19:39:44,680 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 19:39:44,680 INFO  L87              Difference]: Start difference. First operand 470 states and 778 transitions. Second operand  has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:44,714 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:44,715 INFO  L93              Difference]: Finished difference Result 1006 states and 1674 transitions.
[2025-03-16 19:39:44,715 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 19:39:44,715 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120
[2025-03-16 19:39:44,717 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:44,720 INFO  L225             Difference]: With dead ends: 1006
[2025-03-16 19:39:44,720 INFO  L226             Difference]: Without dead ends: 728
[2025-03-16 19:39:44,721 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:44,722 INFO  L435           NwaCegarLoop]: 557 mSDtfsCounter, 218 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-16 19:39:44,722 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 1074 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 19:39:44,723 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 728 states.
[2025-03-16 19:39:44,747 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 726.
[2025-03-16 19:39:44,748 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 726 states, 725 states have (on average 1.6620689655172414) internal successors, (1205), 725 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states 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,751 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1205 transitions.
[2025-03-16 19:39:44,752 INFO  L78                 Accepts]: Start accepts. Automaton has 726 states and 1205 transitions. Word has length 120
[2025-03-16 19:39:44,753 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:44,753 INFO  L471      AbstractCegarLoop]: Abstraction has 726 states and 1205 transitions.
[2025-03-16 19:39:44,753 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:44,753 INFO  L276                IsEmpty]: Start isEmpty. Operand 726 states and 1205 transitions.
[2025-03-16 19:39:44,760 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 124
[2025-03-16 19:39:44,760 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:44,760 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:44,761 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-16 19:39:44,761 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:44,761 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:44,761 INFO  L85        PathProgramCache]: Analyzing trace with hash -717078450, now seen corresponding path program 1 times
[2025-03-16 19:39:44,761 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:44,762 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18611129]
[2025-03-16 19:39:44,762 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:44,762 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:44,792 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes.
[2025-03-16 19:39:44,826 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements.
[2025-03-16 19:39:44,826 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:44,826 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:44,966 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:44,967 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:44,967 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18611129]
[2025-03-16 19:39:44,967 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18611129] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:44,967 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:44,968 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 19:39:44,968 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553454441]
[2025-03-16 19:39:44,969 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:44,969 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 19:39:44,969 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:44,970 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 19:39:44,970 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 19:39:44,970 INFO  L87              Difference]: Start difference. First operand 726 states and 1205 transitions. Second operand  has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:45,004 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:45,005 INFO  L93              Difference]: Finished difference Result 1754 states and 2919 transitions.
[2025-03-16 19:39:45,005 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 19:39:45,005 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123
[2025-03-16 19:39:45,006 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:45,012 INFO  L225             Difference]: With dead ends: 1754
[2025-03-16 19:39:45,012 INFO  L226             Difference]: Without dead ends: 1220
[2025-03-16 19:39:45,014 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:45,016 INFO  L435           NwaCegarLoop]: 557 mSDtfsCounter, 211 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-16 19:39:45,017 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 1075 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 19:39:45,018 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1220 states.
[2025-03-16 19:39:45,054 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1218.
[2025-03-16 19:39:45,056 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1218 states, 1217 states have (on average 1.6606409202958095) internal successors, (2021), 1217 states have internal predecessors, (2021), 0 states have call successors, (0), 0 states 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,060 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 2021 transitions.
[2025-03-16 19:39:45,062 INFO  L78                 Accepts]: Start accepts. Automaton has 1218 states and 2021 transitions. Word has length 123
[2025-03-16 19:39:45,062 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:45,063 INFO  L471      AbstractCegarLoop]: Abstraction has 1218 states and 2021 transitions.
[2025-03-16 19:39:45,063 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:45,063 INFO  L276                IsEmpty]: Start isEmpty. Operand 1218 states and 2021 transitions.
[2025-03-16 19:39:45,065 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 127
[2025-03-16 19:39:45,065 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:45,066 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,066 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-16 19:39:45,066 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:45,067 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:45,067 INFO  L85        PathProgramCache]: Analyzing trace with hash 715980420, now seen corresponding path program 1 times
[2025-03-16 19:39:45,067 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:45,067 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141690821]
[2025-03-16 19:39:45,067 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:45,067 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:45,093 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes.
[2025-03-16 19:39:45,126 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,127 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:45,127 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:45,245 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:45,246 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:45,246 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141690821]
[2025-03-16 19:39:45,246 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141690821] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:45,246 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:45,246 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 19:39:45,246 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740657956]
[2025-03-16 19:39:45,246 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:45,247 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 19:39:45,247 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:45,248 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 19:39:45,248 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 19:39:45,248 INFO  L87              Difference]: Start difference. First operand 1218 states and 2021 transitions. Second operand  has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:45,289 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:45,290 INFO  L93              Difference]: Finished difference Result 3190 states and 5295 transitions.
[2025-03-16 19:39:45,291 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 19:39:45,291 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126
[2025-03-16 19:39:45,291 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:45,300 INFO  L225             Difference]: With dead ends: 3190
[2025-03-16 19:39:45,300 INFO  L226             Difference]: Without dead ends: 2164
[2025-03-16 19:39:45,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:45,305 INFO  L435           NwaCegarLoop]: 557 mSDtfsCounter, 204 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-16 19:39:45,306 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1076 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-16 19:39:45,308 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2164 states.
[2025-03-16 19:39:45,341 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 2162.
[2025-03-16 19:39:45,344 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2162 states, 2161 states have (on average 1.6552521980564554) internal successors, (3577), 2161 states have internal predecessors, (3577), 0 states have call successors, (0), 0 states 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,351 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2162 states to 2162 states and 3577 transitions.
[2025-03-16 19:39:45,351 INFO  L78                 Accepts]: Start accepts. Automaton has 2162 states and 3577 transitions. Word has length 126
[2025-03-16 19:39:45,352 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:45,352 INFO  L471      AbstractCegarLoop]: Abstraction has 2162 states and 3577 transitions.
[2025-03-16 19:39:45,352 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:45,352 INFO  L276                IsEmpty]: Start isEmpty. Operand 2162 states and 3577 transitions.
[2025-03-16 19:39:45,354 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2025-03-16 19:39:45,354 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:45,354 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 19:39:45,355 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-16 19:39:45,355 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:45,355 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:45,355 INFO  L85        PathProgramCache]: Analyzing trace with hash 549250239, now seen corresponding path program 1 times
[2025-03-16 19:39:45,355 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:45,355 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370331033]
[2025-03-16 19:39:45,356 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:45,356 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:45,377 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes.
[2025-03-16 19:39:45,397 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements.
[2025-03-16 19:39:45,398 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:45,398 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:45,570 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 19:39:45,570 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:45,570 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370331033]
[2025-03-16 19:39:45,570 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370331033] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:45,571 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:45,571 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-16 19:39:45,571 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122257408]
[2025-03-16 19:39:45,571 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:45,571 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-16 19:39:45,572 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:45,572 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-16 19:39:45,572 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-16 19:39:45,572 INFO  L87              Difference]: Start difference. First operand 2162 states and 3577 transitions. Second operand  has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:45,893 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:45,893 INFO  L93              Difference]: Finished difference Result 11282 states and 18809 transitions.
[2025-03-16 19:39:45,894 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-16 19:39:45,894 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129
[2025-03-16 19:39:45,894 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:45,925 INFO  L225             Difference]: With dead ends: 11282
[2025-03-16 19:39:45,925 INFO  L226             Difference]: Without dead ends: 9312
[2025-03-16 19:39:45,932 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:45,934 INFO  L435           NwaCegarLoop]: 556 mSDtfsCounter, 1930 mSDsluCounter, 4870 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1930 SdHoareTripleChecker+Valid, 5426 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-16 19:39:45,934 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1930 Valid, 5426 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-16 19:39:45,943 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9312 states.
[2025-03-16 19:39:46,067 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9312 to 4000.
[2025-03-16 19:39:46,074 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4000 states, 3999 states have (on average 1.6554138534633658) internal successors, (6620), 3999 states have internal predecessors, (6620), 0 states have call successors, (0), 0 states 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:46,088 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4000 states to 4000 states and 6620 transitions.
[2025-03-16 19:39:46,088 INFO  L78                 Accepts]: Start accepts. Automaton has 4000 states and 6620 transitions. Word has length 129
[2025-03-16 19:39:46,089 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:46,089 INFO  L471      AbstractCegarLoop]: Abstraction has 4000 states and 6620 transitions.
[2025-03-16 19:39:46,089 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:46,089 INFO  L276                IsEmpty]: Start isEmpty. Operand 4000 states and 6620 transitions.
[2025-03-16 19:39:46,091 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 131
[2025-03-16 19:39:46,092 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:46,092 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 19:39:46,092 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-16 19:39:46,092 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:46,095 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:46,095 INFO  L85        PathProgramCache]: Analyzing trace with hash -151143513, now seen corresponding path program 1 times
[2025-03-16 19:39:46,096 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:46,096 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635375425]
[2025-03-16 19:39:46,096 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:46,096 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:46,114 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes.
[2025-03-16 19:39:46,131 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements.
[2025-03-16 19:39:46,132 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:46,132 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:46,226 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,226 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:46,226 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635375425]
[2025-03-16 19:39:46,226 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635375425] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:46,226 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:46,227 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 19:39:46,227 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139421316]
[2025-03-16 19:39:46,227 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:46,227 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 19:39:46,227 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:46,227 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 19:39:46,228 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 19:39:46,228 INFO  L87              Difference]: Start difference. First operand 4000 states and 6620 transitions. Second operand  has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:46,354 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:46,355 INFO  L93              Difference]: Finished difference Result 11712 states and 19480 transitions.
[2025-03-16 19:39:46,355 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 19:39:46,356 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130
[2025-03-16 19:39:46,356 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:46,382 INFO  L225             Difference]: With dead ends: 11712
[2025-03-16 19:39:46,382 INFO  L226             Difference]: Without dead ends: 7904
[2025-03-16 19:39:46,386 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:46,388 INFO  L435           NwaCegarLoop]: 558 mSDtfsCounter, 717 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 1678 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:46,388 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 1678 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:46,396 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7904 states.
[2025-03-16 19:39:46,491 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7904 to 5935.
[2025-03-16 19:39:46,501 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5935 states, 5934 states have (on average 1.6573980451634647) internal successors, (9835), 5934 states have internal predecessors, (9835), 0 states have call successors, (0), 0 states 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:46,522 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5935 states to 5935 states and 9835 transitions.
[2025-03-16 19:39:46,522 INFO  L78                 Accepts]: Start accepts. Automaton has 5935 states and 9835 transitions. Word has length 130
[2025-03-16 19:39:46,523 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:46,523 INFO  L471      AbstractCegarLoop]: Abstraction has 5935 states and 9835 transitions.
[2025-03-16 19:39:46,523 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:46,523 INFO  L276                IsEmpty]: Start isEmpty. Operand 5935 states and 9835 transitions.
[2025-03-16 19:39:46,526 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 132
[2025-03-16 19:39:46,526 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:46,527 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 19:39:46,527 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-16 19:39:46,527 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:46,528 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:46,528 INFO  L85        PathProgramCache]: Analyzing trace with hash 1163745460, now seen corresponding path program 1 times
[2025-03-16 19:39:46,528 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:46,528 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371835915]
[2025-03-16 19:39:46,528 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:46,529 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:46,544 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes.
[2025-03-16 19:39:46,562 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements.
[2025-03-16 19:39:46,562 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:46,563 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:46,642 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,642 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:46,642 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371835915]
[2025-03-16 19:39:46,642 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371835915] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:46,642 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:46,642 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 19:39:46,642 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335679272]
[2025-03-16 19:39:46,642 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:46,642 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 19:39:46,642 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:46,643 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 19:39:46,643 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 19:39:46,643 INFO  L87              Difference]: Start difference. First operand 5935 states and 9835 transitions. Second operand  has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:46,712 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:46,712 INFO  L93              Difference]: Finished difference Result 13024 states and 21677 transitions.
[2025-03-16 19:39:46,713 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 19:39:46,713 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131
[2025-03-16 19:39:46,713 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:46,746 INFO  L225             Difference]: With dead ends: 13024
[2025-03-16 19:39:46,746 INFO  L226             Difference]: Without dead ends: 9023
[2025-03-16 19:39:46,756 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:46,757 INFO  L435           NwaCegarLoop]: 742 mSDtfsCounter, 226 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1255 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:46,757 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1255 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:46,765 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9023 states.
[2025-03-16 19:39:46,912 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9023 to 9021.
[2025-03-16 19:39:46,934 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9021 states, 9020 states have (on average 1.6573170731707316) internal successors, (14949), 9020 states have internal predecessors, (14949), 0 states have call successors, (0), 0 states 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:46,972 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9021 states to 9021 states and 14949 transitions.
[2025-03-16 19:39:46,972 INFO  L78                 Accepts]: Start accepts. Automaton has 9021 states and 14949 transitions. Word has length 131
[2025-03-16 19:39:46,972 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:46,972 INFO  L471      AbstractCegarLoop]: Abstraction has 9021 states and 14949 transitions.
[2025-03-16 19:39:46,972 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:46,973 INFO  L276                IsEmpty]: Start isEmpty. Operand 9021 states and 14949 transitions.
[2025-03-16 19:39:46,975 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 132
[2025-03-16 19:39:46,975 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:46,975 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 19:39:46,976 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-16 19:39:46,976 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:46,976 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:46,976 INFO  L85        PathProgramCache]: Analyzing trace with hash 59658698, now seen corresponding path program 1 times
[2025-03-16 19:39:46,976 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:46,977 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907819597]
[2025-03-16 19:39:46,977 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:46,977 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:46,996 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes.
[2025-03-16 19:39:47,020 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements.
[2025-03-16 19:39:47,021 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:47,021 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:47,091 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:47,092 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:47,092 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907819597]
[2025-03-16 19:39:47,092 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907819597] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:47,092 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:47,092 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 19:39:47,092 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852990385]
[2025-03-16 19:39:47,092 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:47,092 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 19:39:47,092 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:47,093 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 19:39:47,093 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 19:39:47,093 INFO  L87              Difference]: Start difference. First operand 9021 states and 14949 transitions. Second operand  has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:47,188 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:47,188 INFO  L93              Difference]: Finished difference Result 17367 states and 28818 transitions.
[2025-03-16 19:39:47,188 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 19:39:47,189 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131
[2025-03-16 19:39:47,189 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:47,214 INFO  L225             Difference]: With dead ends: 17367
[2025-03-16 19:39:47,214 INFO  L226             Difference]: Without dead ends: 12605
[2025-03-16 19:39:47,224 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:47,225 INFO  L435           NwaCegarLoop]: 717 mSDtfsCounter, 219 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-16 19:39:47,225 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 1231 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-16 19:39:47,236 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12605 states.
[2025-03-16 19:39:47,434 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12605 to 12603.
[2025-03-16 19:39:47,454 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 12603 states, 12602 states have (on average 1.6536264085065862) internal successors, (20839), 12602 states have internal predecessors, (20839), 0 states have call successors, (0), 0 states 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,486 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12603 states to 12603 states and 20839 transitions.
[2025-03-16 19:39:47,487 INFO  L78                 Accepts]: Start accepts. Automaton has 12603 states and 20839 transitions. Word has length 131
[2025-03-16 19:39:47,487 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:47,487 INFO  L471      AbstractCegarLoop]: Abstraction has 12603 states and 20839 transitions.
[2025-03-16 19:39:47,487 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:47,487 INFO  L276                IsEmpty]: Start isEmpty. Operand 12603 states and 20839 transitions.
[2025-03-16 19:39:47,489 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 132
[2025-03-16 19:39:47,489 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:47,489 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 19:39:47,489 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-16 19:39:47,489 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:47,490 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:47,490 INFO  L85        PathProgramCache]: Analyzing trace with hash -416430732, now seen corresponding path program 1 times
[2025-03-16 19:39:47,490 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:47,490 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966309845]
[2025-03-16 19:39:47,490 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:47,490 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:47,520 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes.
[2025-03-16 19:39:47,541 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements.
[2025-03-16 19:39:47,541 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:47,541 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:47,622 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:47,623 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:47,623 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966309845]
[2025-03-16 19:39:47,623 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966309845] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:47,623 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:47,623 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 19:39:47,623 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661657006]
[2025-03-16 19:39:47,623 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:47,623 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 19:39:47,624 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:47,624 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 19:39:47,624 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 19:39:47,624 INFO  L87              Difference]: Start difference. First operand 12603 states and 20839 transitions. Second operand  has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:47,723 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:47,724 INFO  L93              Difference]: Finished difference Result 24109 states and 39924 transitions.
[2025-03-16 19:39:47,724 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 19:39:47,724 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131
[2025-03-16 19:39:47,725 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:47,759 INFO  L225             Difference]: With dead ends: 24109
[2025-03-16 19:39:47,759 INFO  L226             Difference]: Without dead ends: 17467
[2025-03-16 19:39:47,774 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:47,777 INFO  L435           NwaCegarLoop]: 683 mSDtfsCounter, 212 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 1198 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:47,778 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 1198 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:47,797 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 17467 states.
[2025-03-16 19:39:48,077 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 17467 to 17465.
[2025-03-16 19:39:48,100 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 17465 states, 17464 states have (on average 1.6495075584058634) internal successors, (28807), 17464 states have internal predecessors, (28807), 0 states have call successors, (0), 0 states 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:48,127 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17465 states to 17465 states and 28807 transitions.
[2025-03-16 19:39:48,128 INFO  L78                 Accepts]: Start accepts. Automaton has 17465 states and 28807 transitions. Word has length 131
[2025-03-16 19:39:48,128 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:48,128 INFO  L471      AbstractCegarLoop]: Abstraction has 17465 states and 28807 transitions.
[2025-03-16 19:39:48,129 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:48,129 INFO  L276                IsEmpty]: Start isEmpty. Operand 17465 states and 28807 transitions.
[2025-03-16 19:39:48,130 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 132
[2025-03-16 19:39:48,130 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:48,130 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 19:39:48,130 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-16 19:39:48,130 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:48,130 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:48,130 INFO  L85        PathProgramCache]: Analyzing trace with hash 1816837386, now seen corresponding path program 1 times
[2025-03-16 19:39:48,131 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:48,131 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995932653]
[2025-03-16 19:39:48,131 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:48,131 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:48,149 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes.
[2025-03-16 19:39:48,167 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements.
[2025-03-16 19:39:48,167 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:48,167 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:48,228 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:48,228 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:48,228 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995932653]
[2025-03-16 19:39:48,229 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995932653] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:48,229 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:48,229 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-16 19:39:48,229 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257174284]
[2025-03-16 19:39:48,229 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:48,229 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-16 19:39:48,229 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:48,230 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-16 19:39:48,230 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-16 19:39:48,230 INFO  L87              Difference]: Start difference. First operand 17465 states and 28807 transitions. Second operand  has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:48,314 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:48,314 INFO  L93              Difference]: Finished difference Result 33211 states and 54866 transitions.
[2025-03-16 19:39:48,315 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-16 19:39:48,315 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131
[2025-03-16 19:39:48,315 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:48,361 INFO  L225             Difference]: With dead ends: 33211
[2025-03-16 19:39:48,361 INFO  L226             Difference]: Without dead ends: 23999
[2025-03-16 19:39:48,382 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:48,383 INFO  L435           NwaCegarLoop]: 649 mSDtfsCounter, 205 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1165 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:48,384 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1165 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:48,403 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23999 states.
[2025-03-16 19:39:48,714 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23999 to 23997.
[2025-03-16 19:39:48,748 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 23997 states, 23996 states have (on average 1.6447324554092349) internal successors, (39467), 23996 states have internal predecessors, (39467), 0 states have call successors, (0), 0 states 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:48,783 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23997 states to 23997 states and 39467 transitions.
[2025-03-16 19:39:48,783 INFO  L78                 Accepts]: Start accepts. Automaton has 23997 states and 39467 transitions. Word has length 131
[2025-03-16 19:39:48,784 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:48,784 INFO  L471      AbstractCegarLoop]: Abstraction has 23997 states and 39467 transitions.
[2025-03-16 19:39:48,784 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:48,784 INFO  L276                IsEmpty]: Start isEmpty. Operand 23997 states and 39467 transitions.
[2025-03-16 19:39:48,785 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 132
[2025-03-16 19:39:48,785 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:48,785 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 19:39:48,785 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-16 19:39:48,785 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:48,786 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:48,786 INFO  L85        PathProgramCache]: Analyzing trace with hash -388602718, now seen corresponding path program 1 times
[2025-03-16 19:39:48,786 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:48,786 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573196176]
[2025-03-16 19:39:48,786 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:48,786 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:48,802 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes.
[2025-03-16 19:39:48,821 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements.
[2025-03-16 19:39:48,821 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:48,821 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:48,995 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:48,995 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:48,996 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573196176]
[2025-03-16 19:39:48,996 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573196176] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:48,996 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:48,996 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 19:39:48,996 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155551904]
[2025-03-16 19:39:48,996 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:48,996 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 19:39:48,996 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:48,996 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 19:39:48,996 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 19:39:48,997 INFO  L87              Difference]: Start difference. First operand 23997 states and 39467 transitions. Second operand  has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:49,204 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:49,204 INFO  L93              Difference]: Finished difference Result 78058 states and 128556 transitions.
[2025-03-16 19:39:49,205 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 19:39:49,205 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131
[2025-03-16 19:39:49,206 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:49,437 INFO  L225             Difference]: With dead ends: 78058
[2025-03-16 19:39:49,437 INFO  L226             Difference]: Without dead ends: 54321
[2025-03-16 19:39:49,466 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:49,467 INFO  L435           NwaCegarLoop]: 548 mSDtfsCounter, 716 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 1845 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:49,467 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 1845 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:49,505 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 54321 states.
[2025-03-16 19:39:50,051 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 54321 to 39070.
[2025-03-16 19:39:50,095 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 39070 states, 39069 states have (on average 1.6394072026414805) internal successors, (64050), 39069 states have internal predecessors, (64050), 0 states have call successors, (0), 0 states 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,153 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 39070 states to 39070 states and 64050 transitions.
[2025-03-16 19:39:50,154 INFO  L78                 Accepts]: Start accepts. Automaton has 39070 states and 64050 transitions. Word has length 131
[2025-03-16 19:39:50,154 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:50,154 INFO  L471      AbstractCegarLoop]: Abstraction has 39070 states and 64050 transitions.
[2025-03-16 19:39:50,154 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:50,155 INFO  L276                IsEmpty]: Start isEmpty. Operand 39070 states and 64050 transitions.
[2025-03-16 19:39:50,155 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 133
[2025-03-16 19:39:50,155 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:50,155 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 19:39:50,156 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-16 19:39:50,156 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:50,156 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:50,156 INFO  L85        PathProgramCache]: Analyzing trace with hash 840007146, now seen corresponding path program 1 times
[2025-03-16 19:39:50,156 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:50,156 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216514231]
[2025-03-16 19:39:50,156 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:50,157 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:50,173 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes.
[2025-03-16 19:39:50,191 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements.
[2025-03-16 19:39:50,192 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:50,192 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:50,287 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:50,287 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:50,287 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216514231]
[2025-03-16 19:39:50,287 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216514231] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:50,287 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:50,288 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 19:39:50,288 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366352677]
[2025-03-16 19:39:50,288 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:50,288 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 19:39:50,288 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:50,289 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 19:39:50,289 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 19:39:50,289 INFO  L87              Difference]: Start difference. First operand 39070 states and 64050 transitions. Second operand  has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:50,822 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:50,823 INFO  L93              Difference]: Finished difference Result 126536 states and 207710 transitions.
[2025-03-16 19:39:50,823 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 19:39:50,823 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132
[2025-03-16 19:39:50,824 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:51,049 INFO  L225             Difference]: With dead ends: 126536
[2025-03-16 19:39:51,049 INFO  L226             Difference]: Without dead ends: 87726
[2025-03-16 19:39:51,075 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:51,076 INFO  L435           NwaCegarLoop]: 548 mSDtfsCounter, 714 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 1847 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:51,076 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 1847 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:51,144 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 87726 states.
[2025-03-16 19:39:51,936 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 87726 to 63255.
[2025-03-16 19:39:52,000 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 63255 states, 63254 states have (on average 1.6339994308660322) internal successors, (103357), 63254 states have internal predecessors, (103357), 0 states have call successors, (0), 0 states 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,131 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 63255 states to 63255 states and 103357 transitions.
[2025-03-16 19:39:52,131 INFO  L78                 Accepts]: Start accepts. Automaton has 63255 states and 103357 transitions. Word has length 132
[2025-03-16 19:39:52,131 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:52,131 INFO  L471      AbstractCegarLoop]: Abstraction has 63255 states and 103357 transitions.
[2025-03-16 19:39:52,132 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:52,132 INFO  L276                IsEmpty]: Start isEmpty. Operand 63255 states and 103357 transitions.
[2025-03-16 19:39:52,133 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 134
[2025-03-16 19:39:52,133 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:52,133 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 19:39:52,133 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-16 19:39:52,133 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:52,134 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:52,134 INFO  L85        PathProgramCache]: Analyzing trace with hash 272117893, now seen corresponding path program 1 times
[2025-03-16 19:39:52,134 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:52,134 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624426365]
[2025-03-16 19:39:52,134 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:52,134 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:52,154 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes.
[2025-03-16 19:39:52,176 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements.
[2025-03-16 19:39:52,177 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:52,177 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:52,282 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:52,282 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:52,282 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624426365]
[2025-03-16 19:39:52,282 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624426365] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:52,282 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:52,282 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 19:39:52,283 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865283017]
[2025-03-16 19:39:52,283 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:52,283 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 19:39:52,283 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:52,284 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 19:39:52,284 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 19:39:52,284 INFO  L87              Difference]: Start difference. First operand 63255 states and 103357 transitions. Second operand  has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:53,047 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:53,048 INFO  L93              Difference]: Finished difference Result 202566 states and 331416 transitions.
[2025-03-16 19:39:53,048 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 19:39:53,049 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133
[2025-03-16 19:39:53,049 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:53,553 INFO  L225             Difference]: With dead ends: 202566
[2025-03-16 19:39:53,553 INFO  L226             Difference]: Without dead ends: 139571
[2025-03-16 19:39:53,604 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:53,605 INFO  L435           NwaCegarLoop]: 548 mSDtfsCounter, 712 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 1849 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:53,606 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 1849 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:53,691 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 139571 states.
[2025-03-16 19:39:54,927 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 139571 to 101188.
[2025-03-16 19:39:55,009 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 101188 states, 101187 states have (on average 1.6286677142320654) internal successors, (164800), 101187 states have internal predecessors, (164800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:55,213 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 101188 states to 101188 states and 164800 transitions.
[2025-03-16 19:39:55,214 INFO  L78                 Accepts]: Start accepts. Automaton has 101188 states and 164800 transitions. Word has length 133
[2025-03-16 19:39:55,214 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:55,214 INFO  L471      AbstractCegarLoop]: Abstraction has 101188 states and 164800 transitions.
[2025-03-16 19:39:55,214 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:55,215 INFO  L276                IsEmpty]: Start isEmpty. Operand 101188 states and 164800 transitions.
[2025-03-16 19:39:55,215 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 136
[2025-03-16 19:39:55,215 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:55,215 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 19:39:55,217 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-16 19:39:55,217 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:55,217 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:55,218 INFO  L85        PathProgramCache]: Analyzing trace with hash -436224825, now seen corresponding path program 1 times
[2025-03-16 19:39:55,218 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:55,218 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112559800]
[2025-03-16 19:39:55,218 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:55,218 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:55,242 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes.
[2025-03-16 19:39:55,255 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements.
[2025-03-16 19:39:55,255 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:55,255 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:55,467 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 19:39:55,468 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:55,468 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112559800]
[2025-03-16 19:39:55,468 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112559800] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:55,468 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:55,468 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-16 19:39:55,468 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509119115]
[2025-03-16 19:39:55,468 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:55,468 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-16 19:39:55,469 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:55,469 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-16 19:39:55,469 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-16 19:39:55,469 INFO  L87              Difference]: Start difference. First operand 101188 states and 164800 transitions. Second operand  has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:56,216 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:56,216 INFO  L93              Difference]: Finished difference Result 202118 states and 329185 transitions.
[2025-03-16 19:39:56,217 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-16 19:39:56,217 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135
[2025-03-16 19:39:56,217 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:56,349 INFO  L225             Difference]: With dead ends: 202118
[2025-03-16 19:39:56,349 INFO  L226             Difference]: Without dead ends: 101190
[2025-03-16 19:39:56,431 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:56,432 INFO  L435           NwaCegarLoop]: 552 mSDtfsCounter, 208 mSDsluCounter, 2092 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 2644 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-16 19:39:56,432 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 2644 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-16 19:39:56,509 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 101190 states.
[2025-03-16 19:39:57,657 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 101190 to 101188.
[2025-03-16 19:39:57,763 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 101188 states, 101187 states have (on average 1.6224910314566101) internal successors, (164175), 101187 states have internal predecessors, (164175), 0 states have call successors, (0), 0 states 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,000 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 101188 states to 101188 states and 164175 transitions.
[2025-03-16 19:39:58,000 INFO  L78                 Accepts]: Start accepts. Automaton has 101188 states and 164175 transitions. Word has length 135
[2025-03-16 19:39:58,001 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:39:58,001 INFO  L471      AbstractCegarLoop]: Abstraction has 101188 states and 164175 transitions.
[2025-03-16 19:39:58,001 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:58,001 INFO  L276                IsEmpty]: Start isEmpty. Operand 101188 states and 164175 transitions.
[2025-03-16 19:39:58,002 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 139
[2025-03-16 19:39:58,002 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:39:58,002 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 19:39:58,002 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-16 19:39:58,002 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:39:58,003 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:39:58,003 INFO  L85        PathProgramCache]: Analyzing trace with hash -1910099948, now seen corresponding path program 1 times
[2025-03-16 19:39:58,003 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:39:58,003 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527016387]
[2025-03-16 19:39:58,003 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:39:58,003 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:39:58,026 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes.
[2025-03-16 19:39:58,045 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements.
[2025-03-16 19:39:58,045 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:39:58,045 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:39:58,539 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 19:39:58,540 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:39:58,540 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527016387]
[2025-03-16 19:39:58,540 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527016387] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:39:58,540 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:39:58,540 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-16 19:39:58,540 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603731168]
[2025-03-16 19:39:58,540 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:39:58,541 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-16 19:39:58,541 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:39:58,541 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-16 19:39:58,541 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-16 19:39:58,541 INFO  L87              Difference]: Start difference. First operand 101188 states and 164175 transitions. Second operand  has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:39:59,705 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:39:59,706 INFO  L93              Difference]: Finished difference Result 295764 states and 480309 transitions.
[2025-03-16 19:39:59,706 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-16 19:39:59,706 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138
[2025-03-16 19:39:59,706 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:39:59,993 INFO  L225             Difference]: With dead ends: 295764
[2025-03-16 19:39:59,993 INFO  L226             Difference]: Without dead ends: 194836
[2025-03-16 19:40:00,072 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2025-03-16 19:40:00,073 INFO  L435           NwaCegarLoop]: 547 mSDtfsCounter, 612 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 2134 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-16 19:40:00,073 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 2134 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-16 19:40:00,196 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 194836 states.
[2025-03-16 19:40:01,857 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 194836 to 194834.
[2025-03-16 19:40:02,051 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 194834 states, 194833 states have (on average 1.6143671759917468) internal successors, (314532), 194833 states have internal predecessors, (314532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:40:02,834 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 194834 states to 194834 states and 314532 transitions.
[2025-03-16 19:40:02,834 INFO  L78                 Accepts]: Start accepts. Automaton has 194834 states and 314532 transitions. Word has length 138
[2025-03-16 19:40:02,834 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:40:02,835 INFO  L471      AbstractCegarLoop]: Abstraction has 194834 states and 314532 transitions.
[2025-03-16 19:40:02,835 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:40:02,835 INFO  L276                IsEmpty]: Start isEmpty. Operand 194834 states and 314532 transitions.
[2025-03-16 19:40:02,835 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 140
[2025-03-16 19:40:02,835 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:40:02,835 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 19:40:02,836 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-16 19:40:02,836 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:40:02,836 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:40:02,836 INFO  L85        PathProgramCache]: Analyzing trace with hash 917399124, now seen corresponding path program 1 times
[2025-03-16 19:40:02,836 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:40:02,836 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904017740]
[2025-03-16 19:40:02,836 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:40:02,836 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:40:02,852 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes.
[2025-03-16 19:40:02,925 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements.
[2025-03-16 19:40:02,925 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:40:02,926 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:40:03,337 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-16 19:40:03,337 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:40:03,337 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904017740]
[2025-03-16 19:40:03,337 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904017740] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:40:03,337 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:40:03,337 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-16 19:40:03,337 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343777760]
[2025-03-16 19:40:03,337 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:40:03,342 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-16 19:40:03,342 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:40:03,342 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-16 19:40:03,342 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-16 19:40:03,342 INFO  L87              Difference]: Start difference. First operand 194834 states and 314532 transitions. Second operand  has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:40:04,158 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:40:04,158 INFO  L93              Difference]: Finished difference Result 198708 states and 320341 transitions.
[2025-03-16 19:40:04,159 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-16 19:40:04,159 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139
[2025-03-16 19:40:04,159 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:40:04,487 INFO  L225             Difference]: With dead ends: 198708
[2025-03-16 19:40:04,487 INFO  L226             Difference]: Without dead ends: 198706
[2025-03-16 19:40:04,550 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-16 19:40:04,551 INFO  L435           NwaCegarLoop]: 556 mSDtfsCounter, 0 mSDsluCounter, 1650 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2206 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-16 19:40:04,551 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2206 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-16 19:40:04,692 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 198706 states.
[2025-03-16 19:40:06,539 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 198706 to 198706.
[2025-03-16 19:40:06,735 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 198706 states, 198705 states have (on average 1.6022596311114465) internal successors, (318377), 198705 states have internal predecessors, (318377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:40:07,690 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 198706 states to 198706 states and 318377 transitions.
[2025-03-16 19:40:07,691 INFO  L78                 Accepts]: Start accepts. Automaton has 198706 states and 318377 transitions. Word has length 139
[2025-03-16 19:40:07,691 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:40:07,691 INFO  L471      AbstractCegarLoop]: Abstraction has 198706 states and 318377 transitions.
[2025-03-16 19:40:07,691 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:40:07,691 INFO  L276                IsEmpty]: Start isEmpty. Operand 198706 states and 318377 transitions.
[2025-03-16 19:40:07,700 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 174
[2025-03-16 19:40:07,700 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:40:07,700 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 19:40:07,700 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-16 19:40:07,700 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:40:07,701 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:40:07,701 INFO  L85        PathProgramCache]: Analyzing trace with hash 1365233297, now seen corresponding path program 1 times
[2025-03-16 19:40:07,701 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:40:07,701 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237840371]
[2025-03-16 19:40:07,701 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:40:07,701 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:40:07,729 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes.
[2025-03-16 19:40:07,762 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements.
[2025-03-16 19:40:07,762 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:40:07,762 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:40:07,947 INFO  L134       CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-03-16 19:40:07,947 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:40:07,947 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237840371]
[2025-03-16 19:40:07,947 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237840371] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:40:07,947 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:40:07,947 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-16 19:40:07,947 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265471693]
[2025-03-16 19:40:07,947 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:40:07,947 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-16 19:40:07,947 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:40:07,948 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-16 19:40:07,948 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-16 19:40:07,948 INFO  L87              Difference]: Start difference. First operand 198706 states and 318377 transitions. Second operand  has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:40:09,737 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:40:09,738 INFO  L93              Difference]: Finished difference Result 542130 states and 870874 transitions.
[2025-03-16 19:40:09,738 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-16 19:40:09,738 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 173
[2025-03-16 19:40:09,739 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:40:10,589 INFO  L225             Difference]: With dead ends: 542130
[2025-03-16 19:40:10,589 INFO  L226             Difference]: Without dead ends: 453728
[2025-03-16 19:40:10,725 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:10,725 INFO  L435           NwaCegarLoop]: 796 mSDtfsCounter, 1430 mSDsluCounter, 2782 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1430 SdHoareTripleChecker+Valid, 3578 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-16 19:40:10,725 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1430 Valid, 3578 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-16 19:40:11,014 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 453728 states.
[2025-03-16 19:40:15,005 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 453728 to 319484.
[2025-03-16 19:40:15,287 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 319484 states, 319483 states have (on average 1.6004012733071868) internal successors, (511301), 319483 states have internal predecessors, (511301), 0 states have call successors, (0), 0 states 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:16,398 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 319484 states to 319484 states and 511301 transitions.
[2025-03-16 19:40:16,398 INFO  L78                 Accepts]: Start accepts. Automaton has 319484 states and 511301 transitions. Word has length 173
[2025-03-16 19:40:16,398 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 19:40:16,399 INFO  L471      AbstractCegarLoop]: Abstraction has 319484 states and 511301 transitions.
[2025-03-16 19:40:16,399 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 19:40:16,399 INFO  L276                IsEmpty]: Start isEmpty. Operand 319484 states and 511301 transitions.
[2025-03-16 19:40:16,403 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 174
[2025-03-16 19:40:16,403 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 19:40:16,404 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-16 19:40:16,404 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-16 19:40:16,404 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 19:40:16,404 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 19:40:16,404 INFO  L85        PathProgramCache]: Analyzing trace with hash 261146535, now seen corresponding path program 1 times
[2025-03-16 19:40:16,404 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 19:40:16,405 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663810634]
[2025-03-16 19:40:16,405 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 19:40:16,405 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 19:40:16,426 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes.
[2025-03-16 19:40:16,438 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements.
[2025-03-16 19:40:16,438 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 19:40:16,438 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 19:40:16,584 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:16,584 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 19:40:16,584 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663810634]
[2025-03-16 19:40:16,584 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663810634] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 19:40:16,584 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 19:40:16,584 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-16 19:40:16,584 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059917339]
[2025-03-16 19:40:16,584 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 19:40:16,584 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-16 19:40:16,584 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 19:40:16,585 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-16 19:40:16,585 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-16 19:40:16,585 INFO  L87              Difference]: Start difference. First operand 319484 states and 511301 transitions. Second operand  has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 0 states 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:18,776 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 19:40:18,777 INFO  L93              Difference]: Finished difference Result 609940 states and 979878 transitions.
[2025-03-16 19:40:18,777 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-16 19:40:18,777 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 173
[2025-03-16 19:40:18,778 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 19:40:19,747 INFO  L225             Difference]: With dead ends: 609940
[2025-03-16 19:40:19,748 INFO  L226             Difference]: Without dead ends: 522688
[2025-03-16 19:40:19,958 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:19,959 INFO  L435           NwaCegarLoop]: 790 mSDtfsCounter, 1442 mSDsluCounter, 2393 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1442 SdHoareTripleChecker+Valid, 3183 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-16 19:40:19,959 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1442 Valid, 3183 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-16 19:40:20,936 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 522688 states.