./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.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.5.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 31d5f3a14d915ecc08c5dc9b9c0c33fc37690ec404e8b1546bed720bc4205a6b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:14:16,422 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:14:16,475 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:14:16,482 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:14:16,482 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:14:16,495 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:14:16,496 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:14:16,496 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:14:16,496 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:14:16,496 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:14:16,497 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:14:16,497 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:14:16,497 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:14:16,498 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:14:16,498 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:14:16,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:14:16,498 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:14:16,498 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:14:16,498 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:14:16,499 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:14:16,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:14:16,499 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:14:16,499 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:14:16,499 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:14:16,499 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:14:16,499 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:14:16,499 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:14:16,499 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:14:16,499 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:14:16,499 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:14:16,499 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:14:16,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:14:16,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:14:16,500 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:14:16,500 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:14:16,500 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:14:16,500 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:14:16,500 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:14:16,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:14:16,501 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:14:16,501 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:14:16,501 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:14:16,501 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:14:16,501 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 -> 31d5f3a14d915ecc08c5dc9b9c0c33fc37690ec404e8b1546bed720bc4205a6b [2025-03-03 15:14:16,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:14:16,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:14:16,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:14:16,734 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:14:16,735 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:14:16,735 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2025-03-03 15:14:17,894 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/398a10564/d47a272560124130abd12a84d52b5168/FLAG3f7ee146f [2025-03-03 15:14:18,133 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:14:18,141 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2025-03-03 15:14:18,151 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/398a10564/d47a272560124130abd12a84d52b5168/FLAG3f7ee146f [2025-03-03 15:14:18,469 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/398a10564/d47a272560124130abd12a84d52b5168 [2025-03-03 15:14:18,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:14:18,473 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:14:18,474 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:14:18,474 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:14:18,477 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:14:18,477 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:14:18" (1/1) ... [2025-03-03 15:14:18,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70260108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:18, skipping insertion in model container [2025-03-03 15:14:18,478 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:14:18" (1/1) ... [2025-03-03 15:14:18,511 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:14:18,754 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.5.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c[13904,13917] [2025-03-03 15:14:18,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:14:18,821 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:14:18,892 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.5.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c[13904,13917] [2025-03-03 15:14:18,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:14:18,934 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:14:18,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:18 WrapperNode [2025-03-03 15:14:18,935 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:14:18,936 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:14:18,936 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:14:18,936 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:14:18,940 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:14:18" (1/1) ... [2025-03-03 15:14:18,949 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:14:18" (1/1) ... [2025-03-03 15:14:18,981 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1275 [2025-03-03 15:14:18,982 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:14:18,982 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:14:18,982 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:14:18,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:14:18,989 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:18" (1/1) ... [2025-03-03 15:14:18,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:18" (1/1) ... [2025-03-03 15:14:18,992 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:18" (1/1) ... [2025-03-03 15:14:19,012 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:14:19,012 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:18" (1/1) ... [2025-03-03 15:14:19,012 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:18" (1/1) ... [2025-03-03 15:14:19,030 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:18" (1/1) ... [2025-03-03 15:14:19,034 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:18" (1/1) ... [2025-03-03 15:14:19,036 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:18" (1/1) ... [2025-03-03 15:14:19,043 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:18" (1/1) ... [2025-03-03 15:14:19,049 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:14:19,051 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:14:19,051 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:14:19,051 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:14:19,055 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:18" (1/1) ... [2025-03-03 15:14:19,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:14:19,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:14:19,081 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:14:19,084 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:14:19,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:14:19,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:14:19,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:14:19,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:14:19,185 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:14:19,186 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:14:19,953 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L366: havoc main_~node3__m3~1#1; [2025-03-03 15:14:19,953 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L730: havoc main_~node4__m4~4#1; [2025-03-03 15:14:19,953 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1655: havoc main_~node5____CPAchecker_TMP_0~3#1; [2025-03-03 15:14:19,953 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L598: havoc main_~node3__m3~3#1; [2025-03-03 15:14:19,953 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1523: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-03 15:14:19,954 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L235: havoc main_~node2__m2~0#1; [2025-03-03 15:14:19,954 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L467: havoc main_~node2__m2~2#1; [2025-03-03 15:14:19,954 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1922: havoc main_~node5____CPAchecker_TMP_0~4#1; [2025-03-03 15:14:19,954 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1790: havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-03-03 15:14:19,954 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L700: havoc main_~node2__m2~4#1; [2025-03-03 15:14:19,954 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L899: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-03 15:14:19,954 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2057: havoc main_~node2____CPAchecker_TMP_0~4#1; [2025-03-03 15:14:19,954 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1166: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-03 15:14:19,954 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1433: havoc main_~node4____CPAchecker_TMP_0~2#1; [2025-03-03 15:14:19,954 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1700: havoc main_~node4____CPAchecker_TMP_0~3#1; [2025-03-03 15:14:19,954 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L280: havoc main_~node5__m5~0#1; [2025-03-03 15:14:19,954 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1040: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-03 15:14:19,954 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L512: havoc main_~node5__m5~2#1; [2025-03-03 15:14:19,954 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L215: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:14:19,954 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L447: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-03 15:14:19,954 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L381: havoc main_~node4__m4~1#1; [2025-03-03 15:14:19,954 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1967: havoc main_~node4____CPAchecker_TMP_0~4#1; [2025-03-03 15:14:19,954 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L745: havoc main_~node5__m5~4#1; [2025-03-03 15:14:19,954 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L613: havoc main_~node4__m4~3#1; [2025-03-03 15:14:19,954 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1307: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-03 15:14:19,954 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L250: havoc main_~node3__m3~0#1; [2025-03-03 15:14:19,954 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L944: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:14:19,955 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L680: havoc main_~node1__m1~4#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-03-03 15:14:19,955 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L482: havoc main_~node3__m3~2#1; [2025-03-03 15:14:19,955 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L351: havoc main_~node2__m2~1#1; [2025-03-03 15:14:19,955 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L715: havoc main_~node3__m3~4#1; [2025-03-03 15:14:19,955 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L583: havoc main_~node2__m2~3#1; [2025-03-03 15:14:19,955 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1574: havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-03-03 15:14:19,955 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1211: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-03 15:14:19,955 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1841: havoc main_~node1____CPAchecker_TMP_0~3#1; [2025-03-03 15:14:19,955 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1478: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-03 15:14:19,955 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L785: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-03-03 15:14:19,955 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2108: havoc main_~node1____CPAchecker_TMP_0~4#1; [2025-03-03 15:14:19,955 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1745: havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-03-03 15:14:19,956 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L854: havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-03-03 15:14:19,956 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2012: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-03 15:14:19,956 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1121: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-03 15:14:19,956 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L989: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:14:19,956 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L396: havoc main_~node5__m5~1#1; [2025-03-03 15:14:19,956 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L628: havoc main_~node5__m5~3#1; [2025-03-03 15:14:19,956 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1388: havoc main_~node5____CPAchecker_TMP_0~2#1; [2025-03-03 15:14:19,956 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L331: havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-03 15:14:19,956 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L265: havoc main_~node4__m4~0#1; [2025-03-03 15:14:19,956 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1256: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-03 15:14:19,956 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L563: havoc main_~node1__m1~3#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-03 15:14:19,956 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L497: havoc main_~node4__m4~2#1; [2025-03-03 15:14:19,994 INFO L? ?]: Removed 181 outVars from TransFormulas that were not future-live. [2025-03-03 15:14:19,995 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:14:20,006 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:14:20,007 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:14:20,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:14:20 BoogieIcfgContainer [2025-03-03 15:14:20,007 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:14:20,009 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:14:20,009 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:14:20,012 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:14:20,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:14:18" (1/3) ... [2025-03-03 15:14:20,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124bc775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:14:20, skipping insertion in model container [2025-03-03 15:14:20,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:14:18" (2/3) ... [2025-03-03 15:14:20,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124bc775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:14:20, skipping insertion in model container [2025-03-03 15:14:20,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:14:20" (3/3) ... [2025-03-03 15:14:20,013 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2025-03-03 15:14:20,023 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:14:20,025 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c that has 1 procedures, 336 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 15:14:20,065 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:14:20,072 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;@45197a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:14:20,072 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:14:20,075 INFO L276 IsEmpty]: Start isEmpty. Operand has 336 states, 334 states have (on average 1.652694610778443) internal successors, (552), 335 states have internal predecessors, (552), 0 states have call successors, (0), 0 states 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:14:20,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 15:14:20,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:20,084 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:14:20,085 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:20,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:20,088 INFO L85 PathProgramCache]: Analyzing trace with hash -939762432, now seen corresponding path program 1 times [2025-03-03 15:14:20,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:20,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453669943] [2025-03-03 15:14:20,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:20,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:20,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 15:14:20,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 15:14:20,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:20,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:20,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:14:20,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:20,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453669943] [2025-03-03 15:14:20,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453669943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:20,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:20,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:14:20,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308303179] [2025-03-03 15:14:20,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:20,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:14:20,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:20,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:14:20,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:14:20,553 INFO L87 Difference]: Start difference. First operand has 336 states, 334 states have (on average 1.652694610778443) internal successors, (552), 335 states have internal predecessors, (552), 0 states have call successors, (0), 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 31.75) 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:14:20,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:20,664 INFO L93 Difference]: Finished difference Result 639 states and 1040 transitions. [2025-03-03 15:14:20,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:14:20,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) 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:14:20,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:20,677 INFO L225 Difference]: With dead ends: 639 [2025-03-03 15:14:20,677 INFO L226 Difference]: Without dead ends: 333 [2025-03-03 15:14:20,680 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:14:20,682 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 0 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1610 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:20,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1610 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:14:20,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-03 15:14:20,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2025-03-03 15:14:20,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 1.5451807228915662) internal successors, (513), 332 states have internal predecessors, (513), 0 states have call successors, (0), 0 states 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:14:20,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 513 transitions. [2025-03-03 15:14:20,744 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 513 transitions. Word has length 127 [2025-03-03 15:14:20,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:20,744 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 513 transitions. [2025-03-03 15:14:20,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) 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:14:20,745 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 513 transitions. [2025-03-03 15:14:20,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 15:14:20,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:20,750 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:20,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:14:20,750 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:20,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:20,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1518562126, now seen corresponding path program 1 times [2025-03-03 15:14:20,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:20,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478765983] [2025-03-03 15:14:20,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:20,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:20,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 15:14:20,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 15:14:20,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:20,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:20,928 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:14:20,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:20,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478765983] [2025-03-03 15:14:20,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478765983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:20,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:20,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:14:20,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191491630] [2025-03-03 15:14:20,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:20,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:14:20,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:20,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:14:20,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:14:20,932 INFO L87 Difference]: Start difference. First operand 333 states and 513 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states 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:14:20,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:20,983 INFO L93 Difference]: Finished difference Result 804 states and 1267 transitions. [2025-03-03 15:14:20,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:14:20,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 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 157 [2025-03-03 15:14:20,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:20,986 INFO L225 Difference]: With dead ends: 804 [2025-03-03 15:14:20,988 INFO L226 Difference]: Without dead ends: 523 [2025-03-03 15:14:20,989 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:14:20,991 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 346 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:20,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 998 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:14:20,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-03-03 15:14:21,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 521. [2025-03-03 15:14:21,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 520 states have (on average 1.5596153846153846) internal successors, (811), 520 states have internal predecessors, (811), 0 states have call successors, (0), 0 states 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:14:21,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 811 transitions. [2025-03-03 15:14:21,007 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 811 transitions. Word has length 157 [2025-03-03 15:14:21,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:21,008 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 811 transitions. [2025-03-03 15:14:21,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states 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:14:21,008 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 811 transitions. [2025-03-03 15:14:21,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 15:14:21,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:21,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:21,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:14:21,011 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:21,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:21,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1418131555, now seen corresponding path program 1 times [2025-03-03 15:14:21,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:21,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084860843] [2025-03-03 15:14:21,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:21,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:21,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 15:14:21,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 15:14:21,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:21,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:21,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:14:21,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:21,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084860843] [2025-03-03 15:14:21,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084860843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:21,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:21,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:14:21,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751938266] [2025-03-03 15:14:21,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:21,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:14:21,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:21,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:14:21,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:14:21,150 INFO L87 Difference]: Start difference. First operand 521 states and 811 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:21,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:21,201 INFO L93 Difference]: Finished difference Result 1322 states and 2090 transitions. [2025-03-03 15:14:21,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:14:21,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2025-03-03 15:14:21,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:21,206 INFO L225 Difference]: With dead ends: 1322 [2025-03-03 15:14:21,206 INFO L226 Difference]: Without dead ends: 859 [2025-03-03 15:14:21,207 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:14:21,208 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 334 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:21,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 897 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:14:21,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2025-03-03 15:14:21,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 857. [2025-03-03 15:14:21,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 856 states have (on average 1.566588785046729) internal successors, (1341), 856 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states 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:14:21,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1341 transitions. [2025-03-03 15:14:21,246 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1341 transitions. Word has length 160 [2025-03-03 15:14:21,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:21,247 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1341 transitions. [2025-03-03 15:14:21,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:21,248 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1341 transitions. [2025-03-03 15:14:21,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 15:14:21,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:21,251 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:21,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:14:21,252 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:21,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:21,253 INFO L85 PathProgramCache]: Analyzing trace with hash -129036526, now seen corresponding path program 1 times [2025-03-03 15:14:21,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:21,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224437147] [2025-03-03 15:14:21,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:21,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:21,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 15:14:21,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 15:14:21,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:21,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:21,359 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:14:21,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:21,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224437147] [2025-03-03 15:14:21,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224437147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:21,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:21,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:14:21,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473941219] [2025-03-03 15:14:21,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:21,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:14:21,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:21,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:14:21,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:14:21,361 INFO L87 Difference]: Start difference. First operand 857 states and 1341 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:14:21,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:21,407 INFO L93 Difference]: Finished difference Result 2240 states and 3538 transitions. [2025-03-03 15:14:21,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:14:21,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2025-03-03 15:14:21,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:21,412 INFO L225 Difference]: With dead ends: 2240 [2025-03-03 15:14:21,412 INFO L226 Difference]: Without dead ends: 1447 [2025-03-03 15:14:21,413 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:14:21,414 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 321 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:21,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 877 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:14:21,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2025-03-03 15:14:21,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1445. [2025-03-03 15:14:21,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.5657894736842106) internal successors, (2261), 1444 states have internal predecessors, (2261), 0 states have call successors, (0), 0 states 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:14:21,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 2261 transitions. [2025-03-03 15:14:21,471 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 2261 transitions. Word has length 163 [2025-03-03 15:14:21,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:21,471 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 2261 transitions. [2025-03-03 15:14:21,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:14:21,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 2261 transitions. [2025-03-03 15:14:21,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 15:14:21,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:21,474 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:21,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:14:21,474 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:21,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:21,475 INFO L85 PathProgramCache]: Analyzing trace with hash 673341527, now seen corresponding path program 1 times [2025-03-03 15:14:21,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:21,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110245610] [2025-03-03 15:14:21,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:21,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:21,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 15:14:21,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 15:14:21,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:21,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:21,582 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:14:21,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:21,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110245610] [2025-03-03 15:14:21,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110245610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:21,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:21,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:14:21,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775353135] [2025-03-03 15:14:21,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:21,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:14:21,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:21,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:14:21,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:14:21,586 INFO L87 Difference]: Start difference. First operand 1445 states and 2261 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states 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:14:21,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:21,635 INFO L93 Difference]: Finished difference Result 3826 states and 6014 transitions. [2025-03-03 15:14:21,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:14:21,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2025-03-03 15:14:21,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:21,643 INFO L225 Difference]: With dead ends: 3826 [2025-03-03 15:14:21,643 INFO L226 Difference]: Without dead ends: 2451 [2025-03-03 15:14:21,645 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:14:21,646 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 308 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:21,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 857 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:14:21,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2451 states. [2025-03-03 15:14:21,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2451 to 2449. [2025-03-03 15:14:21,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2449 states, 2448 states have (on average 1.5575980392156863) internal successors, (3813), 2448 states have internal predecessors, (3813), 0 states have call successors, (0), 0 states 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:14:21,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2449 states to 2449 states and 3813 transitions. [2025-03-03 15:14:21,708 INFO L78 Accepts]: Start accepts. Automaton has 2449 states and 3813 transitions. Word has length 166 [2025-03-03 15:14:21,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:21,708 INFO L471 AbstractCegarLoop]: Abstraction has 2449 states and 3813 transitions. [2025-03-03 15:14:21,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states 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:14:21,708 INFO L276 IsEmpty]: Start isEmpty. Operand 2449 states and 3813 transitions. [2025-03-03 15:14:21,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 15:14:21,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:21,714 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:21,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:14:21,714 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:21,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:21,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1063257157, now seen corresponding path program 1 times [2025-03-03 15:14:21,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:21,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144741923] [2025-03-03 15:14:21,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:21,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:21,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 15:14:21,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 15:14:21,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:21,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:21,914 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:14:21,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:21,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144741923] [2025-03-03 15:14:21,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144741923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:21,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:21,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:14:21,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833751112] [2025-03-03 15:14:21,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:21,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:14:21,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:21,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:14:21,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:14:21,916 INFO L87 Difference]: Start difference. First operand 2449 states and 3813 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 0 states have call successors, (0), 0 states 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:14:22,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:22,698 INFO L93 Difference]: Finished difference Result 22976 states and 35818 transitions. [2025-03-03 15:14:22,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 15:14:22,698 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2025-03-03 15:14:22,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:22,765 INFO L225 Difference]: With dead ends: 22976 [2025-03-03 15:14:22,765 INFO L226 Difference]: Without dead ends: 20603 [2025-03-03 15:14:22,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:14:22,771 INFO L435 NwaCegarLoop]: 1854 mSDtfsCounter, 3002 mSDsluCounter, 7373 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3002 SdHoareTripleChecker+Valid, 9227 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:22,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3002 Valid, 9227 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:14:22,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20603 states. [2025-03-03 15:14:22,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20603 to 4851. [2025-03-03 15:14:23,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4851 states, 4850 states have (on average 1.534639175257732) internal successors, (7443), 4850 states have internal predecessors, (7443), 0 states have call successors, (0), 0 states 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:14:23,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4851 states to 4851 states and 7443 transitions. [2025-03-03 15:14:23,016 INFO L78 Accepts]: Start accepts. Automaton has 4851 states and 7443 transitions. Word has length 169 [2025-03-03 15:14:23,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:23,016 INFO L471 AbstractCegarLoop]: Abstraction has 4851 states and 7443 transitions. [2025-03-03 15:14:23,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 0 states have call successors, (0), 0 states 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:14:23,017 INFO L276 IsEmpty]: Start isEmpty. Operand 4851 states and 7443 transitions. [2025-03-03 15:14:23,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 15:14:23,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:23,025 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:23,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:14:23,025 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:23,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:23,026 INFO L85 PathProgramCache]: Analyzing trace with hash 653640737, now seen corresponding path program 1 times [2025-03-03 15:14:23,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:23,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651287689] [2025-03-03 15:14:23,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:23,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:23,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 15:14:23,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 15:14:23,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:23,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:23,120 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:14:23,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:23,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651287689] [2025-03-03 15:14:23,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651287689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:23,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:23,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:14:23,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324637503] [2025-03-03 15:14:23,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:23,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:14:23,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:23,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:14:23,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:14:23,121 INFO L87 Difference]: Start difference. First operand 4851 states and 7443 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:23,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:23,229 INFO L93 Difference]: Finished difference Result 13321 states and 20415 transitions. [2025-03-03 15:14:23,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:14:23,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2025-03-03 15:14:23,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:23,243 INFO L225 Difference]: With dead ends: 13321 [2025-03-03 15:14:23,243 INFO L226 Difference]: Without dead ends: 8510 [2025-03-03 15:14:23,248 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:14:23,249 INFO L435 NwaCegarLoop]: 778 mSDtfsCounter, 337 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:23,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 1172 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:14:23,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8510 states. [2025-03-03 15:14:23,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8510 to 8508. [2025-03-03 15:14:23,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8508 states, 8507 states have (on average 1.5183966145527212) internal successors, (12917), 8507 states have internal predecessors, (12917), 0 states have call successors, (0), 0 states 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:14:23,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8508 states to 8508 states and 12917 transitions. [2025-03-03 15:14:23,430 INFO L78 Accepts]: Start accepts. Automaton has 8508 states and 12917 transitions. Word has length 172 [2025-03-03 15:14:23,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:23,430 INFO L471 AbstractCegarLoop]: Abstraction has 8508 states and 12917 transitions. [2025-03-03 15:14:23,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:23,431 INFO L276 IsEmpty]: Start isEmpty. Operand 8508 states and 12917 transitions. [2025-03-03 15:14:23,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 15:14:23,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:23,447 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:23,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:14:23,447 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:23,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:23,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1117949120, now seen corresponding path program 1 times [2025-03-03 15:14:23,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:23,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428739905] [2025-03-03 15:14:23,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:23,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:23,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 15:14:23,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 15:14:23,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:23,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:23,615 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:14:23,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:23,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428739905] [2025-03-03 15:14:23,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428739905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:23,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:23,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:14:23,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199626795] [2025-03-03 15:14:23,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:23,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:14:23,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:23,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:14:23,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:14:23,617 INFO L87 Difference]: Start difference. First operand 8508 states and 12917 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:23,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:23,700 INFO L93 Difference]: Finished difference Result 20430 states and 30991 transitions. [2025-03-03 15:14:23,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:14:23,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 173 [2025-03-03 15:14:23,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:23,718 INFO L225 Difference]: With dead ends: 20430 [2025-03-03 15:14:23,718 INFO L226 Difference]: Without dead ends: 11990 [2025-03-03 15:14:23,727 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:14:23,728 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 352 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:23,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 791 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:14:23,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11990 states. [2025-03-03 15:14:23,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11990 to 11924. [2025-03-03 15:14:23,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11924 states, 11923 states have (on average 1.4929128575023065) internal successors, (17800), 11923 states have internal predecessors, (17800), 0 states have call successors, (0), 0 states 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:14:23,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11924 states to 11924 states and 17800 transitions. [2025-03-03 15:14:23,946 INFO L78 Accepts]: Start accepts. Automaton has 11924 states and 17800 transitions. Word has length 173 [2025-03-03 15:14:23,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:23,947 INFO L471 AbstractCegarLoop]: Abstraction has 11924 states and 17800 transitions. [2025-03-03 15:14:23,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:23,947 INFO L276 IsEmpty]: Start isEmpty. Operand 11924 states and 17800 transitions. [2025-03-03 15:14:23,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 15:14:23,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:23,965 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:23,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:14:23,965 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:23,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:23,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1118211879, now seen corresponding path program 1 times [2025-03-03 15:14:23,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:23,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028608973] [2025-03-03 15:14:23,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:23,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:23,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 15:14:23,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 15:14:23,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:23,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:24,271 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:14:24,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:24,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028608973] [2025-03-03 15:14:24,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028608973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:24,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:24,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:14:24,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535248920] [2025-03-03 15:14:24,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:24,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:14:24,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:24,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:14:24,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:14:24,273 INFO L87 Difference]: Start difference. First operand 11924 states and 17800 transitions. Second operand has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:24,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:24,595 INFO L93 Difference]: Finished difference Result 23781 states and 35521 transitions. [2025-03-03 15:14:24,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:14:24,596 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 173 [2025-03-03 15:14:24,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:24,613 INFO L225 Difference]: With dead ends: 23781 [2025-03-03 15:14:24,614 INFO L226 Difference]: Without dead ends: 11926 [2025-03-03 15:14:24,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:14:24,625 INFO L435 NwaCegarLoop]: 721 mSDtfsCounter, 754 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 2041 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:24,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 2041 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:14:24,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11926 states. [2025-03-03 15:14:24,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11926 to 11924. [2025-03-03 15:14:24,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11924 states, 11923 states have (on average 1.478067600436132) internal successors, (17623), 11923 states have internal predecessors, (17623), 0 states have call successors, (0), 0 states 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:14:24,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11924 states to 11924 states and 17623 transitions. [2025-03-03 15:14:24,828 INFO L78 Accepts]: Start accepts. Automaton has 11924 states and 17623 transitions. Word has length 173 [2025-03-03 15:14:24,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:24,829 INFO L471 AbstractCegarLoop]: Abstraction has 11924 states and 17623 transitions. [2025-03-03 15:14:24,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:24,829 INFO L276 IsEmpty]: Start isEmpty. Operand 11924 states and 17623 transitions. [2025-03-03 15:14:24,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 15:14:24,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:24,850 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:24,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:14:24,850 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:24,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:24,851 INFO L85 PathProgramCache]: Analyzing trace with hash 510534413, now seen corresponding path program 1 times [2025-03-03 15:14:24,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:24,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500338646] [2025-03-03 15:14:24,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:24,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:24,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 15:14:24,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 15:14:24,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:24,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:24,949 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:14:24,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:24,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500338646] [2025-03-03 15:14:24,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500338646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:24,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:24,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:14:24,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504337201] [2025-03-03 15:14:24,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:24,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:14:24,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:24,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:14:24,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:14:24,951 INFO L87 Difference]: Start difference. First operand 11924 states and 17623 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:25,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:25,291 INFO L93 Difference]: Finished difference Result 34295 states and 50678 transitions. [2025-03-03 15:14:25,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:14:25,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 174 [2025-03-03 15:14:25,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:25,391 INFO L225 Difference]: With dead ends: 34295 [2025-03-03 15:14:25,392 INFO L226 Difference]: Without dead ends: 23647 [2025-03-03 15:14:25,399 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:14:25,400 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 359 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:25,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 564 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:14:25,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23647 states. [2025-03-03 15:14:25,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23647 to 23645. [2025-03-03 15:14:25,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23645 states, 23644 states have (on average 1.4691253594992386) internal successors, (34736), 23644 states have internal predecessors, (34736), 0 states have call successors, (0), 0 states 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:14:25,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23645 states to 23645 states and 34736 transitions. [2025-03-03 15:14:25,660 INFO L78 Accepts]: Start accepts. Automaton has 23645 states and 34736 transitions. Word has length 174 [2025-03-03 15:14:25,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:25,661 INFO L471 AbstractCegarLoop]: Abstraction has 23645 states and 34736 transitions. [2025-03-03 15:14:25,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:25,662 INFO L276 IsEmpty]: Start isEmpty. Operand 23645 states and 34736 transitions. [2025-03-03 15:14:25,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 15:14:25,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:25,693 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:25,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:14:25,694 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:25,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:25,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1133003885, now seen corresponding path program 1 times [2025-03-03 15:14:25,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:25,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709000506] [2025-03-03 15:14:25,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:25,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:25,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 15:14:25,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 15:14:25,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:25,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:25,989 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:14:25,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:25,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709000506] [2025-03-03 15:14:25,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709000506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:25,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:25,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:14:25,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285672782] [2025-03-03 15:14:25,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:25,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:14:25,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:25,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:14:25,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:14:25,991 INFO L87 Difference]: Start difference. First operand 23645 states and 34736 transitions. Second operand has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:26,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:26,562 INFO L93 Difference]: Finished difference Result 120322 states and 176265 transitions. [2025-03-03 15:14:26,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:14:26,563 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 174 [2025-03-03 15:14:26,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:26,718 INFO L225 Difference]: With dead ends: 120322 [2025-03-03 15:14:26,718 INFO L226 Difference]: Without dead ends: 104124 [2025-03-03 15:14:26,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:14:26,741 INFO L435 NwaCegarLoop]: 1309 mSDtfsCounter, 2427 mSDsluCounter, 2214 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2427 SdHoareTripleChecker+Valid, 3523 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:26,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2427 Valid, 3523 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:14:26,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104124 states. [2025-03-03 15:14:27,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104124 to 44998. [2025-03-03 15:14:27,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44998 states, 44997 states have (on average 1.4597195368580127) internal successors, (65683), 44997 states have internal predecessors, (65683), 0 states have call successors, (0), 0 states 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:14:27,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44998 states to 44998 states and 65683 transitions. [2025-03-03 15:14:27,989 INFO L78 Accepts]: Start accepts. Automaton has 44998 states and 65683 transitions. Word has length 174 [2025-03-03 15:14:27,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:27,989 INFO L471 AbstractCegarLoop]: Abstraction has 44998 states and 65683 transitions. [2025-03-03 15:14:27,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:27,990 INFO L276 IsEmpty]: Start isEmpty. Operand 44998 states and 65683 transitions. [2025-03-03 15:14:28,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 15:14:28,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:28,037 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:28,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:14:28,038 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:28,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:28,038 INFO L85 PathProgramCache]: Analyzing trace with hash 140050609, now seen corresponding path program 1 times [2025-03-03 15:14:28,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:28,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076887169] [2025-03-03 15:14:28,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:28,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:28,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 15:14:28,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 15:14:28,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:28,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:28,248 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:14:28,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:28,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076887169] [2025-03-03 15:14:28,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076887169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:28,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:28,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:14:28,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407579837] [2025-03-03 15:14:28,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:28,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:14:28,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:28,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:14:28,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:14:28,250 INFO L87 Difference]: Start difference. First operand 44998 states and 65683 transitions. Second operand has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:28,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:28,786 INFO L93 Difference]: Finished difference Result 139038 states and 203345 transitions. [2025-03-03 15:14:28,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:14:28,786 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 174 [2025-03-03 15:14:28,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:28,986 INFO L225 Difference]: With dead ends: 139038 [2025-03-03 15:14:28,986 INFO L226 Difference]: Without dead ends: 123692 [2025-03-03 15:14:29,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:14:29,034 INFO L435 NwaCegarLoop]: 1112 mSDtfsCounter, 2623 mSDsluCounter, 2235 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2623 SdHoareTripleChecker+Valid, 3347 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:29,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2623 Valid, 3347 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:14:29,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123692 states. [2025-03-03 15:14:30,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123692 to 73098. [2025-03-03 15:14:30,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73098 states, 73097 states have (on average 1.4514549160704269) internal successors, (106097), 73097 states have internal predecessors, (106097), 0 states have call successors, (0), 0 states 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:14:30,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73098 states to 73098 states and 106097 transitions. [2025-03-03 15:14:30,265 INFO L78 Accepts]: Start accepts. Automaton has 73098 states and 106097 transitions. Word has length 174 [2025-03-03 15:14:30,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:30,265 INFO L471 AbstractCegarLoop]: Abstraction has 73098 states and 106097 transitions. [2025-03-03 15:14:30,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:30,266 INFO L276 IsEmpty]: Start isEmpty. Operand 73098 states and 106097 transitions. [2025-03-03 15:14:30,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 15:14:30,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:30,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:30,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:14:30,339 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:30,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:30,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1319610645, now seen corresponding path program 1 times [2025-03-03 15:14:30,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:30,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755287099] [2025-03-03 15:14:30,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:30,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:30,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 15:14:30,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 15:14:30,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:30,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:30,747 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:14:30,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:30,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755287099] [2025-03-03 15:14:30,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755287099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:30,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:30,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:14:30,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291339168] [2025-03-03 15:14:30,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:30,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:14:30,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:30,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:14:30,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:14:30,751 INFO L87 Difference]: Start difference. First operand 73098 states and 106097 transitions. Second operand has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:31,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:31,370 INFO L93 Difference]: Finished difference Result 156770 states and 228973 transitions. [2025-03-03 15:14:31,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:14:31,371 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 174 [2025-03-03 15:14:31,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:31,690 INFO L225 Difference]: With dead ends: 156770 [2025-03-03 15:14:31,690 INFO L226 Difference]: Without dead ends: 141136 [2025-03-03 15:14:31,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:14:31,720 INFO L435 NwaCegarLoop]: 1169 mSDtfsCounter, 2444 mSDsluCounter, 2352 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2444 SdHoareTripleChecker+Valid, 3521 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:31,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2444 Valid, 3521 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:14:31,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141136 states. [2025-03-03 15:14:32,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141136 to 92280. [2025-03-03 15:14:32,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92280 states, 92279 states have (on average 1.4507851190411687) internal successors, (133877), 92279 states have internal predecessors, (133877), 0 states have call successors, (0), 0 states 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:14:32,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92280 states to 92280 states and 133877 transitions. [2025-03-03 15:14:32,899 INFO L78 Accepts]: Start accepts. Automaton has 92280 states and 133877 transitions. Word has length 174 [2025-03-03 15:14:32,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:32,899 INFO L471 AbstractCegarLoop]: Abstraction has 92280 states and 133877 transitions. [2025-03-03 15:14:32,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:32,899 INFO L276 IsEmpty]: Start isEmpty. Operand 92280 states and 133877 transitions. [2025-03-03 15:14:32,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 15:14:32,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:32,972 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:32,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:14:32,972 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:32,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:32,972 INFO L85 PathProgramCache]: Analyzing trace with hash -2038551479, now seen corresponding path program 1 times [2025-03-03 15:14:32,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:32,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200084387] [2025-03-03 15:14:32,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:32,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:32,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 15:14:32,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 15:14:32,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:32,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:33,142 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:14:33,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:33,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200084387] [2025-03-03 15:14:33,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200084387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:33,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:33,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:14:33,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565672440] [2025-03-03 15:14:33,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:33,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:14:33,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:33,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:14:33,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:14:33,144 INFO L87 Difference]: Start difference. First operand 92280 states and 133877 transitions. Second operand has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:34,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:34,106 INFO L93 Difference]: Finished difference Result 175790 states and 256449 transitions. [2025-03-03 15:14:34,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:14:34,107 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 174 [2025-03-03 15:14:34,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:34,291 INFO L225 Difference]: With dead ends: 175790 [2025-03-03 15:14:34,291 INFO L226 Difference]: Without dead ends: 159892 [2025-03-03 15:14:34,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:14:34,331 INFO L435 NwaCegarLoop]: 1473 mSDtfsCounter, 2357 mSDsluCounter, 3967 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2357 SdHoareTripleChecker+Valid, 5440 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:34,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2357 Valid, 5440 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:14:34,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159892 states. [2025-03-03 15:14:36,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159892 to 111782. [2025-03-03 15:14:36,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111782 states, 111781 states have (on average 1.4502733022606704) internal successors, (162113), 111781 states have internal predecessors, (162113), 0 states have call successors, (0), 0 states 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:14:36,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111782 states to 111782 states and 162113 transitions. [2025-03-03 15:14:36,327 INFO L78 Accepts]: Start accepts. Automaton has 111782 states and 162113 transitions. Word has length 174 [2025-03-03 15:14:36,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:36,327 INFO L471 AbstractCegarLoop]: Abstraction has 111782 states and 162113 transitions. [2025-03-03 15:14:36,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:14:36,327 INFO L276 IsEmpty]: Start isEmpty. Operand 111782 states and 162113 transitions. [2025-03-03 15:14:36,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 15:14:36,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:36,423 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:36,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:14:36,423 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:36,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:36,423 INFO L85 PathProgramCache]: Analyzing trace with hash -387512865, now seen corresponding path program 1 times [2025-03-03 15:14:36,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:36,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499915137] [2025-03-03 15:14:36,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:36,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:36,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 15:14:36,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 15:14:36,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:36,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:36,754 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:14:36,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:36,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499915137] [2025-03-03 15:14:36,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499915137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:36,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:36,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:14:36,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389188469] [2025-03-03 15:14:36,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:36,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:14:36,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:36,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:14:36,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:14:36,755 INFO L87 Difference]: Start difference. First operand 111782 states and 162113 transitions. Second operand has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 0 states have call successors, (0), 0 states 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:14:37,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:37,388 INFO L93 Difference]: Finished difference Result 184895 states and 270046 transitions. [2025-03-03 15:14:37,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:14:37,389 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 0 states have call successors, (0), 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 175 [2025-03-03 15:14:37,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:37,812 INFO L225 Difference]: With dead ends: 184895 [2025-03-03 15:14:37,813 INFO L226 Difference]: Without dead ends: 173701 [2025-03-03 15:14:37,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:14:37,857 INFO L435 NwaCegarLoop]: 1423 mSDtfsCounter, 2516 mSDsluCounter, 3104 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2516 SdHoareTripleChecker+Valid, 4527 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:37,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2516 Valid, 4527 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:14:37,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173701 states. [2025-03-03 15:14:39,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173701 to 125591. [2025-03-03 15:14:39,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125591 states, 125590 states have (on average 1.4528386017995063) internal successors, (182462), 125590 states have internal predecessors, (182462), 0 states have call successors, (0), 0 states 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:14:39,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125591 states to 125591 states and 182462 transitions. [2025-03-03 15:14:39,995 INFO L78 Accepts]: Start accepts. Automaton has 125591 states and 182462 transitions. Word has length 175 [2025-03-03 15:14:39,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:39,996 INFO L471 AbstractCegarLoop]: Abstraction has 125591 states and 182462 transitions. [2025-03-03 15:14:39,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 0 states have call successors, (0), 0 states 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:14:39,996 INFO L276 IsEmpty]: Start isEmpty. Operand 125591 states and 182462 transitions. [2025-03-03 15:14:40,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 15:14:40,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:40,104 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:40,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:14:40,104 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:40,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:40,104 INFO L85 PathProgramCache]: Analyzing trace with hash -361258859, now seen corresponding path program 1 times [2025-03-03 15:14:40,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:40,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723923394] [2025-03-03 15:14:40,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:40,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:40,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 15:14:40,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 15:14:40,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:40,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:40,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:14:40,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:40,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723923394] [2025-03-03 15:14:40,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723923394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:40,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:40,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:14:40,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303122167] [2025-03-03 15:14:40,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:40,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:14:40,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:40,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:14:40,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:14:40,470 INFO L87 Difference]: Start difference. First operand 125591 states and 182462 transitions. Second operand has 5 states, 5 states have (on average 35.2) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states 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:14:41,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:41,038 INFO L93 Difference]: Finished difference Result 179483 states and 261079 transitions. [2025-03-03 15:14:41,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:14:41,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 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 176 [2025-03-03 15:14:41,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:41,104 INFO L225 Difference]: With dead ends: 179483 [2025-03-03 15:14:41,104 INFO L226 Difference]: Without dead ends: 63235 [2025-03-03 15:14:41,169 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:14:41,170 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 1297 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1297 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:41,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1297 Valid, 271 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:14:41,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63235 states. [2025-03-03 15:14:42,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63235 to 63235. [2025-03-03 15:14:42,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63235 states, 63234 states have (on average 1.4497264130056615) internal successors, (91672), 63234 states have internal predecessors, (91672), 0 states have call successors, (0), 0 states 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:14:42,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63235 states to 63235 states and 91672 transitions. [2025-03-03 15:14:42,174 INFO L78 Accepts]: Start accepts. Automaton has 63235 states and 91672 transitions. Word has length 176 [2025-03-03 15:14:42,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:42,174 INFO L471 AbstractCegarLoop]: Abstraction has 63235 states and 91672 transitions. [2025-03-03 15:14:42,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states 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:14:42,174 INFO L276 IsEmpty]: Start isEmpty. Operand 63235 states and 91672 transitions. [2025-03-03 15:14:42,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 15:14:42,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:42,223 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:42,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:14:42,223 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:42,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:42,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1949377364, now seen corresponding path program 1 times [2025-03-03 15:14:42,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:42,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993905760] [2025-03-03 15:14:42,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:42,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:42,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 15:14:42,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 15:14:42,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:42,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:42,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:14:42,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:42,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993905760] [2025-03-03 15:14:42,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993905760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:42,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:42,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:14:42,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169421074] [2025-03-03 15:14:42,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:42,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:14:42,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:42,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:14:42,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:14:42,321 INFO L87 Difference]: Start difference. First operand 63235 states and 91672 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states 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:14:42,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:42,469 INFO L93 Difference]: Finished difference Result 86567 states and 126250 transitions. [2025-03-03 15:14:42,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:14:42,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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 176 [2025-03-03 15:14:42,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:42,500 INFO L225 Difference]: With dead ends: 86567 [2025-03-03 15:14:42,500 INFO L226 Difference]: Without dead ends: 31891 [2025-03-03 15:14:42,529 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:14:42,530 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 195 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:42,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 709 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:14:42,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31891 states. [2025-03-03 15:14:42,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31891 to 31889. [2025-03-03 15:14:42,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31889 states, 31888 states have (on average 1.46534746613146) internal successors, (46727), 31888 states have internal predecessors, (46727), 0 states have call successors, (0), 0 states 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:14:43,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31889 states to 31889 states and 46727 transitions. [2025-03-03 15:14:43,008 INFO L78 Accepts]: Start accepts. Automaton has 31889 states and 46727 transitions. Word has length 176 [2025-03-03 15:14:43,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:43,008 INFO L471 AbstractCegarLoop]: Abstraction has 31889 states and 46727 transitions. [2025-03-03 15:14:43,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states 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:14:43,008 INFO L276 IsEmpty]: Start isEmpty. Operand 31889 states and 46727 transitions. [2025-03-03 15:14:43,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:14:43,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:43,025 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:43,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:14:43,026 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:43,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:43,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1238666414, now seen corresponding path program 1 times [2025-03-03 15:14:43,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:43,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297048740] [2025-03-03 15:14:43,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:43,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:43,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:14:43,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:14:43,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:43,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:43,117 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:14:43,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:43,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297048740] [2025-03-03 15:14:43,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297048740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:43,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:43,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:14:43,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549710649] [2025-03-03 15:14:43,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:43,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:14:43,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:43,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:14:43,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:14:43,118 INFO L87 Difference]: Start difference. First operand 31889 states and 46727 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:14:43,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:43,196 INFO L93 Difference]: Finished difference Result 45393 states and 66639 transitions. [2025-03-03 15:14:43,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:14:43,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 178 [2025-03-03 15:14:43,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:43,211 INFO L225 Difference]: With dead ends: 45393 [2025-03-03 15:14:43,212 INFO L226 Difference]: Without dead ends: 16316 [2025-03-03 15:14:43,227 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:14:43,227 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 189 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:43,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 674 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:14:43,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16316 states. [2025-03-03 15:14:43,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16316 to 16314. [2025-03-03 15:14:43,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16314 states, 16313 states have (on average 1.4546067553484952) internal successors, (23729), 16313 states have internal predecessors, (23729), 0 states have call successors, (0), 0 states 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:14:43,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16314 states to 16314 states and 23729 transitions. [2025-03-03 15:14:43,552 INFO L78 Accepts]: Start accepts. Automaton has 16314 states and 23729 transitions. Word has length 178 [2025-03-03 15:14:43,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:43,553 INFO L471 AbstractCegarLoop]: Abstraction has 16314 states and 23729 transitions. [2025-03-03 15:14:43,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:14:43,553 INFO L276 IsEmpty]: Start isEmpty. Operand 16314 states and 23729 transitions. [2025-03-03 15:14:43,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:14:43,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:43,565 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:43,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:14:43,565 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:43,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:43,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1865844951, now seen corresponding path program 1 times [2025-03-03 15:14:43,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:43,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561244670] [2025-03-03 15:14:43,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:43,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:43,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:14:43,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:14:43,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:43,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:43,693 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:14:43,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:43,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561244670] [2025-03-03 15:14:43,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561244670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:43,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:43,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:14:43,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657098950] [2025-03-03 15:14:43,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:43,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:14:43,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:43,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:14:43,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:14:43,696 INFO L87 Difference]: Start difference. First operand 16314 states and 23729 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:14:43,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:43,754 INFO L93 Difference]: Finished difference Result 22884 states and 33395 transitions. [2025-03-03 15:14:43,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:14:43,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 178 [2025-03-03 15:14:43,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:43,761 INFO L225 Difference]: With dead ends: 22884 [2025-03-03 15:14:43,761 INFO L226 Difference]: Without dead ends: 8384 [2025-03-03 15:14:43,770 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:14:43,770 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 177 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:43,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 629 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:14:43,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8384 states. [2025-03-03 15:14:43,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8384 to 8382. [2025-03-03 15:14:43,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8382 states, 8381 states have (on average 1.4408781768285408) internal successors, (12076), 8381 states have internal predecessors, (12076), 0 states have call successors, (0), 0 states 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:14:43,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8382 states to 8382 states and 12076 transitions. [2025-03-03 15:14:43,876 INFO L78 Accepts]: Start accepts. Automaton has 8382 states and 12076 transitions. Word has length 178 [2025-03-03 15:14:43,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:43,876 INFO L471 AbstractCegarLoop]: Abstraction has 8382 states and 12076 transitions. [2025-03-03 15:14:43,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:14:43,877 INFO L276 IsEmpty]: Start isEmpty. Operand 8382 states and 12076 transitions. [2025-03-03 15:14:43,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:14:43,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:43,883 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:43,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:14:43,884 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:43,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:43,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1902205009, now seen corresponding path program 1 times [2025-03-03 15:14:43,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:43,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088657125] [2025-03-03 15:14:43,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:43,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:43,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:14:43,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:14:43,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:43,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:43,979 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:14:43,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:43,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088657125] [2025-03-03 15:14:43,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088657125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:43,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:43,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:14:43,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345940704] [2025-03-03 15:14:43,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:43,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:14:43,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:43,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:14:43,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:14:43,981 INFO L87 Difference]: Start difference. First operand 8382 states and 12076 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:14:44,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:44,207 INFO L93 Difference]: Finished difference Result 23466 states and 33842 transitions. [2025-03-03 15:14:44,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:14:44,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 178 [2025-03-03 15:14:44,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:44,221 INFO L225 Difference]: With dead ends: 23466 [2025-03-03 15:14:44,222 INFO L226 Difference]: Without dead ends: 16610 [2025-03-03 15:14:44,229 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:14:44,230 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 211 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:44,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 490 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:14:44,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16610 states. [2025-03-03 15:14:44,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16610 to 16608. [2025-03-03 15:14:44,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16608 states, 16607 states have (on average 1.4327693141446378) internal successors, (23794), 16607 states have internal predecessors, (23794), 0 states have call successors, (0), 0 states 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:14:44,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16608 states to 16608 states and 23794 transitions. [2025-03-03 15:14:44,475 INFO L78 Accepts]: Start accepts. Automaton has 16608 states and 23794 transitions. Word has length 178 [2025-03-03 15:14:44,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:44,475 INFO L471 AbstractCegarLoop]: Abstraction has 16608 states and 23794 transitions. [2025-03-03 15:14:44,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:14:44,475 INFO L276 IsEmpty]: Start isEmpty. Operand 16608 states and 23794 transitions. [2025-03-03 15:14:44,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:14:44,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:44,484 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:44,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:14:44,484 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:44,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:44,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1562614990, now seen corresponding path program 1 times [2025-03-03 15:14:44,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:44,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666439968] [2025-03-03 15:14:44,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:44,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:44,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:14:44,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:14:44,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:44,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:44,575 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:14:44,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:44,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666439968] [2025-03-03 15:14:44,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666439968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:44,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:44,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:14:44,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059679534] [2025-03-03 15:14:44,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:44,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:14:44,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:44,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:14:44,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:14:44,576 INFO L87 Difference]: Start difference. First operand 16608 states and 23794 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:14:44,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:44,685 INFO L93 Difference]: Finished difference Result 22922 states and 32988 transitions. [2025-03-03 15:14:44,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:14:44,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 178 [2025-03-03 15:14:44,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:44,693 INFO L225 Difference]: With dead ends: 22922 [2025-03-03 15:14:44,693 INFO L226 Difference]: Without dead ends: 8643 [2025-03-03 15:14:44,700 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:14:44,701 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 165 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:44,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 584 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:14:44,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8643 states. [2025-03-03 15:14:44,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8643 to 8641. [2025-03-03 15:14:44,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8641 states, 8640 states have (on average 1.4181712962962962) internal successors, (12253), 8640 states have internal predecessors, (12253), 0 states have call successors, (0), 0 states 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:14:44,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8641 states to 8641 states and 12253 transitions. [2025-03-03 15:14:44,777 INFO L78 Accepts]: Start accepts. Automaton has 8641 states and 12253 transitions. Word has length 178 [2025-03-03 15:14:44,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:44,778 INFO L471 AbstractCegarLoop]: Abstraction has 8641 states and 12253 transitions. [2025-03-03 15:14:44,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:14:44,778 INFO L276 IsEmpty]: Start isEmpty. Operand 8641 states and 12253 transitions. [2025-03-03 15:14:44,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:14:44,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:44,783 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:44,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:14:44,783 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:44,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:44,783 INFO L85 PathProgramCache]: Analyzing trace with hash 124129975, now seen corresponding path program 1 times [2025-03-03 15:14:44,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:44,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991904863] [2025-03-03 15:14:44,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:44,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:44,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:14:44,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:14:44,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:44,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:44,868 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:14:44,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:44,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991904863] [2025-03-03 15:14:44,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991904863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:44,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:44,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:14:44,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658250324] [2025-03-03 15:14:44,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:44,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:14:44,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:44,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:14:44,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:14:44,870 INFO L87 Difference]: Start difference. First operand 8641 states and 12253 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:14:44,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:44,902 INFO L93 Difference]: Finished difference Result 12229 states and 17363 transitions. [2025-03-03 15:14:44,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:14:44,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 178 [2025-03-03 15:14:44,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:44,906 INFO L225 Difference]: With dead ends: 12229 [2025-03-03 15:14:44,906 INFO L226 Difference]: Without dead ends: 4458 [2025-03-03 15:14:44,910 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:14:44,911 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 136 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:44,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 540 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:14:44,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4458 states. [2025-03-03 15:14:44,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4458 to 4456. [2025-03-03 15:14:44,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4456 states, 4455 states have (on average 1.4033670033670034) internal successors, (6252), 4455 states have internal predecessors, (6252), 0 states have call successors, (0), 0 states 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:14:44,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4456 states to 4456 states and 6252 transitions. [2025-03-03 15:14:44,946 INFO L78 Accepts]: Start accepts. Automaton has 4456 states and 6252 transitions. Word has length 178 [2025-03-03 15:14:44,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:44,946 INFO L471 AbstractCegarLoop]: Abstraction has 4456 states and 6252 transitions. [2025-03-03 15:14:44,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:14:44,947 INFO L276 IsEmpty]: Start isEmpty. Operand 4456 states and 6252 transitions. [2025-03-03 15:14:44,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:14:44,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:44,949 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:44,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 15:14:44,949 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:44,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:44,950 INFO L85 PathProgramCache]: Analyzing trace with hash 904604228, now seen corresponding path program 1 times [2025-03-03 15:14:44,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:44,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55493547] [2025-03-03 15:14:44,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:44,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:44,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:14:44,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:14:44,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:44,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:45,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:14:45,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:45,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55493547] [2025-03-03 15:14:45,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55493547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:45,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:45,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:14:45,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492072253] [2025-03-03 15:14:45,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:45,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:14:45,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:45,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:14:45,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:14:45,254 INFO L87 Difference]: Start difference. First operand 4456 states and 6252 transitions. Second operand has 10 states, 10 states have (on average 17.8) internal successors, (178), 9 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:14:45,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:45,775 INFO L93 Difference]: Finished difference Result 12689 states and 17781 transitions. [2025-03-03 15:14:45,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:14:45,776 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.8) internal successors, (178), 9 states have internal predecessors, (178), 0 states have call successors, (0), 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 178 [2025-03-03 15:14:45,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:45,781 INFO L225 Difference]: With dead ends: 12689 [2025-03-03 15:14:45,781 INFO L226 Difference]: Without dead ends: 8765 [2025-03-03 15:14:45,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:14:45,784 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 1675 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1675 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:45,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1675 Valid, 1045 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:14:45,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8765 states. [2025-03-03 15:14:45,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8765 to 4615. [2025-03-03 15:14:45,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4615 states, 4614 states have (on average 1.3998699609882965) internal successors, (6459), 4614 states have internal predecessors, (6459), 0 states have call successors, (0), 0 states 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:14:45,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4615 states to 4615 states and 6459 transitions. [2025-03-03 15:14:45,831 INFO L78 Accepts]: Start accepts. Automaton has 4615 states and 6459 transitions. Word has length 178 [2025-03-03 15:14:45,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:45,832 INFO L471 AbstractCegarLoop]: Abstraction has 4615 states and 6459 transitions. [2025-03-03 15:14:45,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.8) internal successors, (178), 9 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:14:45,832 INFO L276 IsEmpty]: Start isEmpty. Operand 4615 states and 6459 transitions. [2025-03-03 15:14:45,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 15:14:45,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:45,834 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:45,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 15:14:45,834 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:45,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:45,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1814015612, now seen corresponding path program 1 times [2025-03-03 15:14:45,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:45,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992614120] [2025-03-03 15:14:45,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:45,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:45,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-03 15:14:45,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-03 15:14:45,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:45,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:46,259 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:14:46,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:46,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992614120] [2025-03-03 15:14:46,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992614120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:46,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:46,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:14:46,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671591271] [2025-03-03 15:14:46,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:46,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:14:46,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:46,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:14:46,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:14:46,261 INFO L87 Difference]: Start difference. First operand 4615 states and 6459 transitions. Second operand has 14 states, 14 states have (on average 12.714285714285714) internal successors, (178), 13 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:14:46,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:46,988 INFO L93 Difference]: Finished difference Result 12355 states and 17291 transitions. [2025-03-03 15:14:46,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:14:46,988 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 12.714285714285714) internal successors, (178), 13 states have internal predecessors, (178), 0 states have call successors, (0), 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 178 [2025-03-03 15:14:46,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:46,996 INFO L225 Difference]: With dead ends: 12355 [2025-03-03 15:14:46,996 INFO L226 Difference]: Without dead ends: 9948 [2025-03-03 15:14:46,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:14:46,999 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 1350 mSDsluCounter, 1735 mSDsCounter, 0 mSdLazyCounter, 1645 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1350 SdHoareTripleChecker+Valid, 1997 SdHoareTripleChecker+Invalid, 1655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:46,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1350 Valid, 1997 Invalid, 1655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1645 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:14:47,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9948 states. [2025-03-03 15:14:47,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9948 to 6338. [2025-03-03 15:14:47,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6338 states, 6337 states have (on average 1.391510178317816) internal successors, (8818), 6337 states have internal predecessors, (8818), 0 states have call successors, (0), 0 states 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:14:47,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6338 states to 6338 states and 8818 transitions. [2025-03-03 15:14:47,069 INFO L78 Accepts]: Start accepts. Automaton has 6338 states and 8818 transitions. Word has length 178 [2025-03-03 15:14:47,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:47,069 INFO L471 AbstractCegarLoop]: Abstraction has 6338 states and 8818 transitions. [2025-03-03 15:14:47,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.714285714285714) internal successors, (178), 13 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:14:47,069 INFO L276 IsEmpty]: Start isEmpty. Operand 6338 states and 8818 transitions. [2025-03-03 15:14:47,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 15:14:47,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:47,073 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:47,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 15:14:47,073 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:47,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:47,073 INFO L85 PathProgramCache]: Analyzing trace with hash -351942650, now seen corresponding path program 1 times [2025-03-03 15:14:47,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:47,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096021503] [2025-03-03 15:14:47,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:47,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:47,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 15:14:47,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 15:14:47,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:47,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:47,523 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:14:47,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:47,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096021503] [2025-03-03 15:14:47,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096021503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:47,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:47,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:14:47,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688485057] [2025-03-03 15:14:47,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:47,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:14:47,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:47,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:14:47,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:14:47,525 INFO L87 Difference]: Start difference. First operand 6338 states and 8818 transitions. Second operand has 14 states, 14 states have (on average 12.785714285714286) internal successors, (179), 13 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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:14:48,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:48,327 INFO L93 Difference]: Finished difference Result 14183 states and 19722 transitions. [2025-03-03 15:14:48,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 15:14:48,328 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 12.785714285714286) internal successors, (179), 13 states have internal predecessors, (179), 0 states have call successors, (0), 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 179 [2025-03-03 15:14:48,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:48,333 INFO L225 Difference]: With dead ends: 14183 [2025-03-03 15:14:48,333 INFO L226 Difference]: Without dead ends: 8384 [2025-03-03 15:14:48,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2025-03-03 15:14:48,337 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 1344 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 1611 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1344 SdHoareTripleChecker+Valid, 1730 SdHoareTripleChecker+Invalid, 1627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:48,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1344 Valid, 1730 Invalid, 1627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1611 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:14:48,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8384 states. [2025-03-03 15:14:48,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8384 to 6062. [2025-03-03 15:14:48,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6062 states, 6061 states have (on average 1.3867348622339548) internal successors, (8405), 6061 states have internal predecessors, (8405), 0 states have call successors, (0), 0 states 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:14:48,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6062 states to 6062 states and 8405 transitions. [2025-03-03 15:14:48,387 INFO L78 Accepts]: Start accepts. Automaton has 6062 states and 8405 transitions. Word has length 179 [2025-03-03 15:14:48,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:48,387 INFO L471 AbstractCegarLoop]: Abstraction has 6062 states and 8405 transitions. [2025-03-03 15:14:48,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.785714285714286) internal successors, (179), 13 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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:14:48,387 INFO L276 IsEmpty]: Start isEmpty. Operand 6062 states and 8405 transitions. [2025-03-03 15:14:48,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 15:14:48,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:48,391 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:48,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 15:14:48,391 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:48,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:48,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1950070682, now seen corresponding path program 1 times [2025-03-03 15:14:48,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:48,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519082849] [2025-03-03 15:14:48,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:48,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:48,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 15:14:48,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 15:14:48,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:48,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:48,743 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:14:48,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:48,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519082849] [2025-03-03 15:14:48,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519082849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:48,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:48,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:14:48,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158052566] [2025-03-03 15:14:48,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:48,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:14:48,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:48,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:14:48,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:14:48,745 INFO L87 Difference]: Start difference. First operand 6062 states and 8405 transitions. Second operand has 14 states, 14 states have (on average 12.785714285714286) internal successors, (179), 13 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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:14:49,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:49,427 INFO L93 Difference]: Finished difference Result 19764 states and 27273 transitions. [2025-03-03 15:14:49,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:14:49,428 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 12.785714285714286) internal successors, (179), 13 states have internal predecessors, (179), 0 states have call successors, (0), 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 179 [2025-03-03 15:14:49,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:49,439 INFO L225 Difference]: With dead ends: 19764 [2025-03-03 15:14:49,439 INFO L226 Difference]: Without dead ends: 13740 [2025-03-03 15:14:49,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:14:49,445 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 2082 mSDsluCounter, 1644 mSDsCounter, 0 mSdLazyCounter, 1603 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2082 SdHoareTripleChecker+Valid, 1919 SdHoareTripleChecker+Invalid, 1621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:49,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2082 Valid, 1919 Invalid, 1621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1603 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:14:49,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13740 states. [2025-03-03 15:14:49,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13740 to 13587. [2025-03-03 15:14:49,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13587 states, 13586 states have (on average 1.3682467245694097) internal successors, (18589), 13586 states have internal predecessors, (18589), 0 states have call successors, (0), 0 states 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:14:49,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13587 states to 13587 states and 18589 transitions. [2025-03-03 15:14:49,568 INFO L78 Accepts]: Start accepts. Automaton has 13587 states and 18589 transitions. Word has length 179 [2025-03-03 15:14:49,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:49,568 INFO L471 AbstractCegarLoop]: Abstraction has 13587 states and 18589 transitions. [2025-03-03 15:14:49,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.785714285714286) internal successors, (179), 13 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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:14:49,569 INFO L276 IsEmpty]: Start isEmpty. Operand 13587 states and 18589 transitions. [2025-03-03 15:14:49,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-03 15:14:49,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:49,576 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:49,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 15:14:49,577 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:49,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:49,577 INFO L85 PathProgramCache]: Analyzing trace with hash -2132735034, now seen corresponding path program 1 times [2025-03-03 15:14:49,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:49,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564940240] [2025-03-03 15:14:49,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:49,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:49,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-03 15:14:49,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-03 15:14:49,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:49,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:49,822 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:14:49,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:49,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564940240] [2025-03-03 15:14:49,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564940240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:49,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:49,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:14:49,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618949711] [2025-03-03 15:14:49,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:49,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:14:49,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:49,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:14:49,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:14:49,824 INFO L87 Difference]: Start difference. First operand 13587 states and 18589 transitions. Second operand has 10 states, 10 states have (on average 18.0) internal successors, (180), 9 states have internal predecessors, (180), 0 states have call successors, (0), 0 states 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:14:50,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:50,465 INFO L93 Difference]: Finished difference Result 45226 states and 61589 transitions. [2025-03-03 15:14:50,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:14:50,465 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 18.0) internal successors, (180), 9 states have internal predecessors, (180), 0 states have call successors, (0), 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 180 [2025-03-03 15:14:50,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:50,496 INFO L225 Difference]: With dead ends: 45226 [2025-03-03 15:14:50,496 INFO L226 Difference]: Without dead ends: 31683 [2025-03-03 15:14:50,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:14:50,513 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 1506 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1602 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:50,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1602 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:14:50,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31683 states. [2025-03-03 15:14:50,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31683 to 31328. [2025-03-03 15:14:50,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31328 states, 31327 states have (on average 1.3510390398059182) internal successors, (42324), 31327 states have internal predecessors, (42324), 0 states have call successors, (0), 0 states 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:14:51,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31328 states to 31328 states and 42324 transitions. [2025-03-03 15:14:51,010 INFO L78 Accepts]: Start accepts. Automaton has 31328 states and 42324 transitions. Word has length 180 [2025-03-03 15:14:51,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:51,010 INFO L471 AbstractCegarLoop]: Abstraction has 31328 states and 42324 transitions. [2025-03-03 15:14:51,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.0) internal successors, (180), 9 states have internal predecessors, (180), 0 states have call successors, (0), 0 states 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:14:51,010 INFO L276 IsEmpty]: Start isEmpty. Operand 31328 states and 42324 transitions. [2025-03-03 15:14:51,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-03 15:14:51,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:51,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:51,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 15:14:51,038 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:51,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:51,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1165342513, now seen corresponding path program 1 times [2025-03-03 15:14:51,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:51,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17372206] [2025-03-03 15:14:51,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:51,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:51,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 15:14:51,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 15:14:51,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:51,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:51,368 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:14:51,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:51,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17372206] [2025-03-03 15:14:51,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17372206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:51,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:51,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:14:51,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724621636] [2025-03-03 15:14:51,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:51,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:14:51,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:51,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:14:51,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:14:51,370 INFO L87 Difference]: Start difference. First operand 31328 states and 42324 transitions. Second operand has 10 states, 10 states have (on average 18.1) internal successors, (181), 9 states have internal predecessors, (181), 0 states have call successors, (0), 0 states 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:14:51,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:51,971 INFO L93 Difference]: Finished difference Result 59826 states and 81678 transitions. [2025-03-03 15:14:51,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:14:51,971 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 18.1) internal successors, (181), 9 states have internal predecessors, (181), 0 states have call successors, (0), 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 181 [2025-03-03 15:14:51,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:52,017 INFO L225 Difference]: With dead ends: 59826 [2025-03-03 15:14:52,017 INFO L226 Difference]: Without dead ends: 50828 [2025-03-03 15:14:52,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:14:52,035 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 1409 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1409 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:52,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1409 Valid, 1253 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:14:52,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50828 states. [2025-03-03 15:14:52,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50828 to 39368. [2025-03-03 15:14:52,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39368 states, 39367 states have (on average 1.3549419564609952) internal successors, (53340), 39367 states have internal predecessors, (53340), 0 states have call successors, (0), 0 states 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:14:52,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39368 states to 39368 states and 53340 transitions. [2025-03-03 15:14:52,577 INFO L78 Accepts]: Start accepts. Automaton has 39368 states and 53340 transitions. Word has length 181 [2025-03-03 15:14:52,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:52,577 INFO L471 AbstractCegarLoop]: Abstraction has 39368 states and 53340 transitions. [2025-03-03 15:14:52,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.1) internal successors, (181), 9 states have internal predecessors, (181), 0 states have call successors, (0), 0 states 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:14:52,577 INFO L276 IsEmpty]: Start isEmpty. Operand 39368 states and 53340 transitions. [2025-03-03 15:14:52,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-03 15:14:52,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:52,606 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:52,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 15:14:52,606 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:52,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:52,606 INFO L85 PathProgramCache]: Analyzing trace with hash 935182165, now seen corresponding path program 1 times [2025-03-03 15:14:52,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:52,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664112632] [2025-03-03 15:14:52,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:52,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:52,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-03 15:14:52,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-03 15:14:52,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:52,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:52,650 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:14:52,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:52,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664112632] [2025-03-03 15:14:52,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664112632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:52,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:52,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:14:52,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517203600] [2025-03-03 15:14:52,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:52,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:14:52,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:52,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:14:52,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:14:52,652 INFO L87 Difference]: Start difference. First operand 39368 states and 53340 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states 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:14:52,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:52,855 INFO L93 Difference]: Finished difference Result 76793 states and 104179 transitions. [2025-03-03 15:14:52,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:14:52,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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 182 [2025-03-03 15:14:52,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:52,890 INFO L225 Difference]: With dead ends: 76793 [2025-03-03 15:14:52,890 INFO L226 Difference]: Without dead ends: 37772 [2025-03-03 15:14:52,916 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:14:52,920 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 254 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:52,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 273 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:14:52,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37772 states. [2025-03-03 15:14:53,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37772 to 37772. [2025-03-03 15:14:53,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37772 states, 37771 states have (on average 1.3453178364353604) internal successors, (50814), 37771 states have internal predecessors, (50814), 0 states have call successors, (0), 0 states 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:14:53,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37772 states to 37772 states and 50814 transitions. [2025-03-03 15:14:53,285 INFO L78 Accepts]: Start accepts. Automaton has 37772 states and 50814 transitions. Word has length 182 [2025-03-03 15:14:53,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:53,285 INFO L471 AbstractCegarLoop]: Abstraction has 37772 states and 50814 transitions. [2025-03-03 15:14:53,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states 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:14:53,286 INFO L276 IsEmpty]: Start isEmpty. Operand 37772 states and 50814 transitions. [2025-03-03 15:14:53,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-03 15:14:53,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:53,320 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:53,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 15:14:53,320 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:53,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:53,321 INFO L85 PathProgramCache]: Analyzing trace with hash -637331129, now seen corresponding path program 1 times [2025-03-03 15:14:53,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:53,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608319500] [2025-03-03 15:14:53,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:53,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:53,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-03 15:14:53,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-03 15:14:53,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:53,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:53,923 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:14:53,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:53,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608319500] [2025-03-03 15:14:53,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608319500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:53,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:53,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 15:14:53,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926461659] [2025-03-03 15:14:53,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:53,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 15:14:53,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:53,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 15:14:53,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-03-03 15:14:53,924 INFO L87 Difference]: Start difference. First operand 37772 states and 50814 transitions. Second operand has 15 states, 15 states have (on average 12.133333333333333) internal successors, (182), 14 states have internal predecessors, (182), 0 states have call successors, (0), 0 states 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:14:55,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:55,613 INFO L93 Difference]: Finished difference Result 143126 states and 192762 transitions. [2025-03-03 15:14:55,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-03 15:14:55,613 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 12.133333333333333) internal successors, (182), 14 states have internal predecessors, (182), 0 states have call successors, (0), 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 182 [2025-03-03 15:14:55,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:55,723 INFO L225 Difference]: With dead ends: 143126 [2025-03-03 15:14:55,723 INFO L226 Difference]: Without dead ends: 105425 [2025-03-03 15:14:55,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=285, Invalid=1275, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 15:14:55,768 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 1665 mSDsluCounter, 3514 mSDsCounter, 0 mSdLazyCounter, 3106 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1665 SdHoareTripleChecker+Valid, 3906 SdHoareTripleChecker+Invalid, 3130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:55,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1665 Valid, 3906 Invalid, 3130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3106 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:14:55,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105425 states. [2025-03-03 15:14:56,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105425 to 68827. [2025-03-03 15:14:56,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68827 states, 68826 states have (on average 1.3361956237468398) internal successors, (91965), 68826 states have internal predecessors, (91965), 0 states have call successors, (0), 0 states 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:14:56,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68827 states to 68827 states and 91965 transitions. [2025-03-03 15:14:56,861 INFO L78 Accepts]: Start accepts. Automaton has 68827 states and 91965 transitions. Word has length 182 [2025-03-03 15:14:56,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:56,861 INFO L471 AbstractCegarLoop]: Abstraction has 68827 states and 91965 transitions. [2025-03-03 15:14:56,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 12.133333333333333) internal successors, (182), 14 states have internal predecessors, (182), 0 states have call successors, (0), 0 states 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:14:56,861 INFO L276 IsEmpty]: Start isEmpty. Operand 68827 states and 91965 transitions. [2025-03-03 15:14:56,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-03 15:14:56,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:56,910 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:56,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 15:14:56,910 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:56,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:56,911 INFO L85 PathProgramCache]: Analyzing trace with hash 629188554, now seen corresponding path program 1 times [2025-03-03 15:14:56,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:56,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010585803] [2025-03-03 15:14:56,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:56,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:56,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-03 15:14:56,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-03 15:14:56,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:56,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:14:57,114 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:14:57,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:14:57,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010585803] [2025-03-03 15:14:57,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010585803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:14:57,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:14:57,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:14:57,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536054204] [2025-03-03 15:14:57,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:14:57,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:14:57,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:14:57,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:14:57,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:14:57,116 INFO L87 Difference]: Start difference. First operand 68827 states and 91965 transitions. Second operand has 10 states, 10 states have (on average 18.2) internal successors, (182), 9 states have internal predecessors, (182), 0 states have call successors, (0), 0 states 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:14:57,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:14:57,689 INFO L93 Difference]: Finished difference Result 117698 states and 158020 transitions. [2025-03-03 15:14:57,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:14:57,689 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 18.2) internal successors, (182), 9 states have internal predecessors, (182), 0 states have call successors, (0), 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 182 [2025-03-03 15:14:57,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:14:57,759 INFO L225 Difference]: With dead ends: 117698 [2025-03-03 15:14:57,759 INFO L226 Difference]: Without dead ends: 77909 [2025-03-03 15:14:57,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:14:57,794 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 1200 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1200 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:14:57,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1200 Valid, 1387 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:14:57,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77909 states. [2025-03-03 15:14:58,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77909 to 68605. [2025-03-03 15:14:58,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68605 states, 68604 states have (on average 1.3357675937263134) internal successors, (91639), 68604 states have internal predecessors, (91639), 0 states have call successors, (0), 0 states 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:14:58,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68605 states to 68605 states and 91639 transitions. [2025-03-03 15:14:58,658 INFO L78 Accepts]: Start accepts. Automaton has 68605 states and 91639 transitions. Word has length 182 [2025-03-03 15:14:58,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:14:58,658 INFO L471 AbstractCegarLoop]: Abstraction has 68605 states and 91639 transitions. [2025-03-03 15:14:58,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.2) internal successors, (182), 9 states have internal predecessors, (182), 0 states have call successors, (0), 0 states 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:14:58,658 INFO L276 IsEmpty]: Start isEmpty. Operand 68605 states and 91639 transitions. [2025-03-03 15:14:58,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-03 15:14:58,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:14:58,721 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:14:58,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 15:14:58,721 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:14:58,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:14:58,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1963172327, now seen corresponding path program 1 times [2025-03-03 15:14:58,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:14:58,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703762802] [2025-03-03 15:14:58,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:14:58,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:14:58,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-03 15:14:58,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-03 15:14:58,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:14:58,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat