./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.ufo.UNBOUNDED.pals.c.p+lhb-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 38de1f601deff70f21f1ef1f0123eb0d7f517b820846e07815605162625b0305 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:14:44,501 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:14:44,545 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:14:44,549 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:14:44,550 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:14:44,566 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:14:44,566 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:14:44,566 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:14:44,567 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:14:44,567 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:14:44,567 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:14:44,567 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:14:44,567 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:14:44,567 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:14:44,567 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:14:44,567 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:14:44,567 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:14:44,567 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:14:44,567 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:14:44,567 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:14:44,567 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:14:44,568 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:14:44,568 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:14:44,568 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:14:44,568 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:14:44,568 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:14:44,568 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:14:44,568 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:14:44,568 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:14:44,568 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:14:44,568 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:14:44,568 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:14:44,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:14:44,568 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:14:44,568 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:14:44,568 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:14:44,569 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:14:44,569 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:14:44,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:14:44,569 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:14:44,570 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:14:44,570 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:14:44,570 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:14:44,570 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 -> 38de1f601deff70f21f1ef1f0123eb0d7f517b820846e07815605162625b0305 [2025-03-08 06:14:44,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:14:44,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:14:44,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:14:44,812 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:14:44,813 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:14:44,814 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2025-03-08 06:14:46,022 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e5be63d5/cf3980e6d36945e78ddb46cd5966571e/FLAG453c1c620 [2025-03-08 06:14:46,394 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:14:46,395 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2025-03-08 06:14:46,416 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e5be63d5/cf3980e6d36945e78ddb46cd5966571e/FLAG453c1c620 [2025-03-08 06:14:46,621 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e5be63d5/cf3980e6d36945e78ddb46cd5966571e [2025-03-08 06:14:46,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:14:46,625 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:14:46,626 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:14:46,626 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:14:46,629 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:14:46,630 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:14:46" (1/1) ... [2025-03-08 06:14:46,632 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e679d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:14:46, skipping insertion in model container [2025-03-08 06:14:46,632 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:14:46" (1/1) ... [2025-03-08 06:14:46,687 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:14:46,998 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c[30493,30506] [2025-03-08 06:14:47,034 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c[33882,33895] [2025-03-08 06:14:47,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:14:47,172 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:14:47,328 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c[30493,30506] [2025-03-08 06:14:47,352 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c[33882,33895] [2025-03-08 06:14:47,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:14:47,461 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:14:47,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:14:47 WrapperNode [2025-03-08 06:14:47,462 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:14:47,463 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:14:47,464 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:14:47,464 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:14:47,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:14:47" (1/1) ... [2025-03-08 06:14:47,502 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:14:47" (1/1) ... [2025-03-08 06:14:47,593 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3966 [2025-03-08 06:14:47,594 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:14:47,594 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:14:47,595 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:14:47,595 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:14:47,601 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:14:47" (1/1) ... [2025-03-08 06:14:47,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:14:47" (1/1) ... [2025-03-08 06:14:47,620 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:14:47" (1/1) ... [2025-03-08 06:14:47,664 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 06:14:47,667 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:14:47" (1/1) ... [2025-03-08 06:14:47,667 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:14:47" (1/1) ... [2025-03-08 06:14:47,699 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:14:47" (1/1) ... [2025-03-08 06:14:47,705 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:14:47" (1/1) ... [2025-03-08 06:14:47,713 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:14:47" (1/1) ... [2025-03-08 06:14:47,721 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:14:47" (1/1) ... [2025-03-08 06:14:47,734 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:14:47,736 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:14:47,736 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:14:47,736 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:14:47,737 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:14:47" (1/1) ... [2025-03-08 06:14:47,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:14:47,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:14:47,760 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:14:47,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:14:47,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:14:47,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:14:47,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:14:47,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:14:47,920 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:14:47,921 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:14:50,034 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1423: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-03-08 06:14:50,034 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2115: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-03-08 06:14:50,034 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1193: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-08 06:14:50,034 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L164: 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-08 06:14:50,034 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-03-08 06:14:50,034 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L963: havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-08 06:14:50,035 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2288: 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-08 06:14:50,035 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2950: havoc main_~node4____CPAchecker_TMP_2~1#1;havoc main_~node4____CPAchecker_TMP_1~1#1;havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-08 06:14:50,035 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3612: havoc main_~node4____CPAchecker_TMP_2~2#1;havoc main_~node4____CPAchecker_TMP_1~2#1;havoc main_~node4____CPAchecker_TMP_0~2#1; [2025-03-08 06:14:50,035 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4274: havoc main_~node4____CPAchecker_TMP_2~3#1;havoc main_~node4____CPAchecker_TMP_1~3#1;havoc main_~node4____CPAchecker_TMP_0~3#1; [2025-03-08 06:14:50,035 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4936: havoc main_~node4____CPAchecker_TMP_2~4#1;havoc main_~node4____CPAchecker_TMP_1~4#1;havoc main_~node4____CPAchecker_TMP_0~4#1; [2025-03-08 06:14:50,035 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5598: havoc main_~node4____CPAchecker_TMP_2~5#1;havoc main_~node4____CPAchecker_TMP_1~5#1;havoc main_~node4____CPAchecker_TMP_0~5#1; [2025-03-08 06:14:50,035 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6260: havoc main_~node4____CPAchecker_TMP_2~6#1;havoc main_~node4____CPAchecker_TMP_1~6#1;havoc main_~node4____CPAchecker_TMP_0~6#1; [2025-03-08 06:14:50,035 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2432: 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-08 06:14:50,035 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3094: havoc main_~node3____CPAchecker_TMP_2~1#1;havoc main_~node3____CPAchecker_TMP_1~1#1;havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-08 06:14:50,035 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3756: havoc main_~node3____CPAchecker_TMP_2~2#1;havoc main_~node3____CPAchecker_TMP_1~2#1;havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-08 06:14:50,035 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4418: havoc main_~node3____CPAchecker_TMP_2~3#1;havoc main_~node3____CPAchecker_TMP_1~3#1;havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-03-08 06:14:50,035 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5080: havoc main_~node3____CPAchecker_TMP_2~4#1;havoc main_~node3____CPAchecker_TMP_1~4#1;havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-08 06:14:50,035 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5742: havoc main_~node3____CPAchecker_TMP_2~5#1;havoc main_~node3____CPAchecker_TMP_1~5#1;havoc main_~node3____CPAchecker_TMP_0~5#1; [2025-03-08 06:14:50,035 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6404: havoc main_~node3____CPAchecker_TMP_2~6#1;havoc main_~node3____CPAchecker_TMP_1~6#1;havoc main_~node3____CPAchecker_TMP_0~6#1; [2025-03-08 06:14:50,035 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2576: 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-08 06:14:50,035 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3238: havoc main_~node2____CPAchecker_TMP_2~1#1;havoc main_~node2____CPAchecker_TMP_1~1#1;havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-08 06:14:50,035 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-03-08 06:14:50,035 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3900: havoc main_~node2____CPAchecker_TMP_2~2#1;havoc main_~node2____CPAchecker_TMP_1~2#1;havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-08 06:14:50,035 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4562: havoc main_~node2____CPAchecker_TMP_2~3#1;havoc main_~node2____CPAchecker_TMP_1~3#1;havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-03-08 06:14:50,035 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5224: havoc main_~node2____CPAchecker_TMP_2~4#1;havoc main_~node2____CPAchecker_TMP_1~4#1;havoc main_~node2____CPAchecker_TMP_0~4#1; [2025-03-08 06:14:50,035 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5886: havoc main_~node2____CPAchecker_TMP_2~5#1;havoc main_~node2____CPAchecker_TMP_1~5#1;havoc main_~node2____CPAchecker_TMP_0~5#1; [2025-03-08 06:14:50,036 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-08 06:14:50,036 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6548: havoc main_~node2____CPAchecker_TMP_2~6#1;havoc main_~node2____CPAchecker_TMP_1~6#1;havoc main_~node2____CPAchecker_TMP_0~6#1; [2025-03-08 06:14:50,036 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2720: 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-08 06:14:50,036 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3382: havoc main_~node1____CPAchecker_TMP_2~1#1;havoc main_~node1____CPAchecker_TMP_1~1#1;havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-08 06:14:50,036 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4044: havoc main_~node1____CPAchecker_TMP_2~2#1;havoc main_~node1____CPAchecker_TMP_1~2#1;havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-03-08 06:14:50,036 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4706: havoc main_~node1____CPAchecker_TMP_2~3#1;havoc main_~node1____CPAchecker_TMP_1~3#1;havoc main_~node1____CPAchecker_TMP_0~3#1; [2025-03-08 06:14:50,036 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5368: havoc main_~node1____CPAchecker_TMP_2~4#1;havoc main_~node1____CPAchecker_TMP_1~4#1;havoc main_~node1____CPAchecker_TMP_0~4#1; [2025-03-08 06:14:50,036 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6030: havoc main_~node1____CPAchecker_TMP_2~5#1;havoc main_~node1____CPAchecker_TMP_1~5#1;havoc main_~node1____CPAchecker_TMP_0~5#1; [2025-03-08 06:14:50,036 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6692: havoc main_~node1____CPAchecker_TMP_2~6#1;havoc main_~node1____CPAchecker_TMP_1~6#1;havoc main_~node1____CPAchecker_TMP_0~6#1; [2025-03-08 06:14:50,221 INFO L? ?]: Removed 221 outVars from TransFormulas that were not future-live. [2025-03-08 06:14:50,222 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:14:50,255 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:14:50,256 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:14:50,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:14:50 BoogieIcfgContainer [2025-03-08 06:14:50,256 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:14:50,258 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:14:50,258 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:14:50,262 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:14:50,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:14:46" (1/3) ... [2025-03-08 06:14:50,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@148df530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:14:50, skipping insertion in model container [2025-03-08 06:14:50,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:14:47" (2/3) ... [2025-03-08 06:14:50,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@148df530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:14:50, skipping insertion in model container [2025-03-08 06:14:50,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:14:50" (3/3) ... [2025-03-08 06:14:50,264 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2025-03-08 06:14:50,274 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:14:50,277 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.4.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c that has 1 procedures, 1121 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-08 06:14:50,338 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:14:50,348 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;@10c6d1dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:14:50,348 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 06:14:50,355 INFO L276 IsEmpty]: Start isEmpty. Operand has 1121 states, 1118 states have (on average 1.7361359570661896) internal successors, (1941), 1120 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:14:50,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 06:14:50,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:14:50,381 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:14:50,382 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:14:50,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:14:50,386 INFO L85 PathProgramCache]: Analyzing trace with hash 615075118, now seen corresponding path program 1 times [2025-03-08 06:14:50,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:14:50,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600842834] [2025-03-08 06:14:50,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:14:50,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:14:50,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 06:14:50,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 06:14:50,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:14:50,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:14:51,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:14:51,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:14:51,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600842834] [2025-03-08 06:14:51,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600842834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:14:51,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:14:51,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:14:51,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855393682] [2025-03-08 06:14:51,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:14:51,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:14:51,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:14:51,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:14:51,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:14:51,074 INFO L87 Difference]: Start difference. First operand has 1121 states, 1118 states have (on average 1.7361359570661896) internal successors, (1941), 1120 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:14:51,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:14:51,213 INFO L93 Difference]: Finished difference Result 2054 states and 3532 transitions. [2025-03-08 06:14:51,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:14:51,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2025-03-08 06:14:51,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:14:51,227 INFO L225 Difference]: With dead ends: 2054 [2025-03-08 06:14:51,227 INFO L226 Difference]: Without dead ends: 1118 [2025-03-08 06:14:51,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:14:51,237 INFO L435 NwaCegarLoop]: 1937 mSDtfsCounter, 0 mSDsluCounter, 3826 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5763 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:14:51,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5763 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:14:51,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2025-03-08 06:14:51,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1118. [2025-03-08 06:14:51,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1118 states, 1116 states have (on average 1.6926523297491038) internal successors, (1889), 1117 states have internal predecessors, (1889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:14:51,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1889 transitions. [2025-03-08 06:14:51,312 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1889 transitions. Word has length 150 [2025-03-08 06:14:51,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:14:51,313 INFO L471 AbstractCegarLoop]: Abstraction has 1118 states and 1889 transitions. [2025-03-08 06:14:51,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:14:51,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1889 transitions. [2025-03-08 06:14:51,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-08 06:14:51,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:14:51,323 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:14:51,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:14:51,324 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:14:51,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:14:51,325 INFO L85 PathProgramCache]: Analyzing trace with hash -255526073, now seen corresponding path program 1 times [2025-03-08 06:14:51,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:14:51,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007259218] [2025-03-08 06:14:51,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:14:51,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:14:51,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 06:14:51,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 06:14:51,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:14:51,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:14:51,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:14:51,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:14:51,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007259218] [2025-03-08 06:14:51,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007259218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:14:51,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:14:51,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:14:51,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685662686] [2025-03-08 06:14:51,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:14:51,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:14:51,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:14:51,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:14:51,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:14:51,628 INFO L87 Difference]: Start difference. First operand 1118 states and 1889 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:14:51,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:14:51,872 INFO L93 Difference]: Finished difference Result 2859 states and 4838 transitions. [2025-03-08 06:14:51,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:14:51,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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 191 [2025-03-08 06:14:51,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:14:51,884 INFO L225 Difference]: With dead ends: 2859 [2025-03-08 06:14:51,885 INFO L226 Difference]: Without dead ends: 1949 [2025-03-08 06:14:51,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:14:51,888 INFO L435 NwaCegarLoop]: 3002 mSDtfsCounter, 1382 mSDsluCounter, 1721 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1382 SdHoareTripleChecker+Valid, 4723 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:14:51,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1382 Valid, 4723 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:14:51,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1949 states. [2025-03-08 06:14:51,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1949 to 1939. [2025-03-08 06:14:51,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1939 states, 1937 states have (on average 1.6721734641197727) internal successors, (3239), 1938 states have internal predecessors, (3239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:14:51,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 3239 transitions. [2025-03-08 06:14:51,929 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 3239 transitions. Word has length 191 [2025-03-08 06:14:51,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:14:51,929 INFO L471 AbstractCegarLoop]: Abstraction has 1939 states and 3239 transitions. [2025-03-08 06:14:51,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:14:51,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 3239 transitions. [2025-03-08 06:14:51,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-08 06:14:51,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:14:51,933 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:14:51,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:14:51,933 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:14:51,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:14:51,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1562385899, now seen corresponding path program 1 times [2025-03-08 06:14:51,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:14:51,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717859992] [2025-03-08 06:14:51,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:14:51,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:14:51,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 06:14:51,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 06:14:51,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:14:51,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:14:52,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:14:52,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:14:52,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717859992] [2025-03-08 06:14:52,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717859992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:14:52,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:14:52,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:14:52,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450202213] [2025-03-08 06:14:52,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:14:52,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:14:52,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:14:52,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:14:52,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:14:52,099 INFO L87 Difference]: Start difference. First operand 1939 states and 3239 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:14:52,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:14:52,186 INFO L93 Difference]: Finished difference Result 3238 states and 5452 transitions. [2025-03-08 06:14:52,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:14:52,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 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 196 [2025-03-08 06:14:52,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:14:52,195 INFO L225 Difference]: With dead ends: 3238 [2025-03-08 06:14:52,195 INFO L226 Difference]: Without dead ends: 2328 [2025-03-08 06:14:52,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:14:52,198 INFO L435 NwaCegarLoop]: 2906 mSDtfsCounter, 1241 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1241 SdHoareTripleChecker+Valid, 4540 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:14:52,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1241 Valid, 4540 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:14:52,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2328 states. [2025-03-08 06:14:52,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2328 to 2324. [2025-03-08 06:14:52,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2324 states, 2322 states have (on average 1.677433247200689) internal successors, (3895), 2323 states have internal predecessors, (3895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:14:52,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 2324 states and 3895 transitions. [2025-03-08 06:14:52,249 INFO L78 Accepts]: Start accepts. Automaton has 2324 states and 3895 transitions. Word has length 196 [2025-03-08 06:14:52,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:14:52,249 INFO L471 AbstractCegarLoop]: Abstraction has 2324 states and 3895 transitions. [2025-03-08 06:14:52,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:14:52,250 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 3895 transitions. [2025-03-08 06:14:52,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-08 06:14:52,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:14:52,254 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:14:52,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:14:52,255 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:14:52,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:14:52,255 INFO L85 PathProgramCache]: Analyzing trace with hash -530146805, now seen corresponding path program 1 times [2025-03-08 06:14:52,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:14:52,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509055418] [2025-03-08 06:14:52,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:14:52,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:14:52,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-08 06:14:52,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-08 06:14:52,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:14:52,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:14:52,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:14:52,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:14:52,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509055418] [2025-03-08 06:14:52,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509055418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:14:52,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:14:52,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:14:52,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132660960] [2025-03-08 06:14:52,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:14:52,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:14:52,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:14:52,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:14:52,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:14:52,495 INFO L87 Difference]: Start difference. First operand 2324 states and 3895 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:14:52,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:14:52,659 INFO L93 Difference]: Finished difference Result 6356 states and 10643 transitions. [2025-03-08 06:14:52,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:14:52,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 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 199 [2025-03-08 06:14:52,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:14:52,680 INFO L225 Difference]: With dead ends: 6356 [2025-03-08 06:14:52,680 INFO L226 Difference]: Without dead ends: 4258 [2025-03-08 06:14:52,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:14:52,687 INFO L435 NwaCegarLoop]: 2994 mSDtfsCounter, 1399 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1399 SdHoareTripleChecker+Valid, 4712 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:14:52,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1399 Valid, 4712 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:14:52,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4258 states. [2025-03-08 06:14:52,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4258 to 4237. [2025-03-08 06:14:52,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4237 states, 4235 states have (on average 1.667060212514758) internal successors, (7060), 4236 states have internal predecessors, (7060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:14:52,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4237 states to 4237 states and 7060 transitions. [2025-03-08 06:14:52,791 INFO L78 Accepts]: Start accepts. Automaton has 4237 states and 7060 transitions. Word has length 199 [2025-03-08 06:14:52,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:14:52,792 INFO L471 AbstractCegarLoop]: Abstraction has 4237 states and 7060 transitions. [2025-03-08 06:14:52,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:14:52,792 INFO L276 IsEmpty]: Start isEmpty. Operand 4237 states and 7060 transitions. [2025-03-08 06:14:52,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 06:14:52,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:14:52,801 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:14:52,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:14:52,802 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:14:52,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:14:52,802 INFO L85 PathProgramCache]: Analyzing trace with hash -792262993, now seen corresponding path program 1 times [2025-03-08 06:14:52,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:14:52,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815219909] [2025-03-08 06:14:52,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:14:52,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:14:52,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 06:14:52,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 06:14:52,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:14:52,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:14:52,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:14:52,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:14:52,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815219909] [2025-03-08 06:14:52,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815219909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:14:52,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:14:52,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:14:52,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097414561] [2025-03-08 06:14:52,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:14:52,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:14:52,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:14:52,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:14:52,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:14:52,971 INFO L87 Difference]: Start difference. First operand 4237 states and 7060 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:14:53,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:14:53,127 INFO L93 Difference]: Finished difference Result 7494 states and 12548 transitions. [2025-03-08 06:14:53,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:14:53,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 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 204 [2025-03-08 06:14:53,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:14:53,152 INFO L225 Difference]: With dead ends: 7494 [2025-03-08 06:14:53,152 INFO L226 Difference]: Without dead ends: 5396 [2025-03-08 06:14:53,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:14:53,158 INFO L435 NwaCegarLoop]: 2840 mSDtfsCounter, 1212 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 4431 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:14:53,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 4431 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:14:53,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5396 states. [2025-03-08 06:14:53,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5396 to 5392. [2025-03-08 06:14:53,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5392 states, 5390 states have (on average 1.6701298701298701) internal successors, (9002), 5391 states have internal predecessors, (9002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:14:53,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5392 states to 5392 states and 9002 transitions. [2025-03-08 06:14:53,289 INFO L78 Accepts]: Start accepts. Automaton has 5392 states and 9002 transitions. Word has length 204 [2025-03-08 06:14:53,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:14:53,289 INFO L471 AbstractCegarLoop]: Abstraction has 5392 states and 9002 transitions. [2025-03-08 06:14:53,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:14:53,290 INFO L276 IsEmpty]: Start isEmpty. Operand 5392 states and 9002 transitions. [2025-03-08 06:14:53,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-08 06:14:53,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:14:53,300 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:14:53,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:14:53,301 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:14:53,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:14:53,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1593228423, now seen corresponding path program 1 times [2025-03-08 06:14:53,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:14:53,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802843639] [2025-03-08 06:14:53,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:14:53,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:14:53,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-08 06:14:53,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-08 06:14:53,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:14:53,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:14:53,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:14:53,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:14:53,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802843639] [2025-03-08 06:14:53,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802843639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:14:53,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:14:53,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:14:53,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468876528] [2025-03-08 06:14:53,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:14:53,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:14:53,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:14:53,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:14:53,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:14:53,522 INFO L87 Difference]: Start difference. First operand 5392 states and 9002 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:14:53,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:14:53,688 INFO L93 Difference]: Finished difference Result 15236 states and 25366 transitions. [2025-03-08 06:14:53,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:14:53,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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 207 [2025-03-08 06:14:53,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:14:53,724 INFO L225 Difference]: With dead ends: 15236 [2025-03-08 06:14:53,724 INFO L226 Difference]: Without dead ends: 10088 [2025-03-08 06:14:53,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:14:53,735 INFO L435 NwaCegarLoop]: 2919 mSDtfsCounter, 1368 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1368 SdHoareTripleChecker+Valid, 4586 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:14:53,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1368 Valid, 4586 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:14:53,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10088 states. [2025-03-08 06:14:53,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10088 to 10035. [2025-03-08 06:14:53,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10035 states, 10033 states have (on average 1.6552377155387221) internal successors, (16607), 10034 states have internal predecessors, (16607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:14:54,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10035 states to 10035 states and 16607 transitions. [2025-03-08 06:14:54,023 INFO L78 Accepts]: Start accepts. Automaton has 10035 states and 16607 transitions. Word has length 207 [2025-03-08 06:14:54,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:14:54,025 INFO L471 AbstractCegarLoop]: Abstraction has 10035 states and 16607 transitions. [2025-03-08 06:14:54,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:14:54,025 INFO L276 IsEmpty]: Start isEmpty. Operand 10035 states and 16607 transitions. [2025-03-08 06:14:54,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-08 06:14:54,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:14:54,040 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:14:54,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:14:54,040 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:14:54,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:14:54,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1009687949, now seen corresponding path program 1 times [2025-03-08 06:14:54,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:14:54,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916318805] [2025-03-08 06:14:54,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:14:54,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:14:54,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-08 06:14:54,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-08 06:14:54,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:14:54,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:14:54,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:14:54,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:14:54,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916318805] [2025-03-08 06:14:54,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916318805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:14:54,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:14:54,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:14:54,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101679187] [2025-03-08 06:14:54,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:14:54,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:14:54,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:14:54,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:14:54,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:14:54,240 INFO L87 Difference]: Start difference. First operand 10035 states and 16607 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:14:54,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:14:54,393 INFO L93 Difference]: Finished difference Result 18168 states and 30221 transitions. [2025-03-08 06:14:54,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:14:54,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 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 212 [2025-03-08 06:14:54,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:14:54,423 INFO L225 Difference]: With dead ends: 18168 [2025-03-08 06:14:54,423 INFO L226 Difference]: Without dead ends: 13020 [2025-03-08 06:14:54,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:14:54,435 INFO L435 NwaCegarLoop]: 2765 mSDtfsCounter, 1183 mSDsluCounter, 1540 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1183 SdHoareTripleChecker+Valid, 4305 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:14:54,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1183 Valid, 4305 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:14:54,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13020 states. [2025-03-08 06:14:54,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13020 to 13016. [2025-03-08 06:14:54,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13016 states, 13014 states have (on average 1.657061625941294) internal successors, (21565), 13015 states have internal predecessors, (21565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:14:54,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13016 states to 13016 states and 21565 transitions. [2025-03-08 06:14:54,737 INFO L78 Accepts]: Start accepts. Automaton has 13016 states and 21565 transitions. Word has length 212 [2025-03-08 06:14:54,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:14:54,738 INFO L471 AbstractCegarLoop]: Abstraction has 13016 states and 21565 transitions. [2025-03-08 06:14:54,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:14:54,738 INFO L276 IsEmpty]: Start isEmpty. Operand 13016 states and 21565 transitions. [2025-03-08 06:14:54,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-08 06:14:54,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:14:54,753 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:14:54,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:14:54,753 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:14:54,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:14:54,754 INFO L85 PathProgramCache]: Analyzing trace with hash 533203821, now seen corresponding path program 1 times [2025-03-08 06:14:54,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:14:54,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103223339] [2025-03-08 06:14:54,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:14:54,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:14:54,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 06:14:54,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 06:14:54,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:14:54,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:14:54,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:14:54,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:14:54,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103223339] [2025-03-08 06:14:54,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103223339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:14:54,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:14:54,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:14:54,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511560399] [2025-03-08 06:14:54,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:14:54,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:14:54,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:14:54,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:14:54,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:14:54,927 INFO L87 Difference]: Start difference. First operand 13016 states and 21565 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:14:55,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:14:55,273 INFO L93 Difference]: Finished difference Result 37226 states and 61403 transitions. [2025-03-08 06:14:55,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:14:55,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 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 215 [2025-03-08 06:14:55,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:14:55,318 INFO L225 Difference]: With dead ends: 37226 [2025-03-08 06:14:55,319 INFO L226 Difference]: Without dead ends: 24472 [2025-03-08 06:14:55,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:14:55,333 INFO L435 NwaCegarLoop]: 2844 mSDtfsCounter, 1337 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1337 SdHoareTripleChecker+Valid, 4460 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:14:55,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1337 Valid, 4460 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:14:55,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24472 states. [2025-03-08 06:14:55,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24472 to 24325. [2025-03-08 06:14:55,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24325 states, 24323 states have (on average 1.637380257369568) internal successors, (39826), 24324 states have internal predecessors, (39826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:14:55,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24325 states to 24325 states and 39826 transitions. [2025-03-08 06:14:55,790 INFO L78 Accepts]: Start accepts. Automaton has 24325 states and 39826 transitions. Word has length 215 [2025-03-08 06:14:55,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:14:55,790 INFO L471 AbstractCegarLoop]: Abstraction has 24325 states and 39826 transitions. [2025-03-08 06:14:55,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:14:55,790 INFO L276 IsEmpty]: Start isEmpty. Operand 24325 states and 39826 transitions. [2025-03-08 06:14:55,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-08 06:14:55,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:14:55,815 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:14:55,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:14:55,815 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:14:55,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:14:55,816 INFO L85 PathProgramCache]: Analyzing trace with hash -2057901763, now seen corresponding path program 1 times [2025-03-08 06:14:55,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:14:55,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669169971] [2025-03-08 06:14:55,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:14:55,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:14:55,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-08 06:14:55,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-08 06:14:55,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:14:55,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:14:55,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:14:55,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:14:55,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669169971] [2025-03-08 06:14:55,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669169971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:14:55,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:14:55,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:14:55,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317757391] [2025-03-08 06:14:55,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:14:55,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:14:55,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:14:55,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:14:55,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:14:55,949 INFO L87 Difference]: Start difference. First operand 24325 states and 39826 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:14:56,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:14:56,175 INFO L93 Difference]: Finished difference Result 44146 states and 72658 transitions. [2025-03-08 06:14:56,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:14:56,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 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 220 [2025-03-08 06:14:56,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:14:56,227 INFO L225 Difference]: With dead ends: 44146 [2025-03-08 06:14:56,227 INFO L226 Difference]: Without dead ends: 31392 [2025-03-08 06:14:56,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:14:56,245 INFO L435 NwaCegarLoop]: 2690 mSDtfsCounter, 1154 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1154 SdHoareTripleChecker+Valid, 4179 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:14:56,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1154 Valid, 4179 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:14:56,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31392 states. [2025-03-08 06:14:56,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31392 to 31388. [2025-03-08 06:14:56,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31388 states, 31386 states have (on average 1.636908175619703) internal successors, (51376), 31387 states have internal predecessors, (51376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:14:56,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31388 states to 31388 states and 51376 transitions. [2025-03-08 06:14:56,971 INFO L78 Accepts]: Start accepts. Automaton has 31388 states and 51376 transitions. Word has length 220 [2025-03-08 06:14:56,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:14:56,971 INFO L471 AbstractCegarLoop]: Abstraction has 31388 states and 51376 transitions. [2025-03-08 06:14:56,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:14:56,971 INFO L276 IsEmpty]: Start isEmpty. Operand 31388 states and 51376 transitions. [2025-03-08 06:14:57,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-08 06:14:57,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:14:57,005 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:14:57,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:14:57,005 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:14:57,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:14:57,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1797285547, now seen corresponding path program 1 times [2025-03-08 06:14:57,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:14:57,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83688460] [2025-03-08 06:14:57,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:14:57,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:14:57,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-08 06:14:57,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-08 06:14:57,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:14:57,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:14:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:14:57,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:14:57,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83688460] [2025-03-08 06:14:57,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83688460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:14:57,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:14:57,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:14:57,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909639425] [2025-03-08 06:14:57,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:14:57,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:14:57,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:14:57,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:14:57,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:14:57,256 INFO L87 Difference]: Start difference. First operand 31388 states and 51376 transitions. Second operand has 6 states, 6 states have (on average 37.166666666666664) internal successors, (223), 6 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:14:59,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:14:59,062 INFO L93 Difference]: Finished difference Result 198225 states and 327011 transitions. [2025-03-08 06:14:59,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:14:59,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.166666666666664) internal successors, (223), 6 states have internal predecessors, (223), 0 states have call successors, (0), 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 223 [2025-03-08 06:14:59,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:14:59,559 INFO L225 Difference]: With dead ends: 198225 [2025-03-08 06:14:59,559 INFO L226 Difference]: Without dead ends: 167111 [2025-03-08 06:14:59,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:14:59,608 INFO L435 NwaCegarLoop]: 5685 mSDtfsCounter, 7678 mSDsluCounter, 18667 mSDsCounter, 0 mSdLazyCounter, 1538 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7678 SdHoareTripleChecker+Valid, 24352 SdHoareTripleChecker+Invalid, 1567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:14:59,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7678 Valid, 24352 Invalid, 1567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1538 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:14:59,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167111 states. [2025-03-08 06:15:01,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167111 to 61336. [2025-03-08 06:15:01,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61336 states, 61334 states have (on average 1.6298627188834904) internal successors, (99966), 61335 states have internal predecessors, (99966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:01,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61336 states to 61336 states and 99966 transitions. [2025-03-08 06:15:01,288 INFO L78 Accepts]: Start accepts. Automaton has 61336 states and 99966 transitions. Word has length 223 [2025-03-08 06:15:01,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:15:01,288 INFO L471 AbstractCegarLoop]: Abstraction has 61336 states and 99966 transitions. [2025-03-08 06:15:01,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.166666666666664) internal successors, (223), 6 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:01,288 INFO L276 IsEmpty]: Start isEmpty. Operand 61336 states and 99966 transitions. [2025-03-08 06:15:01,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-08 06:15:01,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:15:01,334 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:15:01,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:15:01,334 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:15:01,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:15:01,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1935036474, now seen corresponding path program 1 times [2025-03-08 06:15:01,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:15:01,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927749294] [2025-03-08 06:15:01,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:15:01,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:15:01,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-08 06:15:01,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-08 06:15:01,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:15:01,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:15:01,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:15:01,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:15:01,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927749294] [2025-03-08 06:15:01,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927749294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:15:01,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:15:01,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:15:01,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506084240] [2025-03-08 06:15:01,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:15:01,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:15:01,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:15:01,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:15:01,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:15:01,515 INFO L87 Difference]: Start difference. First operand 61336 states and 99966 transitions. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:02,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:15:02,314 INFO L93 Difference]: Finished difference Result 200629 states and 328993 transitions. [2025-03-08 06:15:02,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:15:02,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 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 225 [2025-03-08 06:15:02,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:15:02,518 INFO L225 Difference]: With dead ends: 200629 [2025-03-08 06:15:02,518 INFO L226 Difference]: Without dead ends: 139567 [2025-03-08 06:15:02,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:15:02,609 INFO L435 NwaCegarLoop]: 2831 mSDtfsCounter, 4117 mSDsluCounter, 4210 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4117 SdHoareTripleChecker+Valid, 7041 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:15:02,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4117 Valid, 7041 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:15:02,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139567 states. [2025-03-08 06:15:04,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139567 to 100928. [2025-03-08 06:15:04,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100928 states, 100926 states have (on average 1.6307888948338387) internal successors, (164589), 100927 states have internal predecessors, (164589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:04,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100928 states to 100928 states and 164589 transitions. [2025-03-08 06:15:04,846 INFO L78 Accepts]: Start accepts. Automaton has 100928 states and 164589 transitions. Word has length 225 [2025-03-08 06:15:04,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:15:04,847 INFO L471 AbstractCegarLoop]: Abstraction has 100928 states and 164589 transitions. [2025-03-08 06:15:04,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:04,847 INFO L276 IsEmpty]: Start isEmpty. Operand 100928 states and 164589 transitions. [2025-03-08 06:15:04,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-08 06:15:04,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:15:04,915 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:15:04,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:15:04,915 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:15:04,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:15:04,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1799023357, now seen corresponding path program 1 times [2025-03-08 06:15:04,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:15:04,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454650104] [2025-03-08 06:15:04,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:15:04,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:15:04,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-08 06:15:04,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-08 06:15:04,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:15:04,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:15:05,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:15:05,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:15:05,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454650104] [2025-03-08 06:15:05,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454650104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:15:05,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:15:05,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:15:05,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873974209] [2025-03-08 06:15:05,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:15:05,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:15:05,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:15:05,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:15:05,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:15:05,105 INFO L87 Difference]: Start difference. First operand 100928 states and 164589 transitions. Second operand has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:06,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:15:06,394 INFO L93 Difference]: Finished difference Result 326563 states and 533826 transitions. [2025-03-08 06:15:06,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:15:06,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 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 226 [2025-03-08 06:15:06,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:15:06,690 INFO L225 Difference]: With dead ends: 326563 [2025-03-08 06:15:06,690 INFO L226 Difference]: Without dead ends: 225909 [2025-03-08 06:15:06,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:15:06,782 INFO L435 NwaCegarLoop]: 1726 mSDtfsCounter, 4114 mSDsluCounter, 4070 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4114 SdHoareTripleChecker+Valid, 5796 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:15:06,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4114 Valid, 5796 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:15:06,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225909 states. [2025-03-08 06:15:09,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225909 to 164024. [2025-03-08 06:15:09,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164024 states, 164022 states have (on average 1.6255014571216055) internal successors, (266618), 164023 states have internal predecessors, (266618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:09,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164024 states to 164024 states and 266618 transitions. [2025-03-08 06:15:09,946 INFO L78 Accepts]: Start accepts. Automaton has 164024 states and 266618 transitions. Word has length 226 [2025-03-08 06:15:09,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:15:09,946 INFO L471 AbstractCegarLoop]: Abstraction has 164024 states and 266618 transitions. [2025-03-08 06:15:09,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:09,947 INFO L276 IsEmpty]: Start isEmpty. Operand 164024 states and 266618 transitions. [2025-03-08 06:15:10,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-08 06:15:10,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:15:10,063 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:15:10,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:15:10,063 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:15:10,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:15:10,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1413098915, now seen corresponding path program 1 times [2025-03-08 06:15:10,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:15:10,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843344123] [2025-03-08 06:15:10,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:15:10,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:15:10,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-08 06:15:10,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-08 06:15:10,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:15:10,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:15:10,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:15:10,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:15:10,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843344123] [2025-03-08 06:15:10,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843344123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:15:10,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:15:10,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:15:10,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429291410] [2025-03-08 06:15:10,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:15:10,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:15:10,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:15:10,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:15:10,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:15:10,444 INFO L87 Difference]: Start difference. First operand 164024 states and 266618 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:12,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:15:12,145 INFO L93 Difference]: Finished difference Result 526603 states and 858078 transitions. [2025-03-08 06:15:12,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:15:12,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 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 227 [2025-03-08 06:15:12,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:15:12,982 INFO L225 Difference]: With dead ends: 526603 [2025-03-08 06:15:12,982 INFO L226 Difference]: Without dead ends: 362853 [2025-03-08 06:15:13,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:15:13,098 INFO L435 NwaCegarLoop]: 1705 mSDtfsCounter, 4063 mSDsluCounter, 3932 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4063 SdHoareTripleChecker+Valid, 5637 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:15:13,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4063 Valid, 5637 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:15:13,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362853 states. [2025-03-08 06:15:16,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362853 to 263990. [2025-03-08 06:15:17,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263990 states, 263988 states have (on average 1.6201797051381124) internal successors, (427708), 263989 states have internal predecessors, (427708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:18,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263990 states to 263990 states and 427708 transitions. [2025-03-08 06:15:18,197 INFO L78 Accepts]: Start accepts. Automaton has 263990 states and 427708 transitions. Word has length 227 [2025-03-08 06:15:18,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:15:18,197 INFO L471 AbstractCegarLoop]: Abstraction has 263990 states and 427708 transitions. [2025-03-08 06:15:18,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:18,197 INFO L276 IsEmpty]: Start isEmpty. Operand 263990 states and 427708 transitions. [2025-03-08 06:15:18,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-08 06:15:18,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:15:18,345 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:15:18,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:15:18,346 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:15:18,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:15:18,346 INFO L85 PathProgramCache]: Analyzing trace with hash -2138286406, now seen corresponding path program 1 times [2025-03-08 06:15:18,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:15:18,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382550814] [2025-03-08 06:15:18,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:15:18,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:15:18,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-08 06:15:18,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-08 06:15:18,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:15:18,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:15:18,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:15:18,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:15:18,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382550814] [2025-03-08 06:15:18,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382550814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:15:18,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:15:18,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:15:18,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242691639] [2025-03-08 06:15:18,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:15:18,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:15:18,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:15:18,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:15:18,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:15:18,528 INFO L87 Difference]: Start difference. First operand 263990 states and 427708 transitions. Second operand has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:21,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:15:21,388 INFO L93 Difference]: Finished difference Result 835862 states and 1357536 transitions. [2025-03-08 06:15:21,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:15:21,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 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 228 [2025-03-08 06:15:21,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:15:22,384 INFO L225 Difference]: With dead ends: 835862 [2025-03-08 06:15:22,384 INFO L226 Difference]: Without dead ends: 572146 [2025-03-08 06:15:22,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:15:22,653 INFO L435 NwaCegarLoop]: 1703 mSDtfsCounter, 4012 mSDsluCounter, 3762 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4012 SdHoareTripleChecker+Valid, 5465 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:15:22,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4012 Valid, 5465 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:15:23,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572146 states. [2025-03-08 06:15:29,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572146 to 417856. [2025-03-08 06:15:29,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417856 states, 417854 states have (on average 1.6147841111967338) internal successors, (674744), 417855 states have internal predecessors, (674744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:30,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417856 states to 417856 states and 674744 transitions. [2025-03-08 06:15:30,990 INFO L78 Accepts]: Start accepts. Automaton has 417856 states and 674744 transitions. Word has length 228 [2025-03-08 06:15:30,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:15:30,990 INFO L471 AbstractCegarLoop]: Abstraction has 417856 states and 674744 transitions. [2025-03-08 06:15:30,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:15:30,991 INFO L276 IsEmpty]: Start isEmpty. Operand 417856 states and 674744 transitions. [2025-03-08 06:15:31,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-08 06:15:31,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:15:31,289 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:15:31,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:15:31,289 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:15:31,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:15:31,289 INFO L85 PathProgramCache]: Analyzing trace with hash -453039752, now seen corresponding path program 1 times [2025-03-08 06:15:31,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:15:31,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231841051] [2025-03-08 06:15:31,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:15:31,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:15:31,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-08 06:15:31,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-08 06:15:31,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:15:31,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:15:31,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:15:31,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:15:31,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231841051] [2025-03-08 06:15:31,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231841051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:15:31,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:15:31,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:15:31,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690891473] [2025-03-08 06:15:31,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:15:31,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:15:31,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:15:31,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:15:31,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:15:31,627 INFO L87 Difference]: Start difference. First operand 417856 states and 674744 transitions. Second operand has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)