./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b4e579e156345915e1fde26fcd53bce80a36e2067cd5c9341971cdf8691491e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:20:48,210 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:20:48,263 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:20:48,267 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:20:48,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:20:48,288 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:20:48,289 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:20:48,289 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:20:48,289 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:20:48,289 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:20:48,289 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:20:48,289 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:20:48,290 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:20:48,290 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:20:48,290 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:20:48,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:20:48,290 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:20:48,290 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:20:48,290 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:20:48,290 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:20:48,290 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:20:48,290 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:20:48,290 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:20:48,290 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:20:48,290 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:20:48,290 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:20:48,290 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:20:48,290 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:20:48,290 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:20:48,291 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:20:48,291 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:20:48,291 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:20:48,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:20:48,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:20:48,293 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:20:48,293 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:20:48,293 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:20:48,293 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:20:48,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:20:48,293 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:20:48,293 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:20:48,293 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:20:48,293 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:20:48,293 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 -> 2b4e579e156345915e1fde26fcd53bce80a36e2067cd5c9341971cdf8691491e [2025-03-16 19:20:48,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:20:48,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:20:48,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:20:48,534 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:20:48,534 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:20:48,535 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2025-03-16 19:20:49,729 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78324ea9f/c4ee91d7538f441682d6296a803e388b/FLAGb252f5e17 [2025-03-16 19:20:50,003 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:20:50,004 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2025-03-16 19:20:50,014 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78324ea9f/c4ee91d7538f441682d6296a803e388b/FLAGb252f5e17 [2025-03-16 19:20:50,024 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78324ea9f/c4ee91d7538f441682d6296a803e388b [2025-03-16 19:20:50,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:20:50,028 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:20:50,029 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:20:50,029 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:20:50,032 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:20:50,033 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:20:50" (1/1) ... [2025-03-16 19:20:50,034 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4db9aec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:50, skipping insertion in model container [2025-03-16 19:20:50,034 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:20:50" (1/1) ... [2025-03-16 19:20:50,072 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:20:50,283 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c[12498,12511] [2025-03-16 19:20:50,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:20:50,370 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:20:50,430 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c[12498,12511] [2025-03-16 19:20:50,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:20:50,480 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:20:50,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:50 WrapperNode [2025-03-16 19:20:50,480 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:20:50,482 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:20:50,482 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:20:50,482 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:20:50,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:50" (1/1) ... [2025-03-16 19:20:50,497 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:50" (1/1) ... [2025-03-16 19:20:50,535 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1327 [2025-03-16 19:20:50,536 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:20:50,536 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:20:50,536 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:20:50,536 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:20:50,543 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:50" (1/1) ... [2025-03-16 19:20:50,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:50" (1/1) ... [2025-03-16 19:20:50,548 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:50" (1/1) ... [2025-03-16 19:20:50,579 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 19:20:50,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:50" (1/1) ... [2025-03-16 19:20:50,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:50" (1/1) ... [2025-03-16 19:20:50,591 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:50" (1/1) ... [2025-03-16 19:20:50,594 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:50" (1/1) ... [2025-03-16 19:20:50,600 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:50" (1/1) ... [2025-03-16 19:20:50,607 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:50" (1/1) ... [2025-03-16 19:20:50,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:20:50,620 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:20:50,620 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:20:50,620 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:20:50,623 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:50" (1/1) ... [2025-03-16 19:20:50,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:20:50,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:20:50,650 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:20:50,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:20:50,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:20:50,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:20:50,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:20:50,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:20:50,784 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:20:50,785 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:20:51,688 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1096: havoc main_~node2____CPAchecker_TMP_2~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-16 19:20:51,688 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235: havoc main_~node1____CPAchecker_TMP_2~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-16 19:20:51,688 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L818: havoc main_~node4____CPAchecker_TMP_2~0#1;havoc main_~node4____CPAchecker_TMP_1~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-16 19:20:51,688 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L158: havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r141~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r241~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r341~0#1, main_~init__r411~0#1, main_~init__r421~0#1, main_~init__r431~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r142~0#1, main_~init__tmp___1~0#1, main_~init__r212~0#1, main_~init__tmp___2~0#1, main_~init__r232~0#1, main_~init__tmp___3~0#1, main_~init__r242~0#1, main_~init__tmp___4~0#1, main_~init__r312~0#1, main_~init__tmp___5~0#1, main_~init__r322~0#1, main_~init__tmp___6~0#1, main_~init__r342~0#1, main_~init__tmp___7~0#1, main_~init__r412~0#1, main_~init__tmp___8~0#1, main_~init__r422~0#1, main_~init__tmp___9~0#1, main_~init__r432~0#1, main_~init__tmp___10~0#1, main_~init__r123~0#1, main_~init__tmp___11~0#1, main_~init__r133~0#1, main_~init__tmp___12~0#1, main_~init__r143~0#1, main_~init__tmp___13~0#1, main_~init__r213~0#1, main_~init__tmp___14~0#1, main_~init__r233~0#1, main_~init__tmp___15~0#1, main_~init__r243~0#1, main_~init__tmp___16~0#1, main_~init__r313~0#1, main_~init__tmp___17~0#1, main_~init__r323~0#1, main_~init__tmp___18~0#1, main_~init__r343~0#1, main_~init__tmp___19~0#1, main_~init__r413~0#1, main_~init__tmp___20~0#1, main_~init__r423~0#1, main_~init__tmp___21~0#1, main_~init__r433~0#1, main_~init__tmp___22~0#1, main_~init__tmp___23~0#1; [2025-03-16 19:20:51,688 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L659: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-16 19:20:51,688 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L957: havoc main_~node3____CPAchecker_TMP_2~0#1;havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-16 19:20:51,758 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2025-03-16 19:20:51,758 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:20:51,773 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:20:51,773 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:20:51,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:20:51 BoogieIcfgContainer [2025-03-16 19:20:51,776 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:20:51,778 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:20:51,778 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:20:51,782 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:20:51,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:20:50" (1/3) ... [2025-03-16 19:20:51,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@595b216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:20:51, skipping insertion in model container [2025-03-16 19:20:51,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:20:50" (2/3) ... [2025-03-16 19:20:51,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@595b216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:20:51, skipping insertion in model container [2025-03-16 19:20:51,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:20:51" (3/3) ... [2025-03-16 19:20:51,785 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2025-03-16 19:20:51,797 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:20:51,801 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c that has 1 procedures, 306 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 19:20:51,858 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:20:51,867 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;@ee604d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:20:51,868 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:20:51,873 INFO L276 IsEmpty]: Start isEmpty. Operand has 306 states, 304 states have (on average 1.799342105263158) internal successors, (547), 305 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:51,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 19:20:51,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:51,884 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] [2025-03-16 19:20:51,884 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:51,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:51,887 INFO L85 PathProgramCache]: Analyzing trace with hash -378722766, now seen corresponding path program 1 times [2025-03-16 19:20:51,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:51,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776746134] [2025-03-16 19:20:51,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:51,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:51,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 19:20:52,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 19:20:52,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:52,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:52,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:52,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:52,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776746134] [2025-03-16 19:20:52,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776746134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:52,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:52,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:52,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302153383] [2025-03-16 19:20:52,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:52,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:52,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:52,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:52,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:52,435 INFO L87 Difference]: Start difference. First operand has 306 states, 304 states have (on average 1.799342105263158) internal successors, (547), 305 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:52,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:52,541 INFO L93 Difference]: Finished difference Result 555 states and 966 transitions. [2025-03-16 19:20:52,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:52,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2025-03-16 19:20:52,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:52,553 INFO L225 Difference]: With dead ends: 555 [2025-03-16 19:20:52,554 INFO L226 Difference]: Without dead ends: 419 [2025-03-16 19:20:52,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-16 19:20:52,561 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 210 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:52,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 1193 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:20:52,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-03-16 19:20:52,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 417. [2025-03-16 19:20:52,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 1.6850961538461537) internal successors, (701), 416 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:52,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 701 transitions. [2025-03-16 19:20:52,620 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 701 transitions. Word has length 98 [2025-03-16 19:20:52,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:52,621 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 701 transitions. [2025-03-16 19:20:52,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:52,621 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 701 transitions. [2025-03-16 19:20:52,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:20:52,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:52,626 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] [2025-03-16 19:20:52,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:20:52,627 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:52,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:52,627 INFO L85 PathProgramCache]: Analyzing trace with hash -866538424, now seen corresponding path program 1 times [2025-03-16 19:20:52,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:52,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862095003] [2025-03-16 19:20:52,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:52,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:52,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:20:52,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:20:52,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:52,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:52,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:52,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:52,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862095003] [2025-03-16 19:20:52,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862095003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:52,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:52,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:52,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490552761] [2025-03-16 19:20:52,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:52,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:52,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:52,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:52,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:52,856 INFO L87 Difference]: Start difference. First operand 417 states and 701 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:52,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:52,898 INFO L93 Difference]: Finished difference Result 647 states and 1092 transitions. [2025-03-16 19:20:52,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:52,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2025-03-16 19:20:52,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:52,902 INFO L225 Difference]: With dead ends: 647 [2025-03-16 19:20:52,902 INFO L226 Difference]: Without dead ends: 520 [2025-03-16 19:20:52,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:52,904 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 196 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:52,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1148 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:52,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-03-16 19:20:52,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 518. [2025-03-16 19:20:52,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 517 states have (on average 1.688588007736944) internal successors, (873), 517 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:52,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 873 transitions. [2025-03-16 19:20:52,931 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 873 transitions. Word has length 101 [2025-03-16 19:20:52,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:52,932 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 873 transitions. [2025-03-16 19:20:52,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:52,932 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 873 transitions. [2025-03-16 19:20:52,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:20:52,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:52,934 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] [2025-03-16 19:20:52,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:20:52,934 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:52,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:52,935 INFO L85 PathProgramCache]: Analyzing trace with hash -2006070532, now seen corresponding path program 1 times [2025-03-16 19:20:52,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:52,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683686439] [2025-03-16 19:20:52,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:52,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:52,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:20:53,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:20:53,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:53,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:53,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:53,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:53,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683686439] [2025-03-16 19:20:53,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683686439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:53,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:53,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:53,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590328365] [2025-03-16 19:20:53,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:53,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:53,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:53,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:53,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:53,100 INFO L87 Difference]: Start difference. First operand 518 states and 873 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:53,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:53,128 INFO L93 Difference]: Finished difference Result 1171 states and 1972 transitions. [2025-03-16 19:20:53,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:53,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2025-03-16 19:20:53,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:53,132 INFO L225 Difference]: With dead ends: 1171 [2025-03-16 19:20:53,132 INFO L226 Difference]: Without dead ends: 831 [2025-03-16 19:20:53,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:53,133 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 189 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:53,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 1005 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:53,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2025-03-16 19:20:53,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 829. [2025-03-16 19:20:53,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 828 states have (on average 1.682367149758454) internal successors, (1393), 828 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:53,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1393 transitions. [2025-03-16 19:20:53,159 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1393 transitions. Word has length 101 [2025-03-16 19:20:53,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:53,161 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1393 transitions. [2025-03-16 19:20:53,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:53,162 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1393 transitions. [2025-03-16 19:20:53,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 19:20:53,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:53,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] [2025-03-16 19:20:53,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:20:53,164 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:53,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:53,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1786391166, now seen corresponding path program 1 times [2025-03-16 19:20:53,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:53,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506871776] [2025-03-16 19:20:53,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:53,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:53,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 19:20:53,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 19:20:53,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:53,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:53,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:53,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:53,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506871776] [2025-03-16 19:20:53,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506871776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:53,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:53,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:53,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760499854] [2025-03-16 19:20:53,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:53,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:53,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:53,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:53,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:53,334 INFO L87 Difference]: Start difference. First operand 829 states and 1393 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:53,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:53,369 INFO L93 Difference]: Finished difference Result 2077 states and 3481 transitions. [2025-03-16 19:20:53,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:53,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2025-03-16 19:20:53,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:53,377 INFO L225 Difference]: With dead ends: 2077 [2025-03-16 19:20:53,377 INFO L226 Difference]: Without dead ends: 1426 [2025-03-16 19:20:53,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:53,381 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 183 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:53,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1006 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:53,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2025-03-16 19:20:53,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1424. [2025-03-16 19:20:53,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1424 states, 1423 states have (on average 1.6718200983836964) internal successors, (2379), 1423 states have internal predecessors, (2379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:53,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1424 states and 2379 transitions. [2025-03-16 19:20:53,437 INFO L78 Accepts]: Start accepts. Automaton has 1424 states and 2379 transitions. Word has length 104 [2025-03-16 19:20:53,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:53,439 INFO L471 AbstractCegarLoop]: Abstraction has 1424 states and 2379 transitions. [2025-03-16 19:20:53,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:53,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 2379 transitions. [2025-03-16 19:20:53,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 19:20:53,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:53,440 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] [2025-03-16 19:20:53,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:20:53,440 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:53,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:53,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1102479696, now seen corresponding path program 1 times [2025-03-16 19:20:53,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:53,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813281124] [2025-03-16 19:20:53,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:53,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:53,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 19:20:53,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 19:20:53,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:53,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:53,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:53,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:53,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813281124] [2025-03-16 19:20:53,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813281124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:53,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:53,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:53,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285630654] [2025-03-16 19:20:53,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:53,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:53,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:53,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:53,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:53,574 INFO L87 Difference]: Start difference. First operand 1424 states and 2379 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:53,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:53,608 INFO L93 Difference]: Finished difference Result 3808 states and 6337 transitions. [2025-03-16 19:20:53,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:53,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2025-03-16 19:20:53,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:53,617 INFO L225 Difference]: With dead ends: 3808 [2025-03-16 19:20:53,618 INFO L226 Difference]: Without dead ends: 2562 [2025-03-16 19:20:53,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:53,621 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 177 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:53,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1007 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:53,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2025-03-16 19:20:53,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 2560. [2025-03-16 19:20:53,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2560 states, 2559 states have (on average 1.6580695584212584) internal successors, (4243), 2559 states have internal predecessors, (4243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:53,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 4243 transitions. [2025-03-16 19:20:53,667 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 4243 transitions. Word has length 107 [2025-03-16 19:20:53,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:53,668 INFO L471 AbstractCegarLoop]: Abstraction has 2560 states and 4243 transitions. [2025-03-16 19:20:53,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:53,668 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 4243 transitions. [2025-03-16 19:20:53,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 19:20:53,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:53,671 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:20:53,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:20:53,671 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:53,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:53,671 INFO L85 PathProgramCache]: Analyzing trace with hash -284791094, now seen corresponding path program 1 times [2025-03-16 19:20:53,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:53,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161076216] [2025-03-16 19:20:53,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:53,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:53,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:20:53,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:20:53,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:53,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:53,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:53,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:53,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161076216] [2025-03-16 19:20:53,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161076216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:53,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:53,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:20:53,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690555474] [2025-03-16 19:20:53,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:53,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:20:53,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:53,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:20:53,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:20:53,886 INFO L87 Difference]: Start difference. First operand 2560 states and 4243 transitions. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:54,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:54,145 INFO L93 Difference]: Finished difference Result 14280 states and 23831 transitions. [2025-03-16 19:20:54,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:20:54,146 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-16 19:20:54,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:54,183 INFO L225 Difference]: With dead ends: 14280 [2025-03-16 19:20:54,184 INFO L226 Difference]: Without dead ends: 11898 [2025-03-16 19:20:54,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:20:54,194 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 2342 mSDsluCounter, 2804 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2342 SdHoareTripleChecker+Valid, 3329 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:54,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2342 Valid, 3329 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:20:54,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11898 states. [2025-03-16 19:20:54,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11898 to 4825. [2025-03-16 19:20:54,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4825 states, 4824 states have (on average 1.6536069651741294) internal successors, (7977), 4824 states have internal predecessors, (7977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:54,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4825 states to 4825 states and 7977 transitions. [2025-03-16 19:20:54,373 INFO L78 Accepts]: Start accepts. Automaton has 4825 states and 7977 transitions. Word has length 110 [2025-03-16 19:20:54,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:54,373 INFO L471 AbstractCegarLoop]: Abstraction has 4825 states and 7977 transitions. [2025-03-16 19:20:54,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:54,373 INFO L276 IsEmpty]: Start isEmpty. Operand 4825 states and 7977 transitions. [2025-03-16 19:20:54,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:20:54,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:54,378 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] [2025-03-16 19:20:54,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:20:54,379 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:54,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:54,379 INFO L85 PathProgramCache]: Analyzing trace with hash -236621064, now seen corresponding path program 1 times [2025-03-16 19:20:54,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:54,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124840041] [2025-03-16 19:20:54,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:54,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:54,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:20:54,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:20:54,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:54,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:54,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:54,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:54,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124840041] [2025-03-16 19:20:54,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124840041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:54,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:54,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:20:54,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919454255] [2025-03-16 19:20:54,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:54,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:20:54,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:54,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:20:54,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:54,499 INFO L87 Difference]: Start difference. First operand 4825 states and 7977 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:54,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:54,636 INFO L93 Difference]: Finished difference Result 15440 states and 25632 transitions. [2025-03-16 19:20:54,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:20:54,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2025-03-16 19:20:54,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:54,672 INFO L225 Difference]: With dead ends: 15440 [2025-03-16 19:20:54,672 INFO L226 Difference]: Without dead ends: 10793 [2025-03-16 19:20:54,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:20:54,682 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 624 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 1679 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:54,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 1679 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:20:54,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10793 states. [2025-03-16 19:20:54,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10793 to 7792. [2025-03-16 19:20:54,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7792 states, 7791 states have (on average 1.6543447567706329) internal successors, (12889), 7791 states have internal predecessors, (12889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:54,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7792 states to 7792 states and 12889 transitions. [2025-03-16 19:20:54,877 INFO L78 Accepts]: Start accepts. Automaton has 7792 states and 12889 transitions. Word has length 111 [2025-03-16 19:20:54,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:54,877 INFO L471 AbstractCegarLoop]: Abstraction has 7792 states and 12889 transitions. [2025-03-16 19:20:54,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:54,877 INFO L276 IsEmpty]: Start isEmpty. Operand 7792 states and 12889 transitions. [2025-03-16 19:20:54,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:20:54,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:54,879 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] [2025-03-16 19:20:54,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:20:54,879 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:54,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:54,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1821692772, now seen corresponding path program 1 times [2025-03-16 19:20:54,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:54,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212043949] [2025-03-16 19:20:54,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:54,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:54,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:20:54,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:20:54,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:54,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:54,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-16 19:20:54,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:54,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212043949] [2025-03-16 19:20:54,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212043949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:54,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:54,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:54,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606941010] [2025-03-16 19:20:54,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:54,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:54,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:54,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:54,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:54,982 INFO L87 Difference]: Start difference. First operand 7792 states and 12889 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:55,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:55,042 INFO L93 Difference]: Finished difference Result 15114 states and 25065 transitions. [2025-03-16 19:20:55,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:55,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2025-03-16 19:20:55,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:55,063 INFO L225 Difference]: With dead ends: 15114 [2025-03-16 19:20:55,063 INFO L226 Difference]: Without dead ends: 11000 [2025-03-16 19:20:55,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:55,072 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 178 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:55,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 1042 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:55,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11000 states. [2025-03-16 19:20:55,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11000 to 10998. [2025-03-16 19:20:55,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10998 states, 10997 states have (on average 1.651359461671365) internal successors, (18160), 10997 states have internal predecessors, (18160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:55,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10998 states to 10998 states and 18160 transitions. [2025-03-16 19:20:55,249 INFO L78 Accepts]: Start accepts. Automaton has 10998 states and 18160 transitions. Word has length 111 [2025-03-16 19:20:55,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:55,249 INFO L471 AbstractCegarLoop]: Abstraction has 10998 states and 18160 transitions. [2025-03-16 19:20:55,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:55,249 INFO L276 IsEmpty]: Start isEmpty. Operand 10998 states and 18160 transitions. [2025-03-16 19:20:55,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:20:55,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:55,251 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:20:55,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:20:55,251 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:55,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:55,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1829765872, now seen corresponding path program 1 times [2025-03-16 19:20:55,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:55,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010813588] [2025-03-16 19:20:55,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:55,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:55,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:20:55,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:20:55,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:55,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:55,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:55,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:55,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010813588] [2025-03-16 19:20:55,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010813588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:55,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:55,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:55,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729388482] [2025-03-16 19:20:55,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:55,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:55,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:55,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:55,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:55,331 INFO L87 Difference]: Start difference. First operand 10998 states and 18160 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:55,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:55,387 INFO L93 Difference]: Finished difference Result 20918 states and 34650 transitions. [2025-03-16 19:20:55,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:55,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2025-03-16 19:20:55,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:55,473 INFO L225 Difference]: With dead ends: 20918 [2025-03-16 19:20:55,473 INFO L226 Difference]: Without dead ends: 15146 [2025-03-16 19:20:55,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:55,478 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 184 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:55,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 1086 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:55,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15146 states. [2025-03-16 19:20:55,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15146 to 15144. [2025-03-16 19:20:55,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15144 states, 15143 states have (on average 1.6486165224856368) internal successors, (24965), 15143 states have internal predecessors, (24965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:55,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15144 states to 15144 states and 24965 transitions. [2025-03-16 19:20:55,728 INFO L78 Accepts]: Start accepts. Automaton has 15144 states and 24965 transitions. Word has length 111 [2025-03-16 19:20:55,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:55,728 INFO L471 AbstractCegarLoop]: Abstraction has 15144 states and 24965 transitions. [2025-03-16 19:20:55,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:55,729 INFO L276 IsEmpty]: Start isEmpty. Operand 15144 states and 24965 transitions. [2025-03-16 19:20:55,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:20:55,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:55,730 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] [2025-03-16 19:20:55,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:20:55,730 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:55,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:55,731 INFO L85 PathProgramCache]: Analyzing trace with hash 403986812, now seen corresponding path program 1 times [2025-03-16 19:20:55,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:55,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288655079] [2025-03-16 19:20:55,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:55,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:55,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:20:55,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:20:55,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:55,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:55,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:55,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288655079] [2025-03-16 19:20:55,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288655079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:55,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:55,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:20:55,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220009610] [2025-03-16 19:20:55,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:55,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:20:55,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:55,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:20:55,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:55,833 INFO L87 Difference]: Start difference. First operand 15144 states and 24965 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:55,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:55,929 INFO L93 Difference]: Finished difference Result 28732 states and 47539 transitions. [2025-03-16 19:20:55,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:20:55,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2025-03-16 19:20:55,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:55,969 INFO L225 Difference]: With dead ends: 28732 [2025-03-16 19:20:55,969 INFO L226 Difference]: Without dead ends: 20720 [2025-03-16 19:20:55,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:20:55,986 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 190 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:55,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 1130 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:56,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20720 states. [2025-03-16 19:20:56,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20720 to 20718. [2025-03-16 19:20:56,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20718 states, 20717 states have (on average 1.6462808321668194) internal successors, (34106), 20717 states have internal predecessors, (34106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:56,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20718 states to 20718 states and 34106 transitions. [2025-03-16 19:20:56,347 INFO L78 Accepts]: Start accepts. Automaton has 20718 states and 34106 transitions. Word has length 111 [2025-03-16 19:20:56,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:56,348 INFO L471 AbstractCegarLoop]: Abstraction has 20718 states and 34106 transitions. [2025-03-16 19:20:56,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:56,348 INFO L276 IsEmpty]: Start isEmpty. Operand 20718 states and 34106 transitions. [2025-03-16 19:20:56,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:20:56,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:56,349 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:20:56,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:20:56,349 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:56,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:56,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1256560493, now seen corresponding path program 1 times [2025-03-16 19:20:56,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:56,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51547247] [2025-03-16 19:20:56,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:56,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:56,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:20:56,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:20:56,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:56,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:56,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:56,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:56,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51547247] [2025-03-16 19:20:56,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51547247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:56,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:56,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:20:56,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216760352] [2025-03-16 19:20:56,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:56,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:20:56,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:56,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:20:56,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:56,508 INFO L87 Difference]: Start difference. First operand 20718 states and 34106 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:56,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:56,693 INFO L93 Difference]: Finished difference Result 67416 states and 111245 transitions. [2025-03-16 19:20:56,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:20:56,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-16 19:20:56,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:56,784 INFO L225 Difference]: With dead ends: 67416 [2025-03-16 19:20:56,784 INFO L226 Difference]: Without dead ends: 46930 [2025-03-16 19:20:56,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:20:56,823 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 622 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:56,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 1681 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:20:56,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46930 states. [2025-03-16 19:20:57,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46930 to 33735. [2025-03-16 19:20:57,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33735 states, 33734 states have (on average 1.6415485859963241) internal successors, (55376), 33734 states have internal predecessors, (55376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:57,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33735 states to 33735 states and 55376 transitions. [2025-03-16 19:20:57,386 INFO L78 Accepts]: Start accepts. Automaton has 33735 states and 55376 transitions. Word has length 112 [2025-03-16 19:20:57,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:57,387 INFO L471 AbstractCegarLoop]: Abstraction has 33735 states and 55376 transitions. [2025-03-16 19:20:57,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:57,387 INFO L276 IsEmpty]: Start isEmpty. Operand 33735 states and 55376 transitions. [2025-03-16 19:20:57,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 19:20:57,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:57,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] [2025-03-16 19:20:57,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:20:57,388 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:57,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:57,389 INFO L85 PathProgramCache]: Analyzing trace with hash 300459131, now seen corresponding path program 1 times [2025-03-16 19:20:57,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:57,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091215335] [2025-03-16 19:20:57,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:57,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:57,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 19:20:57,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 19:20:57,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:57,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:57,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:57,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:57,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091215335] [2025-03-16 19:20:57,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091215335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:57,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:57,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:20:57,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126478186] [2025-03-16 19:20:57,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:57,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:20:57,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:57,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:20:57,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:57,534 INFO L87 Difference]: Start difference. First operand 33735 states and 55376 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:57,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:57,920 INFO L93 Difference]: Finished difference Result 109310 states and 179861 transitions. [2025-03-16 19:20:57,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:20:57,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2025-03-16 19:20:57,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:20:58,047 INFO L225 Difference]: With dead ends: 109310 [2025-03-16 19:20:58,047 INFO L226 Difference]: Without dead ends: 75807 [2025-03-16 19:20:58,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:20:58,105 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 620 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 1683 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:20:58,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 1683 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:20:58,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75807 states. [2025-03-16 19:20:58,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75807 to 54628. [2025-03-16 19:20:59,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54628 states, 54627 states have (on average 1.6368096362604574) internal successors, (89414), 54627 states have internal predecessors, (89414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:59,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54628 states to 54628 states and 89414 transitions. [2025-03-16 19:20:59,138 INFO L78 Accepts]: Start accepts. Automaton has 54628 states and 89414 transitions. Word has length 113 [2025-03-16 19:20:59,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:20:59,138 INFO L471 AbstractCegarLoop]: Abstraction has 54628 states and 89414 transitions. [2025-03-16 19:20:59,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:59,139 INFO L276 IsEmpty]: Start isEmpty. Operand 54628 states and 89414 transitions. [2025-03-16 19:20:59,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-16 19:20:59,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:20:59,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:20:59,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:20:59,140 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:20:59,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:20:59,140 INFO L85 PathProgramCache]: Analyzing trace with hash 725998608, now seen corresponding path program 1 times [2025-03-16 19:20:59,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:20:59,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608592427] [2025-03-16 19:20:59,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:20:59,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:20:59,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-16 19:20:59,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-16 19:20:59,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:20:59,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:20:59,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:20:59,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:20:59,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608592427] [2025-03-16 19:20:59,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608592427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:20:59,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:20:59,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:20:59,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210683806] [2025-03-16 19:20:59,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:20:59,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:20:59,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:20:59,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:20:59,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:20:59,248 INFO L87 Difference]: Start difference. First operand 54628 states and 89414 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:20:59,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:20:59,916 INFO L93 Difference]: Finished difference Result 175036 states and 287173 transitions. [2025-03-16 19:20:59,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:20:59,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-16 19:20:59,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:00,131 INFO L225 Difference]: With dead ends: 175036 [2025-03-16 19:21:00,131 INFO L226 Difference]: Without dead ends: 120640 [2025-03-16 19:21:00,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:21:00,196 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 618 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:00,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 1685 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:21:00,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120640 states. [2025-03-16 19:21:01,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120640 to 87409. [2025-03-16 19:21:01,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87409 states, 87408 states have (on average 1.632116053450485) internal successors, (142660), 87408 states have internal predecessors, (142660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:01,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87409 states to 87409 states and 142660 transitions. [2025-03-16 19:21:01,794 INFO L78 Accepts]: Start accepts. Automaton has 87409 states and 142660 transitions. Word has length 114 [2025-03-16 19:21:01,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:01,795 INFO L471 AbstractCegarLoop]: Abstraction has 87409 states and 142660 transitions. [2025-03-16 19:21:01,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:01,795 INFO L276 IsEmpty]: Start isEmpty. Operand 87409 states and 142660 transitions. [2025-03-16 19:21:01,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-16 19:21:01,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:01,796 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:21:01,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:21:01,796 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:21:01,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:01,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1951445266, now seen corresponding path program 1 times [2025-03-16 19:21:01,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:01,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94122015] [2025-03-16 19:21:01,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:01,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:01,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 19:21:01,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 19:21:01,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:01,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:02,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:21:02,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:02,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94122015] [2025-03-16 19:21:02,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94122015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:02,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:02,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:21:02,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149361796] [2025-03-16 19:21:02,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:02,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:21:02,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:02,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:21:02,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:21:02,076 INFO L87 Difference]: Start difference. First operand 87409 states and 142660 transitions. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:02,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:02,883 INFO L93 Difference]: Finished difference Result 174588 states and 284942 transitions. [2025-03-16 19:21:02,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:21:02,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2025-03-16 19:21:02,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:03,001 INFO L225 Difference]: With dead ends: 174588 [2025-03-16 19:21:03,002 INFO L226 Difference]: Without dead ends: 87411 [2025-03-16 19:21:03,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:21:03,045 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 534 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 1946 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:03,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 1946 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:21:03,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87411 states. [2025-03-16 19:21:03,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87411 to 87409. [2025-03-16 19:21:03,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87409 states, 87408 states have (on average 1.6249656781987918) internal successors, (142035), 87408 states have internal predecessors, (142035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:04,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87409 states to 87409 states and 142035 transitions. [2025-03-16 19:21:04,100 INFO L78 Accepts]: Start accepts. Automaton has 87409 states and 142035 transitions. Word has length 116 [2025-03-16 19:21:04,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:04,100 INFO L471 AbstractCegarLoop]: Abstraction has 87409 states and 142035 transitions. [2025-03-16 19:21:04,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:04,100 INFO L276 IsEmpty]: Start isEmpty. Operand 87409 states and 142035 transitions. [2025-03-16 19:21:04,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-16 19:21:04,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:04,101 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] [2025-03-16 19:21:04,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:21:04,101 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:21:04,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:04,101 INFO L85 PathProgramCache]: Analyzing trace with hash 216188005, now seen corresponding path program 1 times [2025-03-16 19:21:04,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:04,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483128327] [2025-03-16 19:21:04,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:04,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:04,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-16 19:21:04,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-16 19:21:04,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:04,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:04,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:21:04,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:04,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483128327] [2025-03-16 19:21:04,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483128327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:04,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:04,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:21:04,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466286020] [2025-03-16 19:21:04,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:04,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:21:04,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:04,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:21:04,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:21:04,405 INFO L87 Difference]: Start difference. First operand 87409 states and 142035 transitions. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:05,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:05,216 INFO L93 Difference]: Finished difference Result 255482 states and 415610 transitions. [2025-03-16 19:21:05,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:21:05,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2025-03-16 19:21:05,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:05,481 INFO L225 Difference]: With dead ends: 255482 [2025-03-16 19:21:05,481 INFO L226 Difference]: Without dead ends: 168305 [2025-03-16 19:21:05,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:21:05,589 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 178 mSDsluCounter, 1944 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 2443 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:05,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 2443 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:21:05,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168305 states. [2025-03-16 19:21:07,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168305 to 168303. [2025-03-16 19:21:07,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168303 states, 168302 states have (on average 1.6157621418640302) internal successors, (271936), 168302 states have internal predecessors, (271936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:07,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168303 states to 168303 states and 271936 transitions. [2025-03-16 19:21:07,919 INFO L78 Accepts]: Start accepts. Automaton has 168303 states and 271936 transitions. Word has length 119 [2025-03-16 19:21:07,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:07,919 INFO L471 AbstractCegarLoop]: Abstraction has 168303 states and 271936 transitions. [2025-03-16 19:21:07,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:07,919 INFO L276 IsEmpty]: Start isEmpty. Operand 168303 states and 271936 transitions. [2025-03-16 19:21:07,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-16 19:21:07,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21: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] [2025-03-16 19:21:07,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:21:07,920 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:21:07,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:07,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1887151073, now seen corresponding path program 1 times [2025-03-16 19:21:07,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:07,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102888060] [2025-03-16 19:21:07,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:07,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:07,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-16 19:21:08,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-16 19:21:08,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:08,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:08,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:21:08,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:08,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102888060] [2025-03-16 19:21:08,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102888060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:08,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:08,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:21:08,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306085256] [2025-03-16 19:21:08,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:08,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:21:08,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:08,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:21:08,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:21:08,591 INFO L87 Difference]: Start difference. First operand 168303 states and 271936 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:09,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:09,012 INFO L93 Difference]: Finished difference Result 172177 states and 277745 transitions. [2025-03-16 19:21:09,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:21:09,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2025-03-16 19:21:09,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:09,512 INFO L225 Difference]: With dead ends: 172177 [2025-03-16 19:21:09,513 INFO L226 Difference]: Without dead ends: 172175 [2025-03-16 19:21:09,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:21:09,558 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 0 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2018 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:09,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2018 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:21:09,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172175 states. [2025-03-16 19:21:11,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172175 to 172175. [2025-03-16 19:21:11,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172175 states, 172174 states have (on average 1.6017575243648867) internal successors, (275781), 172174 states have internal predecessors, (275781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:11,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172175 states to 172175 states and 275781 transitions. [2025-03-16 19:21:11,648 INFO L78 Accepts]: Start accepts. Automaton has 172175 states and 275781 transitions. Word has length 120 [2025-03-16 19:21:11,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:11,649 INFO L471 AbstractCegarLoop]: Abstraction has 172175 states and 275781 transitions. [2025-03-16 19:21:11,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:11,649 INFO L276 IsEmpty]: Start isEmpty. Operand 172175 states and 275781 transitions. [2025-03-16 19:21:11,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-16 19:21:11,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:11,655 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:21:11,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:21:11,655 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:21:11,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:11,656 INFO L85 PathProgramCache]: Analyzing trace with hash 236281933, now seen corresponding path program 1 times [2025-03-16 19:21:11,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:11,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331792996] [2025-03-16 19:21:11,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:11,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:11,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-16 19:21:11,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-16 19:21:11,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:11,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:12,188 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:21:12,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:12,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331792996] [2025-03-16 19:21:12,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331792996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:12,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:12,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:21:12,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534749743] [2025-03-16 19:21:12,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:12,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:21:12,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:12,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:21:12,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:21:12,191 INFO L87 Difference]: Start difference. First operand 172175 states and 275781 transitions. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:13,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:13,646 INFO L93 Difference]: Finished difference Result 470351 states and 756234 transitions. [2025-03-16 19:21:13,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:21:13,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2025-03-16 19:21:13,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:14,428 INFO L225 Difference]: With dead ends: 470351 [2025-03-16 19:21:14,428 INFO L226 Difference]: Without dead ends: 393549 [2025-03-16 19:21:14,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:21:14,554 INFO L435 NwaCegarLoop]: 709 mSDtfsCounter, 1395 mSDsluCounter, 1811 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1395 SdHoareTripleChecker+Valid, 2520 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:14,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1395 Valid, 2520 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:21:14,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393549 states. [2025-03-16 19:21:18,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393549 to 276993. [2025-03-16 19:21:18,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276993 states, 276992 states have (on average 1.6000859230591498) internal successors, (443211), 276992 states have internal predecessors, (443211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:19,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276993 states to 276993 states and 443211 transitions. [2025-03-16 19:21:19,011 INFO L78 Accepts]: Start accepts. Automaton has 276993 states and 443211 transitions. Word has length 150 [2025-03-16 19:21:19,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:19,011 INFO L471 AbstractCegarLoop]: Abstraction has 276993 states and 443211 transitions. [2025-03-16 19:21:19,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:19,011 INFO L276 IsEmpty]: Start isEmpty. Operand 276993 states and 443211 transitions. [2025-03-16 19:21:19,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-16 19:21:19,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:19,017 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:21:19,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:21:19,018 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:21:19,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:19,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1813164299, now seen corresponding path program 1 times [2025-03-16 19:21:19,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:19,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479805313] [2025-03-16 19:21:19,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:19,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:19,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-16 19:21:19,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-16 19:21:19,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:19,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:19,557 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 19:21:19,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:19,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479805313] [2025-03-16 19:21:19,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479805313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:19,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:19,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:21:19,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110882424] [2025-03-16 19:21:19,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:19,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:21:19,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:19,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:21:19,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:21:19,560 INFO L87 Difference]: Start difference. First operand 276993 states and 443211 transitions. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:21,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:21,654 INFO L93 Difference]: Finished difference Result 529153 states and 850950 transitions. [2025-03-16 19:21:21,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:21:21,655 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2025-03-16 19:21:21,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:22,444 INFO L225 Difference]: With dead ends: 529153 [2025-03-16 19:21:22,445 INFO L226 Difference]: Without dead ends: 453501 [2025-03-16 19:21:22,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:21:22,517 INFO L435 NwaCegarLoop]: 715 mSDtfsCounter, 1402 mSDsluCounter, 2014 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1402 SdHoareTripleChecker+Valid, 2729 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:22,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1402 Valid, 2729 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:21:22,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453501 states. [2025-03-16 19:21:26,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453501 to 374609. [2025-03-16 19:21:26,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374609 states, 374608 states have (on average 1.6018584760603083) internal successors, (600069), 374608 states have internal predecessors, (600069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:27,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374609 states to 374609 states and 600069 transitions. [2025-03-16 19:21:27,932 INFO L78 Accepts]: Start accepts. Automaton has 374609 states and 600069 transitions. Word has length 150 [2025-03-16 19:21:27,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:21:27,933 INFO L471 AbstractCegarLoop]: Abstraction has 374609 states and 600069 transitions. [2025-03-16 19:21:27,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:27,933 INFO L276 IsEmpty]: Start isEmpty. Operand 374609 states and 600069 transitions. [2025-03-16 19:21:27,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-16 19:21:27,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:21:27,938 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:21:27,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:21:27,938 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:21:27,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:21:27,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1805091199, now seen corresponding path program 1 times [2025-03-16 19:21:27,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:21:27,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930881693] [2025-03-16 19:21:27,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:21:27,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:21:27,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-16 19:21:27,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-16 19:21:27,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:21:27,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:21:28,101 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 19:21:28,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:21:28,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930881693] [2025-03-16 19:21:28,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930881693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:21:28,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:21:28,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:21:28,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080601828] [2025-03-16 19:21:28,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:21:28,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:21:28,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:21:28,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:21:28,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:21:28,103 INFO L87 Difference]: Start difference. First operand 374609 states and 600069 transitions. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:21:29,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:21:29,918 INFO L93 Difference]: Finished difference Result 559173 states and 899290 transitions. [2025-03-16 19:21:29,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:21:29,918 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2025-03-16 19:21:29,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:21:30,797 INFO L225 Difference]: With dead ends: 559173 [2025-03-16 19:21:30,797 INFO L226 Difference]: Without dead ends: 483521 [2025-03-16 19:21:30,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:21:30,971 INFO L435 NwaCegarLoop]: 712 mSDtfsCounter, 1275 mSDsluCounter, 2136 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1275 SdHoareTripleChecker+Valid, 2848 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:21:30,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1275 Valid, 2848 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:21:31,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483521 states.