./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_lcr-var-start-time.5.ufo.BOUNDED-10.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 351e3bc8fe69313dfbfbeaf7f37de5791a1bf381bb5ef0945347e83cb39fb485 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:09:50,216 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:09:50,270 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:09:50,276 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:09:50,277 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:09:50,298 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:09:50,299 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:09:50,299 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:09:50,300 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:09:50,300 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:09:50,300 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:09:50,301 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:09:50,301 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:09:50,301 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:09:50,301 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:09:50,301 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:09:50,302 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:09:50,302 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:09:50,302 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:09:50,302 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:09:50,302 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:09:50,302 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:09:50,302 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:09:50,302 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:09:50,302 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:09:50,302 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:09:50,302 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:09:50,302 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:09:50,303 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:09:50,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:09:50,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:09:50,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:09:50,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:09:50,303 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:09:50,303 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:09:50,304 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:09:50,304 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:09:50,304 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:09:50,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:09:50,304 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:09:50,304 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:09:50,304 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:09:50,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:09:50,304 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 -> 351e3bc8fe69313dfbfbeaf7f37de5791a1bf381bb5ef0945347e83cb39fb485 [2025-03-03 15:09:50,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:09:50,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:09:50,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:09:50,552 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:09:50,552 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:09:50,553 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2025-03-03 15:09:51,673 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77b8985ad/f6433412a2b84ee6968008f3e59b8333/FLAG6c4e82ba9 [2025-03-03 15:09:51,943 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:09:51,947 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2025-03-03 15:09:51,960 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77b8985ad/f6433412a2b84ee6968008f3e59b8333/FLAG6c4e82ba9 [2025-03-03 15:09:52,238 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77b8985ad/f6433412a2b84ee6968008f3e59b8333 [2025-03-03 15:09:52,240 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:09:52,242 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:09:52,242 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:09:52,242 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:09:52,245 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:09:52,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:09:52" (1/1) ... [2025-03-03 15:09:52,246 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@92aed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:52, skipping insertion in model container [2025-03-03 15:09:52,246 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:09:52" (1/1) ... [2025-03-03 15:09:52,273 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:09:52,430 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_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c[11101,11114] [2025-03-03 15:09:52,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:09:52,486 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:09:52,546 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_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c[11101,11114] [2025-03-03 15:09:52,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:09:52,591 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:09:52,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:52 WrapperNode [2025-03-03 15:09:52,593 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:09:52,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:09:52,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:09:52,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:09:52,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:52" (1/1) ... [2025-03-03 15:09:52,611 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:52" (1/1) ... [2025-03-03 15:09:52,654 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1197 [2025-03-03 15:09:52,655 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:09:52,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:09:52,656 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:09:52,656 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:09:52,661 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:52" (1/1) ... [2025-03-03 15:09:52,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:52" (1/1) ... [2025-03-03 15:09:52,668 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:52" (1/1) ... [2025-03-03 15:09:52,698 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-03 15:09:52,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:52" (1/1) ... [2025-03-03 15:09:52,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:52" (1/1) ... [2025-03-03 15:09:52,709 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:52" (1/1) ... [2025-03-03 15:09:52,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:52" (1/1) ... [2025-03-03 15:09:52,715 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:52" (1/1) ... [2025-03-03 15:09:52,716 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:52" (1/1) ... [2025-03-03 15:09:52,723 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:09:52,727 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:09:52,727 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:09:52,727 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:09:52,728 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:52" (1/1) ... [2025-03-03 15:09:52,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:09:52,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:09:52,758 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-03 15:09:52,760 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-03 15:09:52,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:09:52,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:09:52,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:09:52,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:09:52,877 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:09:52,879 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:09:53,699 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1324: havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-03 15:09:53,700 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1754: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-03 15:09:53,700 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L665: havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-03-03 15:09:53,700 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L302: havoc main_~node5__m5~0#1; [2025-03-03 15:09:53,700 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1954: havoc main_~node1____CPAchecker_TMP_1~2#1; [2025-03-03 15:09:53,700 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L865: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-03 15:09:53,700 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1296: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-03 15:09:53,700 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L505: havoc main_~node2__m2~2#1; [2025-03-03 15:09:53,700 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1496: havoc main_~node1____CPAchecker_TMP_1~1#1; [2025-03-03 15:09:53,700 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1926: havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-03-03 15:09:53,701 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L837: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:09:53,701 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc main_~node4____CPAchecker_TMP_1~2#1; [2025-03-03 15:09:53,701 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L375: havoc main_~node2__m2~1#1; [2025-03-03 15:09:53,701 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L541: havoc main_~node4__m4~2#1; [2025-03-03 15:09:53,701 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1037: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-03-03 15:09:53,701 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L609: havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-03 15:09:53,701 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1468: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-03 15:09:53,701 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L411: havoc main_~node4__m4~1#1; [2025-03-03 15:09:53,702 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1238: havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-03-03 15:09:53,702 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1668: havoc main_~node4____CPAchecker_TMP_0~2#1; [2025-03-03 15:09:53,702 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L248: havoc main_~node2__m2~0#1; [2025-03-03 15:09:53,702 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1009: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-03 15:09:53,703 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1868: havoc main_~node2____CPAchecker_TMP_1~2#1; [2025-03-03 15:09:53,703 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L779: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-03 15:09:53,703 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L284: havoc main_~node4__m4~0#1; [2025-03-03 15:09:53,703 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-03 15:09:53,703 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1410: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-03 15:09:53,703 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1840: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-03 15:09:53,703 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L486: havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-03 15:09:53,703 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L751: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-03 15:09:53,703 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1610: havoc main_~node5____CPAchecker_TMP_1~2#1; [2025-03-03 15:09:53,703 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L356: havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-03 15:09:53,703 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L951: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-03 15:09:53,703 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L523: havoc main_~node3__m3~2#1; [2025-03-03 15:09:53,704 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1382: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-03 15:09:53,704 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1152: havoc main_~node5____CPAchecker_TMP_1~1#1; [2025-03-03 15:09:53,704 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1582: havoc main_~node5____CPAchecker_TMP_0~2#1; [2025-03-03 15:09:53,704 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L393: havoc main_~node3__m3~1#1; [2025-03-03 15:09:53,704 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L559: havoc main_~node5__m5~2#1; [2025-03-03 15:09:53,704 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L229: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:09:53,704 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L923: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:09:53,704 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1782: havoc main_~node3____CPAchecker_TMP_1~2#1; [2025-03-03 15:09:53,704 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L693: havoc main_~node5____CPAchecker_TMP_1~0#1; [2025-03-03 15:09:53,704 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L429: havoc main_~node5__m5~1#1; [2025-03-03 15:09:53,704 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1124: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-03 15:09:53,704 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc main_~node3__m3~0#1; [2025-03-03 15:09:53,746 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-03-03 15:09:53,746 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:09:53,765 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:09:53,766 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:09:53,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:09:53 BoogieIcfgContainer [2025-03-03 15:09:53,766 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:09:53,768 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:09:53,771 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:09:53,774 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:09:53,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:09:52" (1/3) ... [2025-03-03 15:09:53,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bdb86dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:09:53, skipping insertion in model container [2025-03-03 15:09:53,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:52" (2/3) ... [2025-03-03 15:09:53,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bdb86dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:09:53, skipping insertion in model container [2025-03-03 15:09:53,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:09:53" (3/3) ... [2025-03-03 15:09:53,776 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2025-03-03 15:09:53,787 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:09:53,789 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c that has 1 procedures, 330 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 15:09:53,834 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:09:53,841 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;@6dc1a720, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:09:53,841 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:09:53,846 INFO L276 IsEmpty]: Start isEmpty. Operand has 330 states, 328 states have (on average 1.6524390243902438) internal successors, (542), 329 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:53,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:09:53,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:53,853 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] [2025-03-03 15:09:53,853 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:53,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:53,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1473511689, now seen corresponding path program 1 times [2025-03-03 15:09:53,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:53,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071586827] [2025-03-03 15:09:53,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:53,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:53,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:09:53,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:09:53,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:53,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:54,283 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-03 15:09:54,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:54,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071586827] [2025-03-03 15:09:54,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071586827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:54,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:54,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:09:54,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775946935] [2025-03-03 15:09:54,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:54,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:09:54,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:54,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:09:54,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:09:54,307 INFO L87 Difference]: Start difference. First operand has 330 states, 328 states have (on average 1.6524390243902438) internal successors, (542), 329 states have internal predecessors, (542), 0 states have call successors, (0), 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 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:54,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:54,421 INFO L93 Difference]: Finished difference Result 627 states and 1019 transitions. [2025-03-03 15:09:54,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:09:54,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-03-03 15:09:54,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:54,430 INFO L225 Difference]: With dead ends: 627 [2025-03-03 15:09:54,430 INFO L226 Difference]: Without dead ends: 327 [2025-03-03 15:09:54,437 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-03 15:09:54,439 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 154 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:54,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 1412 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:09:54,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-03-03 15:09:54,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2025-03-03 15:09:54,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 1.5368098159509203) internal successors, (501), 326 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:54,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 501 transitions. [2025-03-03 15:09:54,473 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 501 transitions. Word has length 79 [2025-03-03 15:09:54,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:54,473 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 501 transitions. [2025-03-03 15:09:54,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:54,474 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 501 transitions. [2025-03-03 15:09:54,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:09:54,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:54,476 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] [2025-03-03 15:09:54,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:09:54,477 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:54,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:54,477 INFO L85 PathProgramCache]: Analyzing trace with hash -214557289, now seen corresponding path program 1 times [2025-03-03 15:09:54,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:54,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663419460] [2025-03-03 15:09:54,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:54,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:54,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:09:54,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:09:54,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:54,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:54,617 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-03 15:09:54,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:54,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663419460] [2025-03-03 15:09:54,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663419460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:54,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:54,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:54,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870339238] [2025-03-03 15:09:54,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:54,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:54,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:54,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:54,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:54,620 INFO L87 Difference]: Start difference. First operand 327 states and 501 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:54,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:54,656 INFO L93 Difference]: Finished difference Result 761 states and 1193 transitions. [2025-03-03 15:09:54,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:54,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2025-03-03 15:09:54,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:54,658 INFO L225 Difference]: With dead ends: 761 [2025-03-03 15:09:54,658 INFO L226 Difference]: Without dead ends: 483 [2025-03-03 15:09:54,659 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-03 15:09:54,659 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 304 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:54,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 890 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:54,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2025-03-03 15:09:54,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 481. [2025-03-03 15:09:54,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 1.5520833333333333) internal successors, (745), 480 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:54,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 745 transitions. [2025-03-03 15:09:54,675 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 745 transitions. Word has length 110 [2025-03-03 15:09:54,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:54,675 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 745 transitions. [2025-03-03 15:09:54,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:54,675 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 745 transitions. [2025-03-03 15:09:54,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:09:54,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:54,677 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:09:54,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:09:54,677 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:54,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:54,678 INFO L85 PathProgramCache]: Analyzing trace with hash 710106862, now seen corresponding path program 1 times [2025-03-03 15:09:54,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:54,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990281828] [2025-03-03 15:09:54,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:54,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:54,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:09:54,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:09:54,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:54,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:54,757 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-03 15:09:54,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:54,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990281828] [2025-03-03 15:09:54,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990281828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:54,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:54,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:54,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908121609] [2025-03-03 15:09:54,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:54,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:54,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:54,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:54,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:54,758 INFO L87 Difference]: Start difference. First operand 481 states and 745 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:54,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:54,795 INFO L93 Difference]: Finished difference Result 1163 states and 1832 transitions. [2025-03-03 15:09:54,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:54,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2025-03-03 15:09:54,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:54,798 INFO L225 Difference]: With dead ends: 1163 [2025-03-03 15:09:54,799 INFO L226 Difference]: Without dead ends: 744 [2025-03-03 15:09:54,799 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-03 15:09:54,800 INFO L435 NwaCegarLoop]: 577 mSDtfsCounter, 289 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:54,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 953 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:54,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2025-03-03 15:09:54,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 742. [2025-03-03 15:09:54,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 1.562753036437247) internal successors, (1158), 741 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:54,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1158 transitions. [2025-03-03 15:09:54,825 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1158 transitions. Word has length 112 [2025-03-03 15:09:54,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:54,826 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 1158 transitions. [2025-03-03 15:09:54,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:54,826 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1158 transitions. [2025-03-03 15:09:54,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 15:09:54,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:54,829 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:09:54,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:09:54,829 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:54,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:54,829 INFO L85 PathProgramCache]: Analyzing trace with hash 400923987, now seen corresponding path program 1 times [2025-03-03 15:09:54,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:54,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672559446] [2025-03-03 15:09:54,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:54,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:54,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 15:09:54,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 15:09:54,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:54,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:54,935 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-03 15:09:54,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:54,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672559446] [2025-03-03 15:09:54,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672559446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:54,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:54,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:54,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074294487] [2025-03-03 15:09:54,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:54,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:54,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:54,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:54,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:54,937 INFO L87 Difference]: Start difference. First operand 742 states and 1158 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:54,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:54,973 INFO L93 Difference]: Finished difference Result 1834 states and 2894 transitions. [2025-03-03 15:09:54,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:54,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-03 15:09:54,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:54,978 INFO L225 Difference]: With dead ends: 1834 [2025-03-03 15:09:54,978 INFO L226 Difference]: Without dead ends: 1167 [2025-03-03 15:09:54,979 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-03 15:09:54,981 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 274 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:54,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 820 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:54,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2025-03-03 15:09:55,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1165. [2025-03-03 15:09:55,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1165 states, 1164 states have (on average 1.5670103092783505) internal successors, (1824), 1164 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:55,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1824 transitions. [2025-03-03 15:09:55,010 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1824 transitions. Word has length 114 [2025-03-03 15:09:55,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:55,010 INFO L471 AbstractCegarLoop]: Abstraction has 1165 states and 1824 transitions. [2025-03-03 15:09:55,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:55,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1824 transitions. [2025-03-03 15:09:55,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 15:09:55,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:55,013 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] [2025-03-03 15:09:55,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:09:55,013 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:55,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:55,013 INFO L85 PathProgramCache]: Analyzing trace with hash 405986770, now seen corresponding path program 1 times [2025-03-03 15:09:55,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:55,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634990043] [2025-03-03 15:09:55,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:55,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:55,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 15:09:55,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 15:09:55,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:55,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:55,101 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-03 15:09:55,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:55,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634990043] [2025-03-03 15:09:55,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634990043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:55,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:55,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:55,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354752456] [2025-03-03 15:09:55,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:55,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:55,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:55,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:55,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:55,105 INFO L87 Difference]: Start difference. First operand 1165 states and 1824 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:55,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:55,168 INFO L93 Difference]: Finished difference Result 2887 states and 4547 transitions. [2025-03-03 15:09:55,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:55,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2025-03-03 15:09:55,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:55,174 INFO L225 Difference]: With dead ends: 2887 [2025-03-03 15:09:55,175 INFO L226 Difference]: Without dead ends: 1810 [2025-03-03 15:09:55,178 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-03 15:09:55,179 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 259 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:55,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 785 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:55,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2025-03-03 15:09:55,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1808. [2025-03-03 15:09:55,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1807 states have (on average 1.563918096292197) internal successors, (2826), 1807 states have internal predecessors, (2826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:55,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2826 transitions. [2025-03-03 15:09:55,218 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2826 transitions. Word has length 116 [2025-03-03 15:09:55,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:55,218 INFO L471 AbstractCegarLoop]: Abstraction has 1808 states and 2826 transitions. [2025-03-03 15:09:55,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:55,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2826 transitions. [2025-03-03 15:09:55,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 15:09:55,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:55,222 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:09:55,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:09:55,222 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:55,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:55,222 INFO L85 PathProgramCache]: Analyzing trace with hash -413239821, now seen corresponding path program 1 times [2025-03-03 15:09:55,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:55,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923617905] [2025-03-03 15:09:55,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:55,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:55,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 15:09:55,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 15:09:55,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:55,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:55,312 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-03 15:09:55,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:55,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923617905] [2025-03-03 15:09:55,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923617905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:55,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:55,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:55,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3315357] [2025-03-03 15:09:55,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:55,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:55,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:55,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:55,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:55,314 INFO L87 Difference]: Start difference. First operand 1808 states and 2826 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:55,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:55,350 INFO L93 Difference]: Finished difference Result 4392 states and 6872 transitions. [2025-03-03 15:09:55,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:55,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2025-03-03 15:09:55,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:55,361 INFO L225 Difference]: With dead ends: 4392 [2025-03-03 15:09:55,361 INFO L226 Difference]: Without dead ends: 2685 [2025-03-03 15:09:55,364 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-03 15:09:55,364 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 244 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:55,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 761 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:55,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2685 states. [2025-03-03 15:09:55,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2685 to 2683. [2025-03-03 15:09:55,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2683 states, 2682 states have (on average 1.5510812826249067) internal successors, (4160), 2682 states have internal predecessors, (4160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:55,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2683 states to 2683 states and 4160 transitions. [2025-03-03 15:09:55,436 INFO L78 Accepts]: Start accepts. Automaton has 2683 states and 4160 transitions. Word has length 118 [2025-03-03 15:09:55,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:55,436 INFO L471 AbstractCegarLoop]: Abstraction has 2683 states and 4160 transitions. [2025-03-03 15:09:55,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:55,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2683 states and 4160 transitions. [2025-03-03 15:09:55,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 15:09:55,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:55,444 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:09:55,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:09:55,444 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:55,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:55,445 INFO L85 PathProgramCache]: Analyzing trace with hash 534351382, now seen corresponding path program 1 times [2025-03-03 15:09:55,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:55,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331785086] [2025-03-03 15:09:55,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:55,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:55,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 15:09:55,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 15:09:55,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:55,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:55,652 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-03 15:09:55,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:55,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331785086] [2025-03-03 15:09:55,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331785086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:55,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:55,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:09:55,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388868385] [2025-03-03 15:09:55,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:55,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:09:55,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:55,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:09:55,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:55,654 INFO L87 Difference]: Start difference. First operand 2683 states and 4160 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:55,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:55,923 INFO L93 Difference]: Finished difference Result 15784 states and 24519 transitions. [2025-03-03 15:09:55,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:09:55,923 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2025-03-03 15:09:55,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:55,964 INFO L225 Difference]: With dead ends: 15784 [2025-03-03 15:09:55,965 INFO L226 Difference]: Without dead ends: 13206 [2025-03-03 15:09:55,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:09:55,972 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 3064 mSDsluCounter, 2808 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3064 SdHoareTripleChecker+Valid, 3249 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:55,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3064 Valid, 3249 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:09:55,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13206 states. [2025-03-03 15:09:56,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13206 to 5166. [2025-03-03 15:09:56,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5166 states, 5165 states have (on average 1.5295256534365924) internal successors, (7900), 5165 states have internal predecessors, (7900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:56,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 7900 transitions. [2025-03-03 15:09:56,170 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 7900 transitions. Word has length 120 [2025-03-03 15:09:56,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:56,170 INFO L471 AbstractCegarLoop]: Abstraction has 5166 states and 7900 transitions. [2025-03-03 15:09:56,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:56,170 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 7900 transitions. [2025-03-03 15:09:56,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 15:09:56,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:56,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:09:56,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:09:56,179 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:56,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:56,180 INFO L85 PathProgramCache]: Analyzing trace with hash 2007851322, now seen corresponding path program 1 times [2025-03-03 15:09:56,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:56,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482091513] [2025-03-03 15:09:56,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:56,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:56,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 15:09:56,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 15:09:56,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:56,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:56,437 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-03 15:09:56,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:56,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482091513] [2025-03-03 15:09:56,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482091513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:56,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:56,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:09:56,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285066722] [2025-03-03 15:09:56,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:56,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:09:56,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:56,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:09:56,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:56,438 INFO L87 Difference]: Start difference. First operand 5166 states and 7900 transitions. Second operand has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:56,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:56,733 INFO L93 Difference]: Finished difference Result 26107 states and 39536 transitions. [2025-03-03 15:09:56,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:09:56,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2025-03-03 15:09:56,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:56,783 INFO L225 Difference]: With dead ends: 26107 [2025-03-03 15:09:56,783 INFO L226 Difference]: Without dead ends: 21036 [2025-03-03 15:09:56,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:56,820 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 3936 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3936 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:56,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3936 Valid, 1578 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:09:56,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21036 states. [2025-03-03 15:09:57,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21036 to 21028. [2025-03-03 15:09:57,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21028 states, 21027 states have (on average 1.504113758500975) internal successors, (31627), 21027 states have internal predecessors, (31627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:57,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21028 states to 21028 states and 31627 transitions. [2025-03-03 15:09:57,309 INFO L78 Accepts]: Start accepts. Automaton has 21028 states and 31627 transitions. Word has length 123 [2025-03-03 15:09:57,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:57,310 INFO L471 AbstractCegarLoop]: Abstraction has 21028 states and 31627 transitions. [2025-03-03 15:09:57,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:57,310 INFO L276 IsEmpty]: Start isEmpty. Operand 21028 states and 31627 transitions. [2025-03-03 15:09:57,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 15:09:57,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:57,338 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] [2025-03-03 15:09:57,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:09:57,339 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:57,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:57,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1134975864, now seen corresponding path program 1 times [2025-03-03 15:09:57,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:57,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630666202] [2025-03-03 15:09:57,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:57,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:57,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 15:09:57,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 15:09:57,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:57,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:57,421 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-03 15:09:57,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:57,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630666202] [2025-03-03 15:09:57,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630666202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:57,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:57,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:57,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039245887] [2025-03-03 15:09:57,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:57,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:57,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:57,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:57,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:57,422 INFO L87 Difference]: Start difference. First operand 21028 states and 31627 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:57,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:57,503 INFO L93 Difference]: Finished difference Result 31851 states and 47780 transitions. [2025-03-03 15:09:57,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:57,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2025-03-03 15:09:57,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:57,547 INFO L225 Difference]: With dead ends: 31851 [2025-03-03 15:09:57,547 INFO L226 Difference]: Without dead ends: 27492 [2025-03-03 15:09:57,562 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-03 15:09:57,562 INFO L435 NwaCegarLoop]: 723 mSDtfsCounter, 262 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:57,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 1133 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:57,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27492 states. [2025-03-03 15:09:57,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27492 to 27490. [2025-03-03 15:09:57,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27490 states, 27489 states have (on average 1.4949252428244024) internal successors, (41094), 27489 states have internal predecessors, (41094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:57,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27490 states to 27490 states and 41094 transitions. [2025-03-03 15:09:57,968 INFO L78 Accepts]: Start accepts. Automaton has 27490 states and 41094 transitions. Word has length 125 [2025-03-03 15:09:57,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:57,968 INFO L471 AbstractCegarLoop]: Abstraction has 27490 states and 41094 transitions. [2025-03-03 15:09:57,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:57,969 INFO L276 IsEmpty]: Start isEmpty. Operand 27490 states and 41094 transitions. [2025-03-03 15:09:58,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 15:09:58,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:58,062 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] [2025-03-03 15:09:58,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:09:58,062 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:58,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:58,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1271842684, now seen corresponding path program 1 times [2025-03-03 15:09:58,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:58,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736564447] [2025-03-03 15:09:58,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:58,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:58,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 15:09:58,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 15:09:58,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:58,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:58,175 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-03 15:09:58,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:58,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736564447] [2025-03-03 15:09:58,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736564447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:58,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:58,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:58,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633190960] [2025-03-03 15:09:58,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:58,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:58,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:58,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:58,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:58,181 INFO L87 Difference]: Start difference. First operand 27490 states and 41094 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:58,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:58,447 INFO L93 Difference]: Finished difference Result 56735 states and 84414 transitions. [2025-03-03 15:09:58,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:58,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2025-03-03 15:09:58,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:58,521 INFO L225 Difference]: With dead ends: 56735 [2025-03-03 15:09:58,521 INFO L226 Difference]: Without dead ends: 41673 [2025-03-03 15:09:58,547 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-03 15:09:58,547 INFO L435 NwaCegarLoop]: 762 mSDtfsCounter, 309 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:58,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 1172 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:09:58,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41673 states. [2025-03-03 15:09:59,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41673 to 41671. [2025-03-03 15:09:59,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41671 states, 41670 states have (on average 1.480681545476362) internal successors, (61700), 41670 states have internal predecessors, (61700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:59,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41671 states to 41671 states and 61700 transitions. [2025-03-03 15:09:59,180 INFO L78 Accepts]: Start accepts. Automaton has 41671 states and 61700 transitions. Word has length 125 [2025-03-03 15:09:59,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:59,180 INFO L471 AbstractCegarLoop]: Abstraction has 41671 states and 61700 transitions. [2025-03-03 15:09:59,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:59,180 INFO L276 IsEmpty]: Start isEmpty. Operand 41671 states and 61700 transitions. [2025-03-03 15:09:59,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 15:09:59,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:59,228 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] [2025-03-03 15:09:59,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:09:59,228 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:59,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:59,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1835512568, now seen corresponding path program 1 times [2025-03-03 15:09:59,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:59,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590902174] [2025-03-03 15:09:59,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:59,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:59,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 15:09:59,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 15:09:59,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:59,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:59,310 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-03 15:09:59,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:59,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590902174] [2025-03-03 15:09:59,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590902174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:59,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:59,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:59,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245274524] [2025-03-03 15:09:59,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:59,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:59,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:59,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:59,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:59,311 INFO L87 Difference]: Start difference. First operand 41671 states and 61700 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:59,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:59,710 INFO L93 Difference]: Finished difference Result 104132 states and 153379 transitions. [2025-03-03 15:09:59,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:59,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2025-03-03 15:09:59,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:59,826 INFO L225 Difference]: With dead ends: 104132 [2025-03-03 15:09:59,826 INFO L226 Difference]: Without dead ends: 71048 [2025-03-03 15:09:59,854 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-03 15:09:59,855 INFO L435 NwaCegarLoop]: 781 mSDtfsCounter, 299 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:59,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 1191 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:59,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71048 states. [2025-03-03 15:10:00,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71048 to 71046. [2025-03-03 15:10:00,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71046 states, 71045 states have (on average 1.463537194735731) internal successors, (103977), 71045 states have internal predecessors, (103977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:00,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71046 states to 71046 states and 103977 transitions. [2025-03-03 15:10:00,746 INFO L78 Accepts]: Start accepts. Automaton has 71046 states and 103977 transitions. Word has length 125 [2025-03-03 15:10:00,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:00,746 INFO L471 AbstractCegarLoop]: Abstraction has 71046 states and 103977 transitions. [2025-03-03 15:10:00,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:00,747 INFO L276 IsEmpty]: Start isEmpty. Operand 71046 states and 103977 transitions. [2025-03-03 15:10:00,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 15:10:00,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:00,984 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] [2025-03-03 15:10:00,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:10:00,985 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:10:00,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:00,989 INFO L85 PathProgramCache]: Analyzing trace with hash 848030204, now seen corresponding path program 1 times [2025-03-03 15:10:00,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:00,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759956023] [2025-03-03 15:10:00,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:00,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:01,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 15:10:01,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 15:10:01,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:01,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:01,070 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-03 15:10:01,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:01,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759956023] [2025-03-03 15:10:01,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759956023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:01,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:01,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:10:01,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3896643] [2025-03-03 15:10:01,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:01,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:10:01,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:01,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:10:01,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:10:01,072 INFO L87 Difference]: Start difference. First operand 71046 states and 103977 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:01,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:01,686 INFO L93 Difference]: Finished difference Result 181692 states and 264347 transitions. [2025-03-03 15:10:01,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:10:01,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2025-03-03 15:10:01,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:01,857 INFO L225 Difference]: With dead ends: 181692 [2025-03-03 15:10:01,857 INFO L226 Difference]: Without dead ends: 116544 [2025-03-03 15:10:01,904 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-03 15:10:01,906 INFO L435 NwaCegarLoop]: 798 mSDtfsCounter, 346 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:01,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 1208 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:10:01,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116544 states. [2025-03-03 15:10:03,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116544 to 116542. [2025-03-03 15:10:03,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116542 states, 116541 states have (on average 1.4427283102084245) internal successors, (168137), 116541 states have internal predecessors, (168137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:03,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116542 states to 116542 states and 168137 transitions. [2025-03-03 15:10:03,764 INFO L78 Accepts]: Start accepts. Automaton has 116542 states and 168137 transitions. Word has length 125 [2025-03-03 15:10:03,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:03,764 INFO L471 AbstractCegarLoop]: Abstraction has 116542 states and 168137 transitions. [2025-03-03 15:10:03,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:03,764 INFO L276 IsEmpty]: Start isEmpty. Operand 116542 states and 168137 transitions. [2025-03-03 15:10:03,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 15:10:03,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:03,861 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:10:03,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:10:03,861 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:10:03,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:03,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1230333505, now seen corresponding path program 1 times [2025-03-03 15:10:03,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:03,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117463166] [2025-03-03 15:10:03,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:03,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:03,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 15:10:03,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 15:10:03,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:03,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:03,922 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-03 15:10:03,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:03,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117463166] [2025-03-03 15:10:03,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117463166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:03,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:03,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:10:03,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701832844] [2025-03-03 15:10:03,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:03,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:10:03,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:03,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:10:03,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:10:03,923 INFO L87 Difference]: Start difference. First operand 116542 states and 168137 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:05,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:05,364 INFO L93 Difference]: Finished difference Result 325225 states and 466898 transitions. [2025-03-03 15:10:05,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:10:05,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2025-03-03 15:10:05,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:05,723 INFO L225 Difference]: With dead ends: 325225 [2025-03-03 15:10:05,723 INFO L226 Difference]: Without dead ends: 230875 [2025-03-03 15:10:05,798 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-03 15:10:05,799 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 248 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:05,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 615 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:10:05,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230875 states. [2025-03-03 15:10:08,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230875 to 230873. [2025-03-03 15:10:08,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230873 states, 230872 states have (on average 1.430255726116636) internal successors, (330206), 230872 states have internal predecessors, (330206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:09,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230873 states to 230873 states and 330206 transitions. [2025-03-03 15:10:09,209 INFO L78 Accepts]: Start accepts. Automaton has 230873 states and 330206 transitions. Word has length 127 [2025-03-03 15:10:09,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:09,209 INFO L471 AbstractCegarLoop]: Abstraction has 230873 states and 330206 transitions. [2025-03-03 15:10:09,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:09,210 INFO L276 IsEmpty]: Start isEmpty. Operand 230873 states and 330206 transitions. [2025-03-03 15:10:09,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 15:10:09,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:09,422 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:10:09,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:10:09,422 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:10:09,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:09,422 INFO L85 PathProgramCache]: Analyzing trace with hash -746788640, now seen corresponding path program 1 times [2025-03-03 15:10:09,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:09,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840669142] [2025-03-03 15:10:09,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:09,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:09,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 15:10:09,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 15:10:09,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:09,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:09,542 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-03 15:10:09,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:09,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840669142] [2025-03-03 15:10:09,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840669142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:09,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:09,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:10:09,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119612667] [2025-03-03 15:10:09,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:09,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:10:09,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:09,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:10:09,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:10:09,544 INFO L87 Difference]: Start difference. First operand 230873 states and 330206 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:11,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:11,533 INFO L93 Difference]: Finished difference Result 551544 states and 789346 transitions. [2025-03-03 15:10:11,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:10:11,533 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2025-03-03 15:10:11,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:11,984 INFO L225 Difference]: With dead ends: 551544 [2025-03-03 15:10:11,984 INFO L226 Difference]: Without dead ends: 328569 [2025-03-03 15:10:12,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:10:12,124 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 1556 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1556 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:12,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1556 Valid, 398 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:10:12,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328569 states. [2025-03-03 15:10:15,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328569 to 324741. [2025-03-03 15:10:16,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324741 states, 324740 states have (on average 1.4294450945371682) internal successors, (464198), 324740 states have internal predecessors, (464198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:16,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324741 states to 324741 states and 464198 transitions. [2025-03-03 15:10:16,962 INFO L78 Accepts]: Start accepts. Automaton has 324741 states and 464198 transitions. Word has length 127 [2025-03-03 15:10:16,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:16,962 INFO L471 AbstractCegarLoop]: Abstraction has 324741 states and 464198 transitions. [2025-03-03 15:10:16,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:16,963 INFO L276 IsEmpty]: Start isEmpty. Operand 324741 states and 464198 transitions. [2025-03-03 15:10:17,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 15:10:17,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:17,083 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:10:17,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:10:17,083 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:10:17,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:17,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1656333790, now seen corresponding path program 1 times [2025-03-03 15:10:17,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:17,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372574600] [2025-03-03 15:10:17,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:17,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:17,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 15:10:17,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 15:10:17,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:17,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:17,190 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-03 15:10:17,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:17,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372574600] [2025-03-03 15:10:17,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372574600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:17,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:17,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:10:17,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827339167] [2025-03-03 15:10:17,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:17,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:10:17,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:17,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:10:17,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:10:17,192 INFO L87 Difference]: Start difference. First operand 324741 states and 464198 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:18,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:18,755 INFO L93 Difference]: Finished difference Result 615941 states and 881488 transitions. [2025-03-03 15:10:18,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:10:18,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2025-03-03 15:10:18,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:19,581 INFO L225 Difference]: With dead ends: 615941 [2025-03-03 15:10:19,581 INFO L226 Difference]: Without dead ends: 309422 [2025-03-03 15:10:19,696 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-03 15:10:19,696 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 201 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:19,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 745 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:10:19,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309422 states. [2025-03-03 15:10:22,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309422 to 309406. [2025-03-03 15:10:23,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309406 states, 309405 states have (on average 1.420180669349235) internal successors, (439411), 309405 states have internal predecessors, (439411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:23,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309406 states to 309406 states and 439411 transitions. [2025-03-03 15:10:23,967 INFO L78 Accepts]: Start accepts. Automaton has 309406 states and 439411 transitions. Word has length 127 [2025-03-03 15:10:23,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:23,967 INFO L471 AbstractCegarLoop]: Abstraction has 309406 states and 439411 transitions. [2025-03-03 15:10:23,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:23,967 INFO L276 IsEmpty]: Start isEmpty. Operand 309406 states and 439411 transitions. [2025-03-03 15:10:24,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 15:10:24,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:24,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] [2025-03-03 15:10:24,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:10:24,040 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:10:24,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:24,041 INFO L85 PathProgramCache]: Analyzing trace with hash 334994502, now seen corresponding path program 1 times [2025-03-03 15:10:24,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:24,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553239559] [2025-03-03 15:10:24,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:24,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:24,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 15:10:24,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 15:10:24,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:24,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:24,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:10:24,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:24,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553239559] [2025-03-03 15:10:24,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553239559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:24,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:24,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:10:24,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026925338] [2025-03-03 15:10:24,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:24,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:10:24,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:24,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:10:24,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:10:24,160 INFO L87 Difference]: Start difference. First operand 309406 states and 439411 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:25,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:25,857 INFO L93 Difference]: Finished difference Result 455022 states and 646381 transitions. [2025-03-03 15:10:25,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:10:25,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2025-03-03 15:10:25,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:26,052 INFO L225 Difference]: With dead ends: 455022 [2025-03-03 15:10:26,053 INFO L226 Difference]: Without dead ends: 155726 [2025-03-03 15:10:26,135 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-03 15:10:26,137 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 187 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:26,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 727 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:10:26,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155726 states. [2025-03-03 15:10:27,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155726 to 155710. [2025-03-03 15:10:27,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155710 states, 155709 states have (on average 1.408839566113712) internal successors, (219369), 155709 states have internal predecessors, (219369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:28,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155710 states to 155710 states and 219369 transitions. [2025-03-03 15:10:28,178 INFO L78 Accepts]: Start accepts. Automaton has 155710 states and 219369 transitions. Word has length 127 [2025-03-03 15:10:28,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:28,178 INFO L471 AbstractCegarLoop]: Abstraction has 155710 states and 219369 transitions. [2025-03-03 15:10:28,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:28,178 INFO L276 IsEmpty]: Start isEmpty. Operand 155710 states and 219369 transitions. [2025-03-03 15:10:28,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 15:10:28,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:28,212 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:10:28,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:10:28,212 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:10:28,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:28,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1088177514, now seen corresponding path program 1 times [2025-03-03 15:10:28,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:28,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744248055] [2025-03-03 15:10:28,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:28,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:28,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 15:10:28,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 15:10:28,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:28,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:28,297 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-03 15:10:28,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:28,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744248055] [2025-03-03 15:10:28,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744248055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:28,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:28,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:10:28,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281510418] [2025-03-03 15:10:28,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:28,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:10:28,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:28,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:10:28,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:10:28,299 INFO L87 Difference]: Start difference. First operand 155710 states and 219369 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:28,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:28,792 INFO L93 Difference]: Finished difference Result 228534 states and 322027 transitions. [2025-03-03 15:10:28,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:10:28,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2025-03-03 15:10:28,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:29,305 INFO L225 Difference]: With dead ends: 228534 [2025-03-03 15:10:29,305 INFO L226 Difference]: Without dead ends: 78966 [2025-03-03 15:10:29,340 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-03 15:10:29,340 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 162 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:29,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 690 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:10:29,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78966 states.