./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+nlh-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_floodmax.3.ufo.UNBOUNDED.pals.c.v+nlh-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 3f65c5712bd883a6886a8bc01d4e0133fd034d0de7d6cdf4a43830b50c44bd44 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:02:02,173 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:02:02,226 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:02:02,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:02:02,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:02:02,253 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:02:02,255 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:02:02,255 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:02:02,255 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:02:02,255 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:02:02,255 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:02:02,256 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:02:02,256 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:02:02,256 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:02:02,256 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:02:02,256 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:02:02,256 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:02:02,256 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:02:02,256 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:02:02,256 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:02:02,256 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:02:02,256 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:02:02,256 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:02:02,256 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:02:02,256 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:02:02,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:02:02,257 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:02:02,257 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:02:02,257 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:02:02,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:02:02,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:02:02,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:02:02,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:02:02,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:02:02,257 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:02:02,257 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:02:02,257 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:02:02,257 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:02:02,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:02:02,257 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:02:02,257 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:02:02,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:02:02,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:02:02,257 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 -> 3f65c5712bd883a6886a8bc01d4e0133fd034d0de7d6cdf4a43830b50c44bd44 [2025-03-03 15:02:02,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:02:02,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:02:02,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:02:02,491 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:02:02,492 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:02:02,492 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-03 15:02:03,547 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1680b551d/8ef00204e3c94d0188d9489c714fff6d/FLAG5af5342d1 [2025-03-03 15:02:03,783 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:02:03,783 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-03 15:02:03,794 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1680b551d/8ef00204e3c94d0188d9489c714fff6d/FLAG5af5342d1 [2025-03-03 15:02:04,114 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1680b551d/8ef00204e3c94d0188d9489c714fff6d [2025-03-03 15:02:04,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:02:04,117 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:02:04,118 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:02:04,118 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:02:04,125 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:02:04,125 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:02:04" (1/1) ... [2025-03-03 15:02:04,126 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ca44fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:04, skipping insertion in model container [2025-03-03 15:02:04,126 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:02:04" (1/1) ... [2025-03-03 15:02:04,159 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:02:04,399 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[14417,14430] [2025-03-03 15:02:04,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:02:04,465 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:02:04,546 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[14417,14430] [2025-03-03 15:02:04,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:02:04,580 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:02:04,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:04 WrapperNode [2025-03-03 15:02:04,581 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:02:04,582 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:02:04,582 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:02:04,582 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:02:04,586 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:02:04" (1/1) ... [2025-03-03 15:02:04,600 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:02:04" (1/1) ... [2025-03-03 15:02:04,632 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1244 [2025-03-03 15:02:04,632 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:02:04,633 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:02:04,633 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:02:04,633 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:02:04,642 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:04" (1/1) ... [2025-03-03 15:02:04,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:04" (1/1) ... [2025-03-03 15:02:04,646 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:04" (1/1) ... [2025-03-03 15:02:04,667 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:02:04,667 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:04" (1/1) ... [2025-03-03 15:02:04,667 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:04" (1/1) ... [2025-03-03 15:02:04,685 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:04" (1/1) ... [2025-03-03 15:02:04,691 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:04" (1/1) ... [2025-03-03 15:02:04,693 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:04" (1/1) ... [2025-03-03 15:02:04,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:04" (1/1) ... [2025-03-03 15:02:04,698 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:02:04,699 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:02:04,699 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:02:04,699 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:02:04,700 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:04" (1/1) ... [2025-03-03 15:02:04,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:02:04,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:02:04,725 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:02:04,726 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:02:04,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:02:04,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:02:04,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:02:04,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:02:04,830 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:02:04,831 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:02:05,720 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1132: havoc main_~node3____CPAchecker_TMP_1~2#1;havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-03 15:02:05,721 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L968: havoc main_~check__tmp~4#1; [2025-03-03 15:02:05,721 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1238: havoc main_~node2____CPAchecker_TMP_1~2#1;havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-03 15:02:05,721 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L848: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1;havoc main_~node3____CPAchecker_TMP_1~1#1;havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node2____CPAchecker_TMP_1~1#1;havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node1____CPAchecker_TMP_1~1#1;havoc main_~node1____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2025-03-03 15:02:05,721 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1344: havoc main_~node1____CPAchecker_TMP_1~2#1;havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-03-03 15:02:05,766 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-03-03 15:02:05,767 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:02:05,785 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:02:05,785 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:02:05,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:02:05 BoogieIcfgContainer [2025-03-03 15:02:05,787 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:02:05,788 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:02:05,788 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:02:05,792 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:02:05,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:02:04" (1/3) ... [2025-03-03 15:02:05,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aa9ac56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:02:05, skipping insertion in model container [2025-03-03 15:02:05,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:02:04" (2/3) ... [2025-03-03 15:02:05,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aa9ac56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:02:05, skipping insertion in model container [2025-03-03 15:02:05,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:02:05" (3/3) ... [2025-03-03 15:02:05,795 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-03 15:02:05,806 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:02:05,808 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 312 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 15:02:05,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:02:05,859 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;@2e351297, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:02:05,859 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:02:05,863 INFO L276 IsEmpty]: Start isEmpty. Operand has 312 states, 310 states have (on average 1.7806451612903227) internal successors, (552), 311 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:02:05,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 15:02:05,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:05,871 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] [2025-03-03 15:02:05,871 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:05,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:05,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1066727839, now seen corresponding path program 1 times [2025-03-03 15:02:05,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:05,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313234537] [2025-03-03 15:02:05,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:05,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:05,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 15:02:06,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 15:02:06,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:06,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:06,715 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:02:06,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:06,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313234537] [2025-03-03 15:02:06,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313234537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:06,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:06,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:02:06,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405601351] [2025-03-03 15:02:06,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:06,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:02:06,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:06,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:02:06,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:02:06,742 INFO L87 Difference]: Start difference. First operand has 312 states, 310 states have (on average 1.7806451612903227) internal successors, (552), 311 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 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states 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:02:06,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:06,899 INFO L93 Difference]: Finished difference Result 1176 states and 2091 transitions. [2025-03-03 15:02:06,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:02:06,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2025-03-03 15:02:06,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:06,916 INFO L225 Difference]: With dead ends: 1176 [2025-03-03 15:02:06,917 INFO L226 Difference]: Without dead ends: 882 [2025-03-03 15:02:06,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:02:06,923 INFO L435 NwaCegarLoop]: 944 mSDtfsCounter, 1089 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 1944 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:06,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1089 Valid, 1944 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:02:06,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2025-03-03 15:02:06,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 595. [2025-03-03 15:02:06,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 594 states have (on average 1.4545454545454546) internal successors, (864), 594 states have internal predecessors, (864), 0 states have call successors, (0), 0 states 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:02:06,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 864 transitions. [2025-03-03 15:02:06,988 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 864 transitions. Word has length 146 [2025-03-03 15:02:06,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:06,989 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 864 transitions. [2025-03-03 15:02:06,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states 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:02:06,989 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 864 transitions. [2025-03-03 15:02:06,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 15:02:06,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:06,993 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] [2025-03-03 15:02:06,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:02:06,995 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:06,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:06,996 INFO L85 PathProgramCache]: Analyzing trace with hash -164505949, now seen corresponding path program 1 times [2025-03-03 15:02:06,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:06,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690588668] [2025-03-03 15:02:06,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:06,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:07,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 15:02:07,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 15:02:07,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:07,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:07,113 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:02:07,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:07,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690588668] [2025-03-03 15:02:07,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690588668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:07,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:07,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:02:07,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851793963] [2025-03-03 15:02:07,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:07,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:02:07,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:07,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:02:07,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:02:07,117 INFO L87 Difference]: Start difference. First operand 595 states and 864 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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:02:07,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:07,134 INFO L93 Difference]: Finished difference Result 1164 states and 1684 transitions. [2025-03-03 15:02:07,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:02:07,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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 147 [2025-03-03 15:02:07,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:07,137 INFO L225 Difference]: With dead ends: 1164 [2025-03-03 15:02:07,137 INFO L226 Difference]: Without dead ends: 597 [2025-03-03 15:02:07,139 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:02:07,140 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 0 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:07,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 902 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:02:07,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-03-03 15:02:07,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2025-03-03 15:02:07,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 1.4530201342281879) internal successors, (866), 596 states have internal predecessors, (866), 0 states have call successors, (0), 0 states 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:02:07,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 866 transitions. [2025-03-03 15:02:07,160 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 866 transitions. Word has length 147 [2025-03-03 15:02:07,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:07,161 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 866 transitions. [2025-03-03 15:02:07,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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:02:07,161 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 866 transitions. [2025-03-03 15:02:07,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 15:02:07,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:07,163 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] [2025-03-03 15:02:07,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:02:07,164 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:07,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:07,165 INFO L85 PathProgramCache]: Analyzing trace with hash -2129470215, now seen corresponding path program 1 times [2025-03-03 15:02:07,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:07,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201448270] [2025-03-03 15:02:07,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:07,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:07,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 15:02:07,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 15:02:07,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:07,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:07,664 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:02:07,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:07,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201448270] [2025-03-03 15:02:07,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201448270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:07,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:07,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:02:07,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381150899] [2025-03-03 15:02:07,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:07,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:02:07,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:07,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:02:07,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:02:07,668 INFO L87 Difference]: Start difference. First operand 597 states and 866 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 states 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:02:07,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:07,694 INFO L93 Difference]: Finished difference Result 1184 states and 1717 transitions. [2025-03-03 15:02:07,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:02:07,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2025-03-03 15:02:07,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:07,697 INFO L225 Difference]: With dead ends: 1184 [2025-03-03 15:02:07,697 INFO L226 Difference]: Without dead ends: 595 [2025-03-03 15:02:07,698 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:02:07,700 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 24 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:07,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1436 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:02:07,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-03-03 15:02:07,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2025-03-03 15:02:07,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 594 states have (on average 1.4511784511784511) internal successors, (862), 594 states have internal predecessors, (862), 0 states have call successors, (0), 0 states 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:02:07,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 862 transitions. [2025-03-03 15:02:07,722 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 862 transitions. Word has length 148 [2025-03-03 15:02:07,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:07,723 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 862 transitions. [2025-03-03 15:02:07,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 states 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:02:07,723 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 862 transitions. [2025-03-03 15:02:07,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 15:02:07,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:07,724 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] [2025-03-03 15:02:07,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:02:07,725 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:07,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:07,726 INFO L85 PathProgramCache]: Analyzing trace with hash -986467042, now seen corresponding path program 1 times [2025-03-03 15:02:07,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:07,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918780319] [2025-03-03 15:02:07,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:07,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:07,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 15:02:07,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 15:02:07,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:07,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:07,835 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:02:07,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:07,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918780319] [2025-03-03 15:02:07,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918780319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:07,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:07,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:02:07,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126880603] [2025-03-03 15:02:07,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:07,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:02:07,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:07,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:02:07,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:02:07,839 INFO L87 Difference]: Start difference. First operand 595 states and 862 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states 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:02:07,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:07,884 INFO L93 Difference]: Finished difference Result 1302 states and 1897 transitions. [2025-03-03 15:02:07,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:02:07,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2025-03-03 15:02:07,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:07,887 INFO L225 Difference]: With dead ends: 1302 [2025-03-03 15:02:07,887 INFO L226 Difference]: Without dead ends: 881 [2025-03-03 15:02:07,888 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:02:07,890 INFO L435 NwaCegarLoop]: 767 mSDtfsCounter, 383 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:07,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1172 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:02:07,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-03-03 15:02:07,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 879. [2025-03-03 15:02:07,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 878 states have (on average 1.4328018223234624) internal successors, (1258), 878 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states 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:02:07,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1258 transitions. [2025-03-03 15:02:07,917 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1258 transitions. Word has length 148 [2025-03-03 15:02:07,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:07,918 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1258 transitions. [2025-03-03 15:02:07,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states 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:02:07,918 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1258 transitions. [2025-03-03 15:02:07,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-03 15:02:07,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:07,920 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] [2025-03-03 15:02:07,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:02:07,920 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:07,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:07,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1309989492, now seen corresponding path program 1 times [2025-03-03 15:02:07,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:07,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326662830] [2025-03-03 15:02:07,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:07,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:07,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-03 15:02:07,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-03 15:02:07,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:07,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:08,019 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:02:08,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:08,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326662830] [2025-03-03 15:02:08,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326662830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:08,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:08,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:02:08,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530459208] [2025-03-03 15:02:08,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:08,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:02:08,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:08,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:02:08,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:02:08,022 INFO L87 Difference]: Start difference. First operand 879 states and 1258 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states 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:02:08,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:08,205 INFO L93 Difference]: Finished difference Result 2213 states and 3212 transitions. [2025-03-03 15:02:08,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:02:08,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2025-03-03 15:02:08,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:08,210 INFO L225 Difference]: With dead ends: 2213 [2025-03-03 15:02:08,211 INFO L226 Difference]: Without dead ends: 1582 [2025-03-03 15:02:08,211 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:02:08,212 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 294 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:08,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 785 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:02:08,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2025-03-03 15:02:08,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1580. [2025-03-03 15:02:08,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1580 states, 1579 states have (on average 1.435085497150095) internal successors, (2266), 1579 states have internal predecessors, (2266), 0 states have call successors, (0), 0 states 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:02:08,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 2266 transitions. [2025-03-03 15:02:08,243 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 2266 transitions. Word has length 154 [2025-03-03 15:02:08,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:08,243 INFO L471 AbstractCegarLoop]: Abstraction has 1580 states and 2266 transitions. [2025-03-03 15:02:08,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states 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:02:08,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 2266 transitions. [2025-03-03 15:02:08,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-03 15:02:08,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:08,249 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] [2025-03-03 15:02:08,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:02:08,249 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:08,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:08,250 INFO L85 PathProgramCache]: Analyzing trace with hash 922796211, now seen corresponding path program 1 times [2025-03-03 15:02:08,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:08,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597430345] [2025-03-03 15:02:08,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:08,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:08,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-03 15:02:08,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-03 15:02:08,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:08,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:08,384 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:02:08,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:08,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597430345] [2025-03-03 15:02:08,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597430345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:08,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:08,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:02:08,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578771504] [2025-03-03 15:02:08,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:08,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:02:08,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:08,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:02:08,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:02:08,386 INFO L87 Difference]: Start difference. First operand 1580 states and 2266 transitions. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states 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:02:08,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:08,529 INFO L93 Difference]: Finished difference Result 2157 states and 3129 transitions. [2025-03-03 15:02:08,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:02:08,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2025-03-03 15:02:08,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:08,532 INFO L225 Difference]: With dead ends: 2157 [2025-03-03 15:02:08,532 INFO L226 Difference]: Without dead ends: 879 [2025-03-03 15:02:08,534 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:02:08,535 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 1182 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:08,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 434 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:02:08,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2025-03-03 15:02:08,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 879. [2025-03-03 15:02:08,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 878 states have (on average 1.4157175398633257) internal successors, (1243), 878 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states 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:02:08,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1243 transitions. [2025-03-03 15:02:08,551 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1243 transitions. Word has length 154 [2025-03-03 15:02:08,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:08,551 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1243 transitions. [2025-03-03 15:02:08,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states 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:02:08,551 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1243 transitions. [2025-03-03 15:02:08,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-03 15:02:08,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:08,553 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] [2025-03-03 15:02:08,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:02:08,553 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:08,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:08,554 INFO L85 PathProgramCache]: Analyzing trace with hash -492520139, now seen corresponding path program 1 times [2025-03-03 15:02:08,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:08,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597957679] [2025-03-03 15:02:08,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:08,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:08,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-03 15:02:08,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-03 15:02:08,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:08,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:09,113 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:02:09,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:09,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597957679] [2025-03-03 15:02:09,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597957679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:09,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:09,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:02:09,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119797957] [2025-03-03 15:02:09,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:09,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:02:09,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:09,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:02:09,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:02:09,116 INFO L87 Difference]: Start difference. First operand 879 states and 1243 transitions. Second operand has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 0 states have call successors, (0), 0 states 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:02:09,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:09,327 INFO L93 Difference]: Finished difference Result 1738 states and 2555 transitions. [2025-03-03 15:02:09,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:02:09,328 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2025-03-03 15:02:09,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:09,332 INFO L225 Difference]: With dead ends: 1738 [2025-03-03 15:02:09,332 INFO L226 Difference]: Without dead ends: 1434 [2025-03-03 15:02:09,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:02:09,334 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 2136 mSDsluCounter, 2041 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2136 SdHoareTripleChecker+Valid, 2452 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:09,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2136 Valid, 2452 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:02:09,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2025-03-03 15:02:09,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1432. [2025-03-03 15:02:09,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1431 states have (on average 1.437456324248777) internal successors, (2057), 1431 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states 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:02:09,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2057 transitions. [2025-03-03 15:02:09,357 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2057 transitions. Word has length 154 [2025-03-03 15:02:09,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:09,358 INFO L471 AbstractCegarLoop]: Abstraction has 1432 states and 2057 transitions. [2025-03-03 15:02:09,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 0 states have call successors, (0), 0 states 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:02:09,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2057 transitions. [2025-03-03 15:02:09,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-03 15:02:09,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:09,360 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] [2025-03-03 15:02:09,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:02:09,360 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:09,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:09,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1503637389, now seen corresponding path program 1 times [2025-03-03 15:02:09,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:09,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135381848] [2025-03-03 15:02:09,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:09,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:09,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-03 15:02:09,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-03 15:02:09,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:09,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:10,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:02:10,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:10,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135381848] [2025-03-03 15:02:10,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135381848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:10,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:10,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:02:10,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567685836] [2025-03-03 15:02:10,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:10,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:02:10,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:10,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:02:10,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:02:10,123 INFO L87 Difference]: Start difference. First operand 1432 states and 2057 transitions. Second operand has 13 states, 13 states have (on average 11.846153846153847) internal successors, (154), 13 states have internal predecessors, (154), 0 states have call successors, (0), 0 states 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:02:10,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:10,870 INFO L93 Difference]: Finished difference Result 2360 states and 3392 transitions. [2025-03-03 15:02:10,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 15:02:10,871 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 11.846153846153847) internal successors, (154), 13 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2025-03-03 15:02:10,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:10,877 INFO L225 Difference]: With dead ends: 2360 [2025-03-03 15:02:10,877 INFO L226 Difference]: Without dead ends: 2148 [2025-03-03 15:02:10,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2025-03-03 15:02:10,879 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 2792 mSDsluCounter, 3746 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2792 SdHoareTripleChecker+Valid, 4207 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:10,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2792 Valid, 4207 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:02:10,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2025-03-03 15:02:10,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 1699. [2025-03-03 15:02:10,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 1698 states have (on average 1.4169611307420495) internal successors, (2406), 1698 states have internal predecessors, (2406), 0 states have call successors, (0), 0 states 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:02:10,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2406 transitions. [2025-03-03 15:02:10,914 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2406 transitions. Word has length 154 [2025-03-03 15:02:10,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:10,914 INFO L471 AbstractCegarLoop]: Abstraction has 1699 states and 2406 transitions. [2025-03-03 15:02:10,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.846153846153847) internal successors, (154), 13 states have internal predecessors, (154), 0 states have call successors, (0), 0 states 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:02:10,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2406 transitions. [2025-03-03 15:02:10,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-03 15:02:10,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:10,917 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] [2025-03-03 15:02:10,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:02:10,917 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:10,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:10,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1202982005, now seen corresponding path program 1 times [2025-03-03 15:02:10,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:10,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133173000] [2025-03-03 15:02:10,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:10,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:10,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-03 15:02:10,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-03 15:02:10,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:10,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:11,133 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:02:11,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:11,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133173000] [2025-03-03 15:02:11,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133173000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:11,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:11,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:02:11,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115219404] [2025-03-03 15:02:11,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:11,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:02:11,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:11,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:02:11,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:02:11,135 INFO L87 Difference]: Start difference. First operand 1699 states and 2406 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states 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:02:11,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:11,191 INFO L93 Difference]: Finished difference Result 4415 states and 6236 transitions. [2025-03-03 15:02:11,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:02:11,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2025-03-03 15:02:11,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:11,199 INFO L225 Difference]: With dead ends: 4415 [2025-03-03 15:02:11,199 INFO L226 Difference]: Without dead ends: 2753 [2025-03-03 15:02:11,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:02:11,202 INFO L435 NwaCegarLoop]: 775 mSDtfsCounter, 385 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:11,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 1566 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:02:11,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2753 states. [2025-03-03 15:02:11,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2753 to 2751. [2025-03-03 15:02:11,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2751 states, 2750 states have (on average 1.3996363636363636) internal successors, (3849), 2750 states have internal predecessors, (3849), 0 states have call successors, (0), 0 states 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:02:11,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2751 states to 2751 states and 3849 transitions. [2025-03-03 15:02:11,256 INFO L78 Accepts]: Start accepts. Automaton has 2751 states and 3849 transitions. Word has length 154 [2025-03-03 15:02:11,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:11,256 INFO L471 AbstractCegarLoop]: Abstraction has 2751 states and 3849 transitions. [2025-03-03 15:02:11,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states 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:02:11,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2751 states and 3849 transitions. [2025-03-03 15:02:11,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-03 15:02:11,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:11,260 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] [2025-03-03 15:02:11,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:02:11,261 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:11,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:11,261 INFO L85 PathProgramCache]: Analyzing trace with hash 519401743, now seen corresponding path program 1 times [2025-03-03 15:02:11,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:11,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183782831] [2025-03-03 15:02:11,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:11,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:11,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 15:02:11,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 15:02:11,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:11,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:11,340 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:02:11,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:11,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183782831] [2025-03-03 15:02:11,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183782831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:11,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:11,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:02:11,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095173288] [2025-03-03 15:02:11,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:11,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:02:11,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:11,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:02:11,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:02:11,342 INFO L87 Difference]: Start difference. First operand 2751 states and 3849 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:11,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:11,379 INFO L93 Difference]: Finished difference Result 6019 states and 8402 transitions. [2025-03-03 15:02:11,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:02:11,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2025-03-03 15:02:11,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:11,391 INFO L225 Difference]: With dead ends: 6019 [2025-03-03 15:02:11,391 INFO L226 Difference]: Without dead ends: 3859 [2025-03-03 15:02:11,394 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:02:11,394 INFO L435 NwaCegarLoop]: 799 mSDtfsCounter, 419 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:11,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1239 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:02:11,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3859 states. [2025-03-03 15:02:11,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3859 to 2751. [2025-03-03 15:02:11,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2751 states, 2750 states have (on average 1.3992727272727272) internal successors, (3848), 2750 states have internal predecessors, (3848), 0 states have call successors, (0), 0 states 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:02:11,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2751 states to 2751 states and 3848 transitions. [2025-03-03 15:02:11,471 INFO L78 Accepts]: Start accepts. Automaton has 2751 states and 3848 transitions. Word has length 155 [2025-03-03 15:02:11,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:11,471 INFO L471 AbstractCegarLoop]: Abstraction has 2751 states and 3848 transitions. [2025-03-03 15:02:11,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:11,471 INFO L276 IsEmpty]: Start isEmpty. Operand 2751 states and 3848 transitions. [2025-03-03 15:02:11,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 15:02:11,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:11,476 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:11,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:02:11,476 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:11,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:11,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1881519218, now seen corresponding path program 1 times [2025-03-03 15:02:11,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:11,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666961601] [2025-03-03 15:02:11,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:11,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:11,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 15:02:11,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 15:02:11,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:11,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:11,555 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:02:11,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:11,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666961601] [2025-03-03 15:02:11,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666961601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:11,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:11,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:02:11,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189845512] [2025-03-03 15:02:11,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:11,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:02:11,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:11,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:02:11,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:02:11,556 INFO L87 Difference]: Start difference. First operand 2751 states and 3848 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states 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:02:11,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:11,613 INFO L93 Difference]: Finished difference Result 7623 states and 10672 transitions. [2025-03-03 15:02:11,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:02:11,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2025-03-03 15:02:11,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:11,628 INFO L225 Difference]: With dead ends: 7623 [2025-03-03 15:02:11,629 INFO L226 Difference]: Without dead ends: 5261 [2025-03-03 15:02:11,633 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:02:11,633 INFO L435 NwaCegarLoop]: 825 mSDtfsCounter, 371 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:11,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 1230 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:02:11,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5261 states. [2025-03-03 15:02:11,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5261 to 5259. [2025-03-03 15:02:11,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5259 states, 5258 states have (on average 1.3818942563712437) internal successors, (7266), 5258 states have internal predecessors, (7266), 0 states have call successors, (0), 0 states 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:02:11,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5259 states to 5259 states and 7266 transitions. [2025-03-03 15:02:11,751 INFO L78 Accepts]: Start accepts. Automaton has 5259 states and 7266 transitions. Word has length 156 [2025-03-03 15:02:11,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:11,751 INFO L471 AbstractCegarLoop]: Abstraction has 5259 states and 7266 transitions. [2025-03-03 15:02:11,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states 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:02:11,751 INFO L276 IsEmpty]: Start isEmpty. Operand 5259 states and 7266 transitions. [2025-03-03 15:02:11,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 15:02:11,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:11,757 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] [2025-03-03 15:02:11,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:02:11,758 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:11,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:11,758 INFO L85 PathProgramCache]: Analyzing trace with hash 958351792, now seen corresponding path program 1 times [2025-03-03 15:02:11,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:11,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824632650] [2025-03-03 15:02:11,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:11,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:11,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 15:02:11,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 15:02:11,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:11,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:11,981 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:02:11,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:11,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824632650] [2025-03-03 15:02:11,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824632650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:11,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:11,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:02:11,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760417068] [2025-03-03 15:02:11,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:11,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:02:11,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:11,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:02:11,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:02:11,983 INFO L87 Difference]: Start difference. First operand 5259 states and 7266 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states 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:02:12,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:12,110 INFO L93 Difference]: Finished difference Result 20129 states and 27646 transitions. [2025-03-03 15:02:12,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:02:12,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2025-03-03 15:02:12,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:12,145 INFO L225 Difference]: With dead ends: 20129 [2025-03-03 15:02:12,145 INFO L226 Difference]: Without dead ends: 14959 [2025-03-03 15:02:12,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:02:12,154 INFO L435 NwaCegarLoop]: 749 mSDtfsCounter, 824 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:12,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 1528 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:02:12,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14959 states. [2025-03-03 15:02:12,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14959 to 10116. [2025-03-03 15:02:12,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10116 states, 10115 states have (on average 1.3620365793376175) internal successors, (13777), 10115 states have internal predecessors, (13777), 0 states have call successors, (0), 0 states 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:02:12,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10116 states to 10116 states and 13777 transitions. [2025-03-03 15:02:12,376 INFO L78 Accepts]: Start accepts. Automaton has 10116 states and 13777 transitions. Word has length 156 [2025-03-03 15:02:12,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:12,376 INFO L471 AbstractCegarLoop]: Abstraction has 10116 states and 13777 transitions. [2025-03-03 15:02:12,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states 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:02:12,377 INFO L276 IsEmpty]: Start isEmpty. Operand 10116 states and 13777 transitions. [2025-03-03 15:02:12,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 15:02:12,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:12,388 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:02:12,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:02:12,388 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:12,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:12,389 INFO L85 PathProgramCache]: Analyzing trace with hash 131172236, now seen corresponding path program 1 times [2025-03-03 15:02:12,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:12,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67240302] [2025-03-03 15:02:12,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:12,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:12,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 15:02:12,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 15:02:12,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:12,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:12,441 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:02:12,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:12,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67240302] [2025-03-03 15:02:12,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67240302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:12,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:12,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:02:12,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883877177] [2025-03-03 15:02:12,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:12,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:02:12,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:12,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:02:12,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:02:12,443 INFO L87 Difference]: Start difference. First operand 10116 states and 13777 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:02:12,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:12,508 INFO L93 Difference]: Finished difference Result 20094 states and 27355 transitions. [2025-03-03 15:02:12,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:02:12,512 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:02:12,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:12,529 INFO L225 Difference]: With dead ends: 20094 [2025-03-03 15:02:12,529 INFO L226 Difference]: Without dead ends: 10128 [2025-03-03 15:02:12,539 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:02:12,540 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 0 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:12,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 886 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:02:12,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10128 states. [2025-03-03 15:02:12,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10128 to 10128. [2025-03-03 15:02:12,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10128 states, 10127 states have (on average 1.3616075836871728) internal successors, (13789), 10127 states have internal predecessors, (13789), 0 states have call successors, (0), 0 states 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:02:12,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10128 states to 10128 states and 13789 transitions. [2025-03-03 15:02:12,762 INFO L78 Accepts]: Start accepts. Automaton has 10128 states and 13789 transitions. Word has length 157 [2025-03-03 15:02:12,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:12,762 INFO L471 AbstractCegarLoop]: Abstraction has 10128 states and 13789 transitions. [2025-03-03 15:02:12,762 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:02:12,762 INFO L276 IsEmpty]: Start isEmpty. Operand 10128 states and 13789 transitions. [2025-03-03 15:02:12,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-03 15:02:12,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:12,773 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] [2025-03-03 15:02:12,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:02:12,774 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:12,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:12,774 INFO L85 PathProgramCache]: Analyzing trace with hash -998905976, now seen corresponding path program 1 times [2025-03-03 15:02:12,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:12,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135650250] [2025-03-03 15:02:12,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:12,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:12,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-03 15:02:12,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-03 15:02:12,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:12,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:13,039 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:02:13,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:13,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135650250] [2025-03-03 15:02:13,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135650250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:13,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:13,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:02:13,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467726648] [2025-03-03 15:02:13,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:13,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:02:13,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:13,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:02:13,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:02:13,041 INFO L87 Difference]: Start difference. First operand 10128 states and 13789 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states 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:02:13,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:13,108 INFO L93 Difference]: Finished difference Result 20189 states and 27475 transitions. [2025-03-03 15:02:13,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:02:13,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 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 158 [2025-03-03 15:02:13,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:13,124 INFO L225 Difference]: With dead ends: 20189 [2025-03-03 15:02:13,124 INFO L226 Difference]: Without dead ends: 10116 [2025-03-03 15:02:13,135 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:02:13,136 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 14 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:13,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1388 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:02:13,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10116 states. [2025-03-03 15:02:13,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10116 to 10116. [2025-03-03 15:02:13,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10116 states, 10115 states have (on average 1.360850222441918) internal successors, (13765), 10115 states have internal predecessors, (13765), 0 states have call successors, (0), 0 states 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:02:13,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10116 states to 10116 states and 13765 transitions. [2025-03-03 15:02:13,330 INFO L78 Accepts]: Start accepts. Automaton has 10116 states and 13765 transitions. Word has length 158 [2025-03-03 15:02:13,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:13,330 INFO L471 AbstractCegarLoop]: Abstraction has 10116 states and 13765 transitions. [2025-03-03 15:02:13,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states 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:02:13,331 INFO L276 IsEmpty]: Start isEmpty. Operand 10116 states and 13765 transitions. [2025-03-03 15:02:13,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-03 15:02:13,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:13,343 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] [2025-03-03 15:02:13,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:02:13,344 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:13,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:13,344 INFO L85 PathProgramCache]: Analyzing trace with hash -562813651, now seen corresponding path program 1 times [2025-03-03 15:02:13,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:13,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119430936] [2025-03-03 15:02:13,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:13,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:13,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-03 15:02:13,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-03 15:02:13,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:13,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:13,430 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:02:13,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:13,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119430936] [2025-03-03 15:02:13,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119430936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:13,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:13,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:02:13,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965312833] [2025-03-03 15:02:13,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:13,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:02:13,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:13,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:02:13,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:02:13,431 INFO L87 Difference]: Start difference. First operand 10116 states and 13765 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states 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:02:13,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:13,516 INFO L93 Difference]: Finished difference Result 23910 states and 32553 transitions. [2025-03-03 15:02:13,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:02:13,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 158 [2025-03-03 15:02:13,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:13,542 INFO L225 Difference]: With dead ends: 23910 [2025-03-03 15:02:13,543 INFO L226 Difference]: Without dead ends: 15006 [2025-03-03 15:02:13,557 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:02:13,558 INFO L435 NwaCegarLoop]: 793 mSDtfsCounter, 365 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:13,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1190 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:02:13,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15006 states. [2025-03-03 15:02:13,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15006 to 15004. [2025-03-03 15:02:13,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15004 states, 15003 states have (on average 1.3360661201093114) internal successors, (20045), 15003 states have internal predecessors, (20045), 0 states have call successors, (0), 0 states 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:02:13,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15004 states to 15004 states and 20045 transitions. [2025-03-03 15:02:13,818 INFO L78 Accepts]: Start accepts. Automaton has 15004 states and 20045 transitions. Word has length 158 [2025-03-03 15:02:13,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:13,818 INFO L471 AbstractCegarLoop]: Abstraction has 15004 states and 20045 transitions. [2025-03-03 15:02:13,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states 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:02:13,818 INFO L276 IsEmpty]: Start isEmpty. Operand 15004 states and 20045 transitions. [2025-03-03 15:02:13,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 15:02:13,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:13,833 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] [2025-03-03 15:02:13,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:02:13,834 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:13,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:13,834 INFO L85 PathProgramCache]: Analyzing trace with hash -983926298, now seen corresponding path program 1 times [2025-03-03 15:02:13,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:13,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382034268] [2025-03-03 15:02:13,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:13,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:13,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 15:02:13,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 15:02:13,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:13,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:14,241 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:02:14,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:14,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382034268] [2025-03-03 15:02:14,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382034268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:14,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:14,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:02:14,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365172026] [2025-03-03 15:02:14,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:14,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:02:14,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:14,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:02:14,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:02:14,244 INFO L87 Difference]: Start difference. First operand 15004 states and 20045 transitions. Second operand has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 0 states have call successors, (0), 0 states 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:02:14,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:14,469 INFO L93 Difference]: Finished difference Result 31664 states and 44065 transitions. [2025-03-03 15:02:14,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:02:14,470 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2025-03-03 15:02:14,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:14,515 INFO L225 Difference]: With dead ends: 31664 [2025-03-03 15:02:14,515 INFO L226 Difference]: Without dead ends: 25502 [2025-03-03 15:02:14,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:02:14,532 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 1362 mSDsluCounter, 2058 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1362 SdHoareTripleChecker+Valid, 2473 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:14,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1362 Valid, 2473 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:02:14,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25502 states. [2025-03-03 15:02:14,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25502 to 25500. [2025-03-03 15:02:14,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25500 states, 25499 states have (on average 1.3550727479509) internal successors, (34553), 25499 states have internal predecessors, (34553), 0 states have call successors, (0), 0 states 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:02:14,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25500 states to 25500 states and 34553 transitions. [2025-03-03 15:02:14,908 INFO L78 Accepts]: Start accepts. Automaton has 25500 states and 34553 transitions. Word has length 164 [2025-03-03 15:02:14,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:14,908 INFO L471 AbstractCegarLoop]: Abstraction has 25500 states and 34553 transitions. [2025-03-03 15:02:14,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 0 states have call successors, (0), 0 states 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:02:14,908 INFO L276 IsEmpty]: Start isEmpty. Operand 25500 states and 34553 transitions. [2025-03-03 15:02:14,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 15:02:14,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:14,931 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] [2025-03-03 15:02:14,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:02:14,932 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:14,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:14,932 INFO L85 PathProgramCache]: Analyzing trace with hash -765071580, now seen corresponding path program 1 times [2025-03-03 15:02:14,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:14,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189341887] [2025-03-03 15:02:14,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:14,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:14,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 15:02:14,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 15:02:14,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:14,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:15,053 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:02:15,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:15,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189341887] [2025-03-03 15:02:15,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189341887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:15,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:15,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:02:15,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572152567] [2025-03-03 15:02:15,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:15,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:02:15,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:15,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:02:15,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:02:15,055 INFO L87 Difference]: Start difference. First operand 25500 states and 34553 transitions. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 0 states have call successors, (0), 0 states 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:02:15,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:15,241 INFO L93 Difference]: Finished difference Result 36603 states and 51927 transitions. [2025-03-03 15:02:15,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:02:15,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2025-03-03 15:02:15,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:15,299 INFO L225 Difference]: With dead ends: 36603 [2025-03-03 15:02:15,300 INFO L226 Difference]: Without dead ends: 34436 [2025-03-03 15:02:15,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:02:15,315 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 994 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:15,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [994 Valid, 1333 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:02:15,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34436 states. [2025-03-03 15:02:15,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34436 to 30160. [2025-03-03 15:02:15,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30160 states, 30159 states have (on average 1.3846281375377167) internal successors, (41759), 30159 states have internal predecessors, (41759), 0 states have call successors, (0), 0 states 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:02:15,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30160 states to 30160 states and 41759 transitions. [2025-03-03 15:02:15,841 INFO L78 Accepts]: Start accepts. Automaton has 30160 states and 41759 transitions. Word has length 164 [2025-03-03 15:02:15,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:15,842 INFO L471 AbstractCegarLoop]: Abstraction has 30160 states and 41759 transitions. [2025-03-03 15:02:15,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 0 states have call successors, (0), 0 states 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:02:15,843 INFO L276 IsEmpty]: Start isEmpty. Operand 30160 states and 41759 transitions. [2025-03-03 15:02:15,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 15:02:15,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:15,865 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] [2025-03-03 15:02:15,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:02:15,865 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:15,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:15,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1009935782, now seen corresponding path program 1 times [2025-03-03 15:02:15,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:15,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513366290] [2025-03-03 15:02:15,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:15,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:15,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 15:02:15,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 15:02:15,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:15,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:16,015 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:02:16,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:16,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513366290] [2025-03-03 15:02:16,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513366290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:16,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:16,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:02:16,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554432716] [2025-03-03 15:02:16,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:16,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:02:16,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:16,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:02:16,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:02:16,016 INFO L87 Difference]: Start difference. First operand 30160 states and 41759 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states 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:02:16,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:16,221 INFO L93 Difference]: Finished difference Result 62671 states and 89350 transitions. [2025-03-03 15:02:16,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:02:16,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2025-03-03 15:02:16,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:16,302 INFO L225 Difference]: With dead ends: 62671 [2025-03-03 15:02:16,302 INFO L226 Difference]: Without dead ends: 48299 [2025-03-03 15:02:16,329 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:02:16,329 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 254 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:16,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 722 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:02:16,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48299 states. [2025-03-03 15:02:17,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48299 to 48297. [2025-03-03 15:02:17,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48297 states, 48296 states have (on average 1.3794103031306941) internal successors, (66620), 48296 states have internal predecessors, (66620), 0 states have call successors, (0), 0 states 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:02:17,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48297 states to 48297 states and 66620 transitions. [2025-03-03 15:02:17,202 INFO L78 Accepts]: Start accepts. Automaton has 48297 states and 66620 transitions. Word has length 164 [2025-03-03 15:02:17,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:17,202 INFO L471 AbstractCegarLoop]: Abstraction has 48297 states and 66620 transitions. [2025-03-03 15:02:17,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states 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:02:17,203 INFO L276 IsEmpty]: Start isEmpty. Operand 48297 states and 66620 transitions. [2025-03-03 15:02:17,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 15:02:17,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:17,230 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] [2025-03-03 15:02:17,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:02:17,230 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:17,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:17,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1102062486, now seen corresponding path program 1 times [2025-03-03 15:02:17,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:17,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074428067] [2025-03-03 15:02:17,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:17,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:17,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 15:02:17,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 15:02:17,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:17,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:17,839 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:02:17,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:17,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074428067] [2025-03-03 15:02:17,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074428067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:17,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:17,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:02:17,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283793105] [2025-03-03 15:02:17,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:17,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:02:17,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:17,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:02:17,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:02:17,842 INFO L87 Difference]: Start difference. First operand 48297 states and 66620 transitions. Second operand has 13 states, 13 states have (on average 12.615384615384615) internal successors, (164), 13 states have internal predecessors, (164), 0 states have call successors, (0), 0 states 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:02:18,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:18,667 INFO L93 Difference]: Finished difference Result 76385 states and 107290 transitions. [2025-03-03 15:02:18,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 15:02:18,668 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.615384615384615) internal successors, (164), 13 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2025-03-03 15:02:18,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:18,762 INFO L225 Difference]: With dead ends: 76385 [2025-03-03 15:02:18,762 INFO L226 Difference]: Without dead ends: 65305 [2025-03-03 15:02:18,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2025-03-03 15:02:18,791 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 2166 mSDsluCounter, 4124 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2166 SdHoareTripleChecker+Valid, 4675 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:18,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2166 Valid, 4675 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:02:18,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65305 states. [2025-03-03 15:02:19,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65305 to 51623. [2025-03-03 15:02:19,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51623 states, 51622 states have (on average 1.3665878888845842) internal successors, (70546), 51622 states have internal predecessors, (70546), 0 states have call successors, (0), 0 states 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:02:19,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51623 states to 51623 states and 70546 transitions. [2025-03-03 15:02:19,644 INFO L78 Accepts]: Start accepts. Automaton has 51623 states and 70546 transitions. Word has length 164 [2025-03-03 15:02:19,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:19,645 INFO L471 AbstractCegarLoop]: Abstraction has 51623 states and 70546 transitions. [2025-03-03 15:02:19,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.615384615384615) internal successors, (164), 13 states have internal predecessors, (164), 0 states have call successors, (0), 0 states 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:02:19,645 INFO L276 IsEmpty]: Start isEmpty. Operand 51623 states and 70546 transitions. [2025-03-03 15:02:19,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 15:02:19,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:19,676 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:19,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:02:19,676 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:19,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:19,677 INFO L85 PathProgramCache]: Analyzing trace with hash -961513876, now seen corresponding path program 1 times [2025-03-03 15:02:19,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:19,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023951530] [2025-03-03 15:02:19,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:19,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:19,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 15:02:19,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 15:02:19,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:19,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:19,854 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:02:19,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:19,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023951530] [2025-03-03 15:02:19,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023951530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:19,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:19,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:02:19,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379872005] [2025-03-03 15:02:19,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:19,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:02:19,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:19,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:02:19,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:02:19,856 INFO L87 Difference]: Start difference. First operand 51623 states and 70546 transitions. Second operand has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states 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:02:20,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:20,294 INFO L93 Difference]: Finished difference Result 112558 states and 153785 transitions. [2025-03-03 15:02:20,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:02:20,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2025-03-03 15:02:20,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:20,371 INFO L225 Difference]: With dead ends: 112558 [2025-03-03 15:02:20,371 INFO L226 Difference]: Without dead ends: 67046 [2025-03-03 15:02:20,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:02:20,394 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 839 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 1698 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:20,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 1698 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:02:20,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67046 states. [2025-03-03 15:02:21,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67046 to 66558. [2025-03-03 15:02:21,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66558 states, 66557 states have (on average 1.3602926814610035) internal successors, (90537), 66557 states have internal predecessors, (90537), 0 states have call successors, (0), 0 states 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:02:21,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66558 states to 66558 states and 90537 transitions. [2025-03-03 15:02:21,439 INFO L78 Accepts]: Start accepts. Automaton has 66558 states and 90537 transitions. Word has length 164 [2025-03-03 15:02:21,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:21,439 INFO L471 AbstractCegarLoop]: Abstraction has 66558 states and 90537 transitions. [2025-03-03 15:02:21,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states 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:02:21,439 INFO L276 IsEmpty]: Start isEmpty. Operand 66558 states and 90537 transitions. [2025-03-03 15:02:21,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 15:02:21,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:21,485 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] [2025-03-03 15:02:21,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:02:21,485 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:21,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:21,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1523047776, now seen corresponding path program 1 times [2025-03-03 15:02:21,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:21,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505747073] [2025-03-03 15:02:21,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:21,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:21,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 15:02:21,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 15:02:21,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:21,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:21,551 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:02:21,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:21,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505747073] [2025-03-03 15:02:21,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505747073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:21,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:21,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:02:21,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044071113] [2025-03-03 15:02:21,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:21,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:02:21,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:21,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:02:21,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:02:21,554 INFO L87 Difference]: Start difference. First operand 66558 states and 90537 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:21,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:21,935 INFO L93 Difference]: Finished difference Result 127333 states and 173199 transitions. [2025-03-03 15:02:21,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:02:21,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2025-03-03 15:02:21,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:22,050 INFO L225 Difference]: With dead ends: 127333 [2025-03-03 15:02:22,050 INFO L226 Difference]: Without dead ends: 92198 [2025-03-03 15:02:22,099 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:02:22,101 INFO L435 NwaCegarLoop]: 707 mSDtfsCounter, 412 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:22,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 1145 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:02:22,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92198 states. [2025-03-03 15:02:23,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92198 to 66558. [2025-03-03 15:02:23,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66558 states, 66557 states have (on average 1.3602025331670597) internal successors, (90531), 66557 states have internal predecessors, (90531), 0 states have call successors, (0), 0 states 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:02:23,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66558 states to 66558 states and 90531 transitions. [2025-03-03 15:02:23,165 INFO L78 Accepts]: Start accepts. Automaton has 66558 states and 90531 transitions. Word has length 165 [2025-03-03 15:02:23,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:23,165 INFO L471 AbstractCegarLoop]: Abstraction has 66558 states and 90531 transitions. [2025-03-03 15:02:23,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:02:23,165 INFO L276 IsEmpty]: Start isEmpty. Operand 66558 states and 90531 transitions. [2025-03-03 15:02:23,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 15:02:23,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:23,196 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:02:23,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:02:23,197 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:23,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:23,197 INFO L85 PathProgramCache]: Analyzing trace with hash 758722919, now seen corresponding path program 1 times [2025-03-03 15:02:23,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:23,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202614798] [2025-03-03 15:02:23,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:23,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:23,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 15:02:23,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 15:02:23,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:23,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:23,406 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:02:23,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:23,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202614798] [2025-03-03 15:02:23,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202614798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:23,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:23,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:02:23,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126099936] [2025-03-03 15:02:23,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:23,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:02:23,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:23,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:02:23,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:02:23,408 INFO L87 Difference]: Start difference. First operand 66558 states and 90531 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 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:02:23,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:23,905 INFO L93 Difference]: Finished difference Result 115817 states and 157665 transitions. [2025-03-03 15:02:23,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:02:23,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 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:02:23,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:23,996 INFO L225 Difference]: With dead ends: 115817 [2025-03-03 15:02:23,997 INFO L226 Difference]: Without dead ends: 62673 [2025-03-03 15:02:24,029 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:02:24,030 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 16 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1392 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:24,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1392 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:02:24,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62673 states. [2025-03-03 15:02:24,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62673 to 62673. [2025-03-03 15:02:24,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62673 states, 62672 states have (on average 1.360464003063569) internal successors, (85263), 62672 states have internal predecessors, (85263), 0 states have call successors, (0), 0 states 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:02:25,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62673 states to 62673 states and 85263 transitions. [2025-03-03 15:02:25,145 INFO L78 Accepts]: Start accepts. Automaton has 62673 states and 85263 transitions. Word has length 166 [2025-03-03 15:02:25,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:25,146 INFO L471 AbstractCegarLoop]: Abstraction has 62673 states and 85263 transitions. [2025-03-03 15:02:25,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 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:02:25,146 INFO L276 IsEmpty]: Start isEmpty. Operand 62673 states and 85263 transitions. [2025-03-03 15:02:25,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 15:02:25,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:25,172 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] [2025-03-03 15:02:25,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 15:02:25,172 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:25,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:25,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1863867487, now seen corresponding path program 1 times [2025-03-03 15:02:25,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:25,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129241398] [2025-03-03 15:02:25,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:25,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:25,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 15:02:25,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 15:02:25,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:25,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:25,274 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:02:25,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:25,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129241398] [2025-03-03 15:02:25,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129241398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:25,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:25,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:02:25,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842764819] [2025-03-03 15:02:25,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:25,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:02:25,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:25,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:02:25,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:02:25,275 INFO L87 Difference]: Start difference. First operand 62673 states and 85263 transitions. Second operand has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 0 states 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:02:25,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:25,736 INFO L93 Difference]: Finished difference Result 131477 states and 192291 transitions. [2025-03-03 15:02:25,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:02:25,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2025-03-03 15:02:25,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:26,003 INFO L225 Difference]: With dead ends: 131477 [2025-03-03 15:02:26,003 INFO L226 Difference]: Without dead ends: 105229 [2025-03-03 15:02:26,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:02:26,027 INFO L435 NwaCegarLoop]: 681 mSDtfsCounter, 1278 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1278 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:26,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1278 Valid, 1720 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:02:26,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105229 states. [2025-03-03 15:02:27,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105229 to 83715. [2025-03-03 15:02:27,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83715 states, 83714 states have (on average 1.4022744104928686) internal successors, (117390), 83714 states have internal predecessors, (117390), 0 states have call successors, (0), 0 states 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:02:27,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83715 states to 83715 states and 117390 transitions. [2025-03-03 15:02:27,452 INFO L78 Accepts]: Start accepts. Automaton has 83715 states and 117390 transitions. Word has length 170 [2025-03-03 15:02:27,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:27,452 INFO L471 AbstractCegarLoop]: Abstraction has 83715 states and 117390 transitions. [2025-03-03 15:02:27,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 0 states 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:02:27,452 INFO L276 IsEmpty]: Start isEmpty. Operand 83715 states and 117390 transitions. [2025-03-03 15:02:27,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 15:02:27,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:27,478 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] [2025-03-03 15:02:27,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 15:02:27,479 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:27,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:27,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1875279913, now seen corresponding path program 1 times [2025-03-03 15:02:27,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:27,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494593782] [2025-03-03 15:02:27,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:27,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:27,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 15:02:27,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 15:02:27,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:27,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:27,917 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:02:27,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:27,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494593782] [2025-03-03 15:02:27,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494593782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:27,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:27,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:02:27,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637002092] [2025-03-03 15:02:27,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:27,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:02:27,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:27,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:02:27,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:02:27,919 INFO L87 Difference]: Start difference. First operand 83715 states and 117390 transitions. Second operand has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 0 states 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:02:28,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:28,302 INFO L93 Difference]: Finished difference Result 132690 states and 192914 transitions. [2025-03-03 15:02:28,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:02:28,302 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2025-03-03 15:02:28,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:28,391 INFO L225 Difference]: With dead ends: 132690 [2025-03-03 15:02:28,391 INFO L226 Difference]: Without dead ends: 83717 [2025-03-03 15:02:28,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:02:28,438 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 821 mSDsluCounter, 2018 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 2435 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:28,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 2435 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:02:28,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83717 states. [2025-03-03 15:02:29,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83717 to 81344. [2025-03-03 15:02:29,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81344 states, 81343 states have (on average 1.3933589860221531) internal successors, (113340), 81343 states have internal predecessors, (113340), 0 states have call successors, (0), 0 states 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:02:29,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81344 states to 81344 states and 113340 transitions. [2025-03-03 15:02:29,646 INFO L78 Accepts]: Start accepts. Automaton has 81344 states and 113340 transitions. Word has length 170 [2025-03-03 15:02:29,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:29,646 INFO L471 AbstractCegarLoop]: Abstraction has 81344 states and 113340 transitions. [2025-03-03 15:02:29,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 0 states 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:02:29,646 INFO L276 IsEmpty]: Start isEmpty. Operand 81344 states and 113340 transitions. [2025-03-03 15:02:29,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 15:02:29,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:29,682 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] [2025-03-03 15:02:29,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 15:02:29,683 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:29,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:29,683 INFO L85 PathProgramCache]: Analyzing trace with hash -100272551, now seen corresponding path program 1 times [2025-03-03 15:02:29,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:29,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863067152] [2025-03-03 15:02:29,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:29,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:29,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 15:02:29,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 15:02:29,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:29,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:29,828 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:02:29,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:29,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863067152] [2025-03-03 15:02:29,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863067152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:29,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:29,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:02:29,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13393122] [2025-03-03 15:02:29,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:29,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:02:29,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:29,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:02:29,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:02:29,830 INFO L87 Difference]: Start difference. First operand 81344 states and 113340 transitions. Second operand has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 0 states 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:02:30,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:30,321 INFO L93 Difference]: Finished difference Result 121626 states and 175099 transitions. [2025-03-03 15:02:30,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:02:30,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2025-03-03 15:02:30,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:30,758 INFO L225 Difference]: With dead ends: 121626 [2025-03-03 15:02:30,758 INFO L226 Difference]: Without dead ends: 112107 [2025-03-03 15:02:30,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:02:30,786 INFO L435 NwaCegarLoop]: 693 mSDtfsCounter, 801 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:30,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 1475 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:02:30,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112107 states. [2025-03-03 15:02:31,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112107 to 86086. [2025-03-03 15:02:31,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86086 states, 86085 states have (on average 1.4007318348144275) internal successors, (120582), 86085 states have internal predecessors, (120582), 0 states have call successors, (0), 0 states 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:02:32,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86086 states to 86086 states and 120582 transitions. [2025-03-03 15:02:32,137 INFO L78 Accepts]: Start accepts. Automaton has 86086 states and 120582 transitions. Word has length 170 [2025-03-03 15:02:32,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:32,137 INFO L471 AbstractCegarLoop]: Abstraction has 86086 states and 120582 transitions. [2025-03-03 15:02:32,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 0 states 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:02:32,138 INFO L276 IsEmpty]: Start isEmpty. Operand 86086 states and 120582 transitions. [2025-03-03 15:02:32,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 15:02:32,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:32,164 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] [2025-03-03 15:02:32,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 15:02:32,164 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:32,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:32,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1429273261, now seen corresponding path program 1 times [2025-03-03 15:02:32,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:32,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391559032] [2025-03-03 15:02:32,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:32,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:32,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 15:02:32,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 15:02:32,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:32,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:32,324 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:02:32,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:32,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391559032] [2025-03-03 15:02:32,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391559032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:32,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:32,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:02:32,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978115656] [2025-03-03 15:02:32,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:32,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:02:32,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:32,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:02:32,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:02:32,325 INFO L87 Difference]: Start difference. First operand 86086 states and 120582 transitions. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states 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:02:32,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:32,662 INFO L93 Difference]: Finished difference Result 131505 states and 184360 transitions. [2025-03-03 15:02:32,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:02:32,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2025-03-03 15:02:32,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:32,741 INFO L225 Difference]: With dead ends: 131505 [2025-03-03 15:02:32,742 INFO L226 Difference]: Without dead ends: 56160 [2025-03-03 15:02:32,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:02:32,796 INFO L435 NwaCegarLoop]: 705 mSDtfsCounter, 376 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:32,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1768 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:02:32,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56160 states. [2025-03-03 15:02:33,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56160 to 55885. [2025-03-03 15:02:33,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55885 states, 55884 states have (on average 1.4046238637177009) internal successors, (78496), 55884 states have internal predecessors, (78496), 0 states have call successors, (0), 0 states 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:02:33,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55885 states to 55885 states and 78496 transitions. [2025-03-03 15:02:33,809 INFO L78 Accepts]: Start accepts. Automaton has 55885 states and 78496 transitions. Word has length 170 [2025-03-03 15:02:33,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:33,809 INFO L471 AbstractCegarLoop]: Abstraction has 55885 states and 78496 transitions. [2025-03-03 15:02:33,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states 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:02:33,810 INFO L276 IsEmpty]: Start isEmpty. Operand 55885 states and 78496 transitions. [2025-03-03 15:02:33,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 15:02:33,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:33,830 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:02:33,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 15:02:33,830 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:33,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:33,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1062588368, now seen corresponding path program 1 times [2025-03-03 15:02:33,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:33,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273593561] [2025-03-03 15:02:33,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:33,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:33,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 15:02:33,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 15:02:33,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:33,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:34,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:02:34,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:34,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273593561] [2025-03-03 15:02:34,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273593561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:34,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:34,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:02:34,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720188484] [2025-03-03 15:02:34,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:34,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:02:34,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:34,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:02:34,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:02:34,155 INFO L87 Difference]: Start difference. First operand 55885 states and 78496 transitions. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 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:02:34,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:34,416 INFO L93 Difference]: Finished difference Result 119101 states and 167403 transitions. [2025-03-03 15:02:34,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:02:34,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 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:02:34,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:34,504 INFO L225 Difference]: With dead ends: 119101 [2025-03-03 15:02:34,504 INFO L226 Difference]: Without dead ends: 77455 [2025-03-03 15:02:34,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:02:34,550 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 819 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 1460 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:34,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 1460 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:02:34,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77455 states. [2025-03-03 15:02:35,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77455 to 56081. [2025-03-03 15:02:35,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56081 states, 56080 states have (on average 1.403762482168331) internal successors, (78723), 56080 states have internal predecessors, (78723), 0 states have call successors, (0), 0 states 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:02:35,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56081 states to 56081 states and 78723 transitions. [2025-03-03 15:02:35,397 INFO L78 Accepts]: Start accepts. Automaton has 56081 states and 78723 transitions. Word has length 172 [2025-03-03 15:02:35,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:35,397 INFO L471 AbstractCegarLoop]: Abstraction has 56081 states and 78723 transitions. [2025-03-03 15:02:35,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 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:02:35,397 INFO L276 IsEmpty]: Start isEmpty. Operand 56081 states and 78723 transitions. [2025-03-03 15:02:35,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 15:02:35,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:35,414 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:02:35,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 15:02:35,414 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:35,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:35,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1930587624, now seen corresponding path program 1 times [2025-03-03 15:02:35,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:35,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275364483] [2025-03-03 15:02:35,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:35,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:35,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 15:02:35,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 15:02:35,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:35,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:35,457 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:02:35,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:35,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275364483] [2025-03-03 15:02:35,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275364483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:35,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:35,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:02:35,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839152021] [2025-03-03 15:02:35,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:35,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:02:35,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:35,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:02:35,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:02:35,459 INFO L87 Difference]: Start difference. First operand 56081 states and 78723 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:02:35,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:35,809 INFO L93 Difference]: Finished difference Result 111611 states and 156798 transitions. [2025-03-03 15:02:35,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:02:35,810 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:02:35,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:35,868 INFO L225 Difference]: With dead ends: 111611 [2025-03-03 15:02:35,868 INFO L226 Difference]: Without dead ends: 56101 [2025-03-03 15:02:35,896 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:02:35,897 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 0 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:35,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 874 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:02:35,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56101 states. [2025-03-03 15:02:36,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56101 to 56101. [2025-03-03 15:02:36,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56101 states, 56100 states have (on average 1.4036185383244206) internal successors, (78743), 56100 states have internal predecessors, (78743), 0 states have call successors, (0), 0 states 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:02:36,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56101 states to 56101 states and 78743 transitions. [2025-03-03 15:02:36,661 INFO L78 Accepts]: Start accepts. Automaton has 56101 states and 78743 transitions. Word has length 173 [2025-03-03 15:02:36,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:36,661 INFO L471 AbstractCegarLoop]: Abstraction has 56101 states and 78743 transitions. [2025-03-03 15:02:36,661 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:02:36,661 INFO L276 IsEmpty]: Start isEmpty. Operand 56101 states and 78743 transitions. [2025-03-03 15:02:36,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 15:02:36,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:36,684 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:02:36,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 15:02:36,684 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:36,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:36,684 INFO L85 PathProgramCache]: Analyzing trace with hash 723793704, now seen corresponding path program 1 times [2025-03-03 15:02:36,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:36,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127880677] [2025-03-03 15:02:36,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:36,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:36,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 15:02:36,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 15:02:36,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:36,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:36,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:02:36,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:36,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127880677] [2025-03-03 15:02:36,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127880677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:36,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:36,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:02:36,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982629306] [2025-03-03 15:02:36,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:36,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:02:36,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:36,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:02:36,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:02:36,971 INFO L87 Difference]: Start difference. First operand 56101 states and 78743 transitions. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 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:02:37,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:37,242 INFO L93 Difference]: Finished difference Result 112003 states and 157219 transitions. [2025-03-03 15:02:37,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:02:37,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 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:02:37,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:37,316 INFO L225 Difference]: With dead ends: 112003 [2025-03-03 15:02:37,316 INFO L226 Difference]: Without dead ends: 56101 [2025-03-03 15:02:37,361 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:02:37,361 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 0 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:37,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1336 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:02:37,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56101 states. [2025-03-03 15:02:38,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56101 to 56087. [2025-03-03 15:02:38,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56087 states, 56086 states have (on average 1.4033805227686054) internal successors, (78710), 56086 states have internal predecessors, (78710), 0 states have call successors, (0), 0 states 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:02:38,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56087 states to 56087 states and 78710 transitions. [2025-03-03 15:02:38,210 INFO L78 Accepts]: Start accepts. Automaton has 56087 states and 78710 transitions. Word has length 174 [2025-03-03 15:02:38,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:38,210 INFO L471 AbstractCegarLoop]: Abstraction has 56087 states and 78710 transitions. [2025-03-03 15:02:38,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 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:02:38,210 INFO L276 IsEmpty]: Start isEmpty. Operand 56087 states and 78710 transitions. [2025-03-03 15:02:38,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 15:02:38,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:38,228 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:38,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 15:02:38,228 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:38,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:38,229 INFO L85 PathProgramCache]: Analyzing trace with hash 723658061, now seen corresponding path program 1 times [2025-03-03 15:02:38,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:38,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839420611] [2025-03-03 15:02:38,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:38,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:38,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 15:02:38,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 15:02:38,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:38,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:38,634 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:02:38,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:38,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839420611] [2025-03-03 15:02:38,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839420611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:38,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:38,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:02:38,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508380387] [2025-03-03 15:02:38,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:38,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:02:38,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:38,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:02:38,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:02:38,636 INFO L87 Difference]: Start difference. First operand 56087 states and 78710 transitions. Second operand has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 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:02:38,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:38,822 INFO L93 Difference]: Finished difference Result 91749 states and 128512 transitions. [2025-03-03 15:02:38,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:02:38,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 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:02:38,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:38,878 INFO L225 Difference]: With dead ends: 91749 [2025-03-03 15:02:38,878 INFO L226 Difference]: Without dead ends: 48985 [2025-03-03 15:02:38,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:02:38,914 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 399 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1751 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:38,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1751 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:02:38,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48985 states. [2025-03-03 15:02:39,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48985 to 48536. [2025-03-03 15:02:39,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48536 states, 48535 states have (on average 1.4014834655403317) internal successors, (68021), 48535 states have internal predecessors, (68021), 0 states have call successors, (0), 0 states 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:02:39,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48536 states to 48536 states and 68021 transitions. [2025-03-03 15:02:39,607 INFO L78 Accepts]: Start accepts. Automaton has 48536 states and 68021 transitions. Word has length 174 [2025-03-03 15:02:39,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:39,607 INFO L471 AbstractCegarLoop]: Abstraction has 48536 states and 68021 transitions. [2025-03-03 15:02:39,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 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:02:39,607 INFO L276 IsEmpty]: Start isEmpty. Operand 48536 states and 68021 transitions. [2025-03-03 15:02:39,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 15:02:39,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:39,621 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:02:39,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 15:02:39,621 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:39,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:39,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1063260944, now seen corresponding path program 1 times [2025-03-03 15:02:39,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:39,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236774205] [2025-03-03 15:02:39,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:39,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:39,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 15:02:39,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 15:02:39,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:39,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:39,998 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:02:39,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:39,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236774205] [2025-03-03 15:02:39,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236774205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:39,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:39,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:02:39,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547042746] [2025-03-03 15:02:39,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:39,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:02:39,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:39,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:02:39,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:02:40,000 INFO L87 Difference]: Start difference. First operand 48536 states and 68021 transitions. Second operand has 13 states, 13 states have (on average 13.538461538461538) internal successors, (176), 13 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:02:40,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:40,866 INFO L93 Difference]: Finished difference Result 77058 states and 108336 transitions. [2025-03-03 15:02:40,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:02:40,867 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 13.538461538461538) internal successors, (176), 13 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:02:40,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:40,927 INFO L225 Difference]: With dead ends: 77058 [2025-03-03 15:02:40,927 INFO L226 Difference]: Without dead ends: 63341 [2025-03-03 15:02:40,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=585, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:02:40,944 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 2105 mSDsluCounter, 3898 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2105 SdHoareTripleChecker+Valid, 4417 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:40,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2105 Valid, 4417 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:02:40,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63341 states. [2025-03-03 15:02:41,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63341 to 51767. [2025-03-03 15:02:41,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51767 states, 51766 states have (on average 1.387783487231001) internal successors, (71840), 51766 states have internal predecessors, (71840), 0 states have call successors, (0), 0 states 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:02:41,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51767 states to 51767 states and 71840 transitions. [2025-03-03 15:02:41,766 INFO L78 Accepts]: Start accepts. Automaton has 51767 states and 71840 transitions. Word has length 176 [2025-03-03 15:02:41,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:41,766 INFO L471 AbstractCegarLoop]: Abstraction has 51767 states and 71840 transitions. [2025-03-03 15:02:41,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.538461538461538) internal successors, (176), 13 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:02:41,766 INFO L276 IsEmpty]: Start isEmpty. Operand 51767 states and 71840 transitions. [2025-03-03 15:02:41,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 15:02:41,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:41,788 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:02:41,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 15:02:41,789 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:41,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:41,789 INFO L85 PathProgramCache]: Analyzing trace with hash -922712334, now seen corresponding path program 1 times [2025-03-03 15:02:41,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:41,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407308973] [2025-03-03 15:02:41,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:41,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:41,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 15:02:41,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 15:02:41,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:41,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:43,119 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:02:43,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:43,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407308973] [2025-03-03 15:02:43,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407308973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:43,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:43,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-03 15:02:43,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617353237] [2025-03-03 15:02:43,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:43,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 15:02:43,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:43,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 15:02:43,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2025-03-03 15:02:43,121 INFO L87 Difference]: Start difference. First operand 51767 states and 71840 transitions. Second operand has 22 states, 22 states have (on average 8.0) internal successors, (176), 22 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:02:49,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:49,049 INFO L93 Difference]: Finished difference Result 143979 states and 209261 transitions. [2025-03-03 15:02:49,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-03 15:02:49,049 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 8.0) internal successors, (176), 22 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:02:49,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:49,249 INFO L225 Difference]: With dead ends: 143979 [2025-03-03 15:02:49,249 INFO L226 Difference]: Without dead ends: 135649 [2025-03-03 15:02:49,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1395 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1198, Invalid=4502, Unknown=0, NotChecked=0, Total=5700 [2025-03-03 15:02:49,294 INFO L435 NwaCegarLoop]: 903 mSDtfsCounter, 6003 mSDsluCounter, 12696 mSDsCounter, 0 mSdLazyCounter, 4790 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6003 SdHoareTripleChecker+Valid, 13599 SdHoareTripleChecker+Invalid, 4945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 4790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:49,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6003 Valid, 13599 Invalid, 4945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 4790 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 15:02:49,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135649 states. [2025-03-03 15:02:50,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135649 to 53871. [2025-03-03 15:02:50,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53871 states, 53870 states have (on average 1.3796175979209206) internal successors, (74320), 53870 states have internal predecessors, (74320), 0 states have call successors, (0), 0 states 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:02:50,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53871 states to 53871 states and 74320 transitions. [2025-03-03 15:02:50,323 INFO L78 Accepts]: Start accepts. Automaton has 53871 states and 74320 transitions. Word has length 176 [2025-03-03 15:02:50,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:50,323 INFO L471 AbstractCegarLoop]: Abstraction has 53871 states and 74320 transitions. [2025-03-03 15:02:50,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 8.0) internal successors, (176), 22 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:02:50,323 INFO L276 IsEmpty]: Start isEmpty. Operand 53871 states and 74320 transitions. [2025-03-03 15:02:50,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 15:02:50,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:50,344 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:02:50,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 15:02:50,344 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:50,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:50,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1779143092, now seen corresponding path program 1 times [2025-03-03 15:02:50,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:50,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136006883] [2025-03-03 15:02:50,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:50,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:50,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 15:02:50,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 15:02:50,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:50,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:50,438 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:02:50,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:50,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136006883] [2025-03-03 15:02:50,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136006883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:50,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:50,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:02:50,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605613330] [2025-03-03 15:02:50,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:50,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:02:50,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:50,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:02:50,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:02:50,440 INFO L87 Difference]: Start difference. First operand 53871 states and 74320 transitions. Second operand has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 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:02:50,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:50,677 INFO L93 Difference]: Finished difference Result 77729 states and 110900 transitions. [2025-03-03 15:02:50,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:02:50,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 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:02:50,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:50,763 INFO L225 Difference]: With dead ends: 77729 [2025-03-03 15:02:50,763 INFO L226 Difference]: Without dead ends: 72405 [2025-03-03 15:02:50,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:02:50,791 INFO L435 NwaCegarLoop]: 725 mSDtfsCounter, 814 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 1494 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:50,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 1494 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:02:50,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72405 states. [2025-03-03 15:02:51,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72405 to 56523. [2025-03-03 15:02:51,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56523 states, 56522 states have (on average 1.3865751388839744) internal successors, (78372), 56522 states have internal predecessors, (78372), 0 states have call successors, (0), 0 states 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:02:51,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56523 states to 56523 states and 78372 transitions. [2025-03-03 15:02:51,602 INFO L78 Accepts]: Start accepts. Automaton has 56523 states and 78372 transitions. Word has length 176 [2025-03-03 15:02:51,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:51,602 INFO L471 AbstractCegarLoop]: Abstraction has 56523 states and 78372 transitions. [2025-03-03 15:02:51,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 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:02:51,602 INFO L276 IsEmpty]: Start isEmpty. Operand 56523 states and 78372 transitions. [2025-03-03 15:02:51,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 15:02:51,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:51,623 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:02:51,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 15:02:51,623 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:51,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:51,623 INFO L85 PathProgramCache]: Analyzing trace with hash 711259702, now seen corresponding path program 1 times [2025-03-03 15:02:51,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:51,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040245434] [2025-03-03 15:02:51,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:51,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:51,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 15:02:51,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 15:02:51,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:51,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:53,234 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:02:53,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:53,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040245434] [2025-03-03 15:02:53,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040245434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:53,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:53,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-03-03 15:02:53,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104967268] [2025-03-03 15:02:53,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:53,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 15:02:53,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:53,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 15:02:53,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2025-03-03 15:02:53,236 INFO L87 Difference]: Start difference. First operand 56523 states and 78372 transitions. Second operand has 24 states, 24 states have (on average 7.333333333333333) internal successors, (176), 24 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:02:57,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:57,506 INFO L93 Difference]: Finished difference Result 108852 states and 156230 transitions. [2025-03-03 15:02:57,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-03 15:02:57,506 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.333333333333333) internal successors, (176), 24 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:02:57,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:57,621 INFO L225 Difference]: With dead ends: 108852 [2025-03-03 15:02:57,621 INFO L226 Difference]: Without dead ends: 102078 [2025-03-03 15:02:57,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=628, Invalid=2564, Unknown=0, NotChecked=0, Total=3192 [2025-03-03 15:02:57,651 INFO L435 NwaCegarLoop]: 781 mSDtfsCounter, 5741 mSDsluCounter, 11643 mSDsCounter, 0 mSdLazyCounter, 4521 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5741 SdHoareTripleChecker+Valid, 12424 SdHoareTripleChecker+Invalid, 4594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 4521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:57,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5741 Valid, 12424 Invalid, 4594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 4521 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 15:02:57,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102078 states. [2025-03-03 15:02:58,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102078 to 57972. [2025-03-03 15:02:58,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57972 states, 57971 states have (on average 1.382053095513274) internal successors, (80119), 57971 states have internal predecessors, (80119), 0 states have call successors, (0), 0 states 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:02:58,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57972 states to 57972 states and 80119 transitions. [2025-03-03 15:02:58,562 INFO L78 Accepts]: Start accepts. Automaton has 57972 states and 80119 transitions. Word has length 176 [2025-03-03 15:02:58,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:02:58,563 INFO L471 AbstractCegarLoop]: Abstraction has 57972 states and 80119 transitions. [2025-03-03 15:02:58,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.333333333333333) internal successors, (176), 24 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:02:58,563 INFO L276 IsEmpty]: Start isEmpty. Operand 57972 states and 80119 transitions. [2025-03-03 15:02:58,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 15:02:58,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:02:58,590 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:02:58,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 15:02:58,590 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:02:58,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:02:58,591 INFO L85 PathProgramCache]: Analyzing trace with hash -548156393, now seen corresponding path program 1 times [2025-03-03 15:02:58,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:02:58,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748698568] [2025-03-03 15:02:58,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:02:58,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:02:58,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 15:02:58,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 15:02:58,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:02:58,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:02:58,869 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:02:58,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:02:58,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748698568] [2025-03-03 15:02:58,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748698568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:02:58,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:02:58,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:02:58,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848999686] [2025-03-03 15:02:58,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:02:58,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:02:58,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:02:58,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:02:58,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:02:58,870 INFO L87 Difference]: Start difference. First operand 57972 states and 80119 transitions. Second operand has 10 states, 10 states have (on average 17.6) internal successors, (176), 9 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:02:59,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:02:59,212 INFO L93 Difference]: Finished difference Result 112676 states and 156392 transitions. [2025-03-03 15:02:59,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:02:59,213 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.6) internal successors, (176), 9 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:02:59,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:02:59,283 INFO L225 Difference]: With dead ends: 112676 [2025-03-03 15:02:59,283 INFO L226 Difference]: Without dead ends: 57972 [2025-03-03 15:02:59,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:02:59,486 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 2185 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2185 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:02:59,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2185 Valid, 604 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:02:59,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57972 states. [2025-03-03 15:02:59,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57972 to 57972. [2025-03-03 15:03:00,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57972 states, 57971 states have (on average 1.3640785910196478) internal successors, (79077), 57971 states have internal predecessors, (79077), 0 states have call successors, (0), 0 states 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:03:00,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57972 states to 57972 states and 79077 transitions. [2025-03-03 15:03:00,105 INFO L78 Accepts]: Start accepts. Automaton has 57972 states and 79077 transitions. Word has length 176 [2025-03-03 15:03:00,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:00,106 INFO L471 AbstractCegarLoop]: Abstraction has 57972 states and 79077 transitions. [2025-03-03 15:03:00,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.6) internal successors, (176), 9 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:03:00,106 INFO L276 IsEmpty]: Start isEmpty. Operand 57972 states and 79077 transitions. [2025-03-03 15:03:00,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 15:03:00,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:00,127 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:03:00,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-03 15:03:00,127 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:03:00,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:00,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1179875824, now seen corresponding path program 1 times [2025-03-03 15:03:00,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:00,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860065170] [2025-03-03 15:03:00,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:00,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:00,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 15:03:00,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 15:03:00,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:00,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:00,486 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:03:00,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:00,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860065170] [2025-03-03 15:03:00,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860065170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:00,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:00,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:03:00,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638009496] [2025-03-03 15:03:00,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:00,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:03:00,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:00,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:03:00,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:03:00,488 INFO L87 Difference]: Start difference. First operand 57972 states and 79077 transitions. Second operand has 13 states, 13 states have (on average 13.538461538461538) internal successors, (176), 13 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:03:01,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:01,310 INFO L93 Difference]: Finished difference Result 97805 states and 135424 transitions. [2025-03-03 15:03:01,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 15:03:01,310 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 13.538461538461538) internal successors, (176), 13 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:03:01,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:01,407 INFO L225 Difference]: With dead ends: 97805 [2025-03-03 15:03:01,407 INFO L226 Difference]: Without dead ends: 84517 [2025-03-03 15:03:01,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930 [2025-03-03 15:03:01,443 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 2193 mSDsluCounter, 4362 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2193 SdHoareTripleChecker+Valid, 4898 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:01,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2193 Valid, 4898 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:03:01,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84517 states. [2025-03-03 15:03:02,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84517 to 62128. [2025-03-03 15:03:02,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62128 states, 62127 states have (on average 1.3522944935374315) internal successors, (84014), 62127 states have internal predecessors, (84014), 0 states have call successors, (0), 0 states 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:03:02,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62128 states to 62128 states and 84014 transitions. [2025-03-03 15:03:02,521 INFO L78 Accepts]: Start accepts. Automaton has 62128 states and 84014 transitions. Word has length 176 [2025-03-03 15:03:02,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:02,522 INFO L471 AbstractCegarLoop]: Abstraction has 62128 states and 84014 transitions. [2025-03-03 15:03:02,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.538461538461538) internal successors, (176), 13 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:03:02,522 INFO L276 IsEmpty]: Start isEmpty. Operand 62128 states and 84014 transitions. [2025-03-03 15:03:02,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 15:03:02,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:02,553 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:03:02,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-03 15:03:02,553 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:03:02,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:02,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1859934194, now seen corresponding path program 1 times [2025-03-03 15:03:02,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:02,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940659734] [2025-03-03 15:03:02,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:02,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:02,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 15:03:02,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 15:03:02,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:02,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:04,084 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:03:04,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:04,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940659734] [2025-03-03 15:03:04,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940659734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:04,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:04,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-03-03 15:03:04,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301554208] [2025-03-03 15:03:04,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:04,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 15:03:04,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:04,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 15:03:04,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2025-03-03 15:03:04,086 INFO L87 Difference]: Start difference. First operand 62128 states and 84014 transitions. Second operand has 22 states, 22 states have (on average 8.0) internal successors, (176), 22 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:03:09,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:09,365 INFO L93 Difference]: Finished difference Result 222644 states and 322351 transitions. [2025-03-03 15:03:09,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-03-03 15:03:09,365 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 8.0) internal successors, (176), 22 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:03:09,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:09,684 INFO L225 Difference]: With dead ends: 222644 [2025-03-03 15:03:09,684 INFO L226 Difference]: Without dead ends: 213566 [2025-03-03 15:03:09,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 896 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=891, Invalid=3531, Unknown=0, NotChecked=0, Total=4422 [2025-03-03 15:03:09,736 INFO L435 NwaCegarLoop]: 773 mSDtfsCounter, 8153 mSDsluCounter, 13281 mSDsCounter, 0 mSdLazyCounter, 4756 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8153 SdHoareTripleChecker+Valid, 14054 SdHoareTripleChecker+Invalid, 4893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 4756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:09,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8153 Valid, 14054 Invalid, 4893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 4756 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 15:03:09,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213566 states. [2025-03-03 15:03:11,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213566 to 63392. [2025-03-03 15:03:11,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63392 states, 63391 states have (on average 1.3486141565837422) internal successors, (85490), 63391 states have internal predecessors, (85490), 0 states have call successors, (0), 0 states 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:03:11,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63392 states to 63392 states and 85490 transitions. [2025-03-03 15:03:11,848 INFO L78 Accepts]: Start accepts. Automaton has 63392 states and 85490 transitions. Word has length 176 [2025-03-03 15:03:11,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:11,848 INFO L471 AbstractCegarLoop]: Abstraction has 63392 states and 85490 transitions. [2025-03-03 15:03:11,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 8.0) internal successors, (176), 22 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:03:11,848 INFO L276 IsEmpty]: Start isEmpty. Operand 63392 states and 85490 transitions. [2025-03-03 15:03:11,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 15:03:11,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:11,873 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:03:11,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 15:03:11,873 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:03:11,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:11,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1890194127, now seen corresponding path program 1 times [2025-03-03 15:03:11,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:11,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256589969] [2025-03-03 15:03:11,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:11,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:11,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 15:03:11,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 15:03:11,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:11,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:12,071 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:03:12,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:12,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256589969] [2025-03-03 15:03:12,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256589969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:12,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:12,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:03:12,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512561520] [2025-03-03 15:03:12,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:12,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:03:12,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:12,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:03:12,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:03:12,072 INFO L87 Difference]: Start difference. First operand 63392 states and 85490 transitions. Second operand has 10 states, 10 states have (on average 17.6) internal successors, (176), 9 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:03:12,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:12,382 INFO L93 Difference]: Finished difference Result 122478 states and 165854 transitions. [2025-03-03 15:03:12,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:03:12,383 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.6) internal successors, (176), 9 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:03:12,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:12,463 INFO L225 Difference]: With dead ends: 122478 [2025-03-03 15:03:12,463 INFO L226 Difference]: Without dead ends: 63392 [2025-03-03 15:03:12,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:03:12,509 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 2109 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2109 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:12,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2109 Valid, 610 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:03:12,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63392 states. [2025-03-03 15:03:13,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63392 to 63392. [2025-03-03 15:03:13,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63392 states, 63391 states have (on average 1.3293054219053178) internal successors, (84266), 63391 states have internal predecessors, (84266), 0 states have call successors, (0), 0 states 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:03:13,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63392 states to 63392 states and 84266 transitions. [2025-03-03 15:03:13,259 INFO L78 Accepts]: Start accepts. Automaton has 63392 states and 84266 transitions. Word has length 176 [2025-03-03 15:03:13,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:13,259 INFO L471 AbstractCegarLoop]: Abstraction has 63392 states and 84266 transitions. [2025-03-03 15:03:13,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.6) internal successors, (176), 9 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:03:13,259 INFO L276 IsEmpty]: Start isEmpty. Operand 63392 states and 84266 transitions. [2025-03-03 15:03:13,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 15:03:13,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:13,285 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:03:13,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 15:03:13,285 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:03:13,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:13,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1833994510, now seen corresponding path program 1 times [2025-03-03 15:03:13,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:13,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600321480] [2025-03-03 15:03:13,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:13,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:13,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 15:03:13,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 15:03:13,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:13,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:14,137 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:03:14,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:14,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600321480] [2025-03-03 15:03:14,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600321480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:14,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:14,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 15:03:14,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276172941] [2025-03-03 15:03:14,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:14,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 15:03:14,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:14,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 15:03:14,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2025-03-03 15:03:14,138 INFO L87 Difference]: Start difference. First operand 63392 states and 84266 transitions. Second operand has 16 states, 16 states have (on average 11.0) internal successors, (176), 16 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:03:15,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:15,351 INFO L93 Difference]: Finished difference Result 112975 states and 154637 transitions. [2025-03-03 15:03:15,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-03 15:03:15,351 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 11.0) internal successors, (176), 16 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:03:15,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:15,492 INFO L225 Difference]: With dead ends: 112975 [2025-03-03 15:03:15,492 INFO L226 Difference]: Without dead ends: 98996 [2025-03-03 15:03:15,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=439, Invalid=1201, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 15:03:15,537 INFO L435 NwaCegarLoop]: 772 mSDtfsCounter, 3353 mSDsluCounter, 6584 mSDsCounter, 0 mSdLazyCounter, 1415 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3353 SdHoareTripleChecker+Valid, 7356 SdHoareTripleChecker+Invalid, 1501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:15,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3353 Valid, 7356 Invalid, 1501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1415 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:03:15,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98996 states. [2025-03-03 15:03:16,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98996 to 66428. [2025-03-03 15:03:16,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66428 states, 66427 states have (on average 1.3213903984825448) internal successors, (87776), 66427 states have internal predecessors, (87776), 0 states have call successors, (0), 0 states 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:03:16,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66428 states to 66428 states and 87776 transitions. [2025-03-03 15:03:16,834 INFO L78 Accepts]: Start accepts. Automaton has 66428 states and 87776 transitions. Word has length 176 [2025-03-03 15:03:16,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:16,834 INFO L471 AbstractCegarLoop]: Abstraction has 66428 states and 87776 transitions. [2025-03-03 15:03:16,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.0) internal successors, (176), 16 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:03:16,835 INFO L276 IsEmpty]: Start isEmpty. Operand 66428 states and 87776 transitions. [2025-03-03 15:03:16,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 15:03:16,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:16,869 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:16,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-03 15:03:16,869 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:03:16,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:16,869 INFO L85 PathProgramCache]: Analyzing trace with hash 826273462, now seen corresponding path program 1 times [2025-03-03 15:03:16,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:16,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307076846] [2025-03-03 15:03:16,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:16,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:16,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 15:03:16,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 15:03:16,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:16,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:17,474 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:03:17,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:17,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307076846] [2025-03-03 15:03:17,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307076846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:17,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:17,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 15:03:17,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091903818] [2025-03-03 15:03:17,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:17,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 15:03:17,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:17,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 15:03:17,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2025-03-03 15:03:17,475 INFO L87 Difference]: Start difference. First operand 66428 states and 87776 transitions. Second operand has 16 states, 16 states have (on average 11.0) internal successors, (176), 16 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:03:18,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:18,574 INFO L93 Difference]: Finished difference Result 153364 states and 210807 transitions. [2025-03-03 15:03:18,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 15:03:18,575 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 11.0) internal successors, (176), 16 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:03:18,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:18,765 INFO L225 Difference]: With dead ends: 153364 [2025-03-03 15:03:18,765 INFO L226 Difference]: Without dead ends: 139393 [2025-03-03 15:03:18,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=272, Invalid=850, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 15:03:18,819 INFO L435 NwaCegarLoop]: 722 mSDtfsCounter, 3997 mSDsluCounter, 6270 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3997 SdHoareTripleChecker+Valid, 6992 SdHoareTripleChecker+Invalid, 1356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:18,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3997 Valid, 6992 Invalid, 1356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1311 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:03:19,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139393 states. [2025-03-03 15:03:20,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139393 to 70408. [2025-03-03 15:03:20,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70408 states, 70407 states have (on average 1.3111622423906715) internal successors, (92315), 70407 states have internal predecessors, (92315), 0 states have call successors, (0), 0 states 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:03:20,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70408 states to 70408 states and 92315 transitions. [2025-03-03 15:03:20,346 INFO L78 Accepts]: Start accepts. Automaton has 70408 states and 92315 transitions. Word has length 176 [2025-03-03 15:03:20,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:20,347 INFO L471 AbstractCegarLoop]: Abstraction has 70408 states and 92315 transitions. [2025-03-03 15:03:20,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.0) internal successors, (176), 16 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:03:20,347 INFO L276 IsEmpty]: Start isEmpty. Operand 70408 states and 92315 transitions. [2025-03-03 15:03:20,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 15:03:20,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:20,375 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:03:20,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-03 15:03:20,375 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:03:20,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:20,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1206941426, now seen corresponding path program 1 times [2025-03-03 15:03:20,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:20,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528748890] [2025-03-03 15:03:20,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:20,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:20,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 15:03:20,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 15:03:20,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:20,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:20,976 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:03:20,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:20,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528748890] [2025-03-03 15:03:20,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528748890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:20,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:20,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 15:03:20,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487018683] [2025-03-03 15:03:20,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:20,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 15:03:20,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:20,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 15:03:20,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2025-03-03 15:03:20,978 INFO L87 Difference]: Start difference. First operand 70408 states and 92315 transitions. Second operand has 16 states, 16 states have (on average 11.0) internal successors, (176), 16 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)