./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 742f5d2e7cf114f57c75e9ec70cbf1110245ef125564c2c81d93a290329b3301 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:19:46,414 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:19:46,461 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:19:46,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:19:46,469 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:19:46,488 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:19:46,490 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:19:46,490 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:19:46,490 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:19:46,490 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:19:46,491 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:19:46,491 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:19:46,491 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:19:46,491 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:19:46,492 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:19:46,492 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:19:46,492 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:19:46,492 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:19:46,492 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:19:46,492 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:19:46,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:19:46,492 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:19:46,492 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:19:46,493 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:19:46,493 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:19:46,493 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:19:46,493 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:19:46,493 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:19:46,493 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:19:46,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:19:46,493 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:19:46,493 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:19:46,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:19:46,494 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:19:46,494 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:19:46,494 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:19:46,494 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:19:46,494 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:19:46,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:19:46,494 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:19:46,494 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:19:46,494 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:19:46,494 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:19:46,494 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 -> 742f5d2e7cf114f57c75e9ec70cbf1110245ef125564c2c81d93a290329b3301 [2025-03-03 15:19:46,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:19:46,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:19:46,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:19:46,732 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:19:46,732 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:19:46,733 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-03 15:19:47,921 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ccb8a297/096406b06f83490db182b446d09df7e9/FLAG542b54aa0 [2025-03-03 15:19:48,170 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:19:48,170 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-03 15:19:48,188 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ccb8a297/096406b06f83490db182b446d09df7e9/FLAG542b54aa0 [2025-03-03 15:19:48,491 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ccb8a297/096406b06f83490db182b446d09df7e9 [2025-03-03 15:19:48,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:19:48,493 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:19:48,494 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:19:48,494 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:19:48,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:19:48,500 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:19:48" (1/1) ... [2025-03-03 15:19:48,500 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ca01079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:19:48, skipping insertion in model container [2025-03-03 15:19:48,500 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:19:48" (1/1) ... [2025-03-03 15:19:48,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:19:48,790 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_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[15866,15879] [2025-03-03 15:19:48,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:19:48,867 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:19:48,923 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_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[15866,15879] [2025-03-03 15:19:48,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:19:48,974 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:19:48,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:19:48 WrapperNode [2025-03-03 15:19:48,975 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:19:48,976 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:19:48,976 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:19:48,976 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:19:48,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:19:48" (1/1) ... [2025-03-03 15:19:48,991 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:19:48" (1/1) ... [2025-03-03 15:19:49,035 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1376 [2025-03-03 15:19:49,035 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:19:49,036 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:19:49,036 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:19:49,037 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:19:49,044 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:19:48" (1/1) ... [2025-03-03 15:19:49,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:19:48" (1/1) ... [2025-03-03 15:19:49,052 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:19:48" (1/1) ... [2025-03-03 15:19:49,068 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:19:49,072 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:19:48" (1/1) ... [2025-03-03 15:19:49,073 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:19:48" (1/1) ... [2025-03-03 15:19:49,084 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:19:48" (1/1) ... [2025-03-03 15:19:49,087 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:19:48" (1/1) ... [2025-03-03 15:19:49,093 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:19:48" (1/1) ... [2025-03-03 15:19:49,095 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:19:48" (1/1) ... [2025-03-03 15:19:49,104 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:19:49,105 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:19:49,105 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:19:49,105 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:19:49,106 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:19:48" (1/1) ... [2025-03-03 15:19:49,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:19:49,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:19:49,134 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:19:49,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:19:49,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:19:49,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:19:49,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:19:49,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:19:49,264 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:19:49,265 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:19:50,057 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1061: havoc main_~check__tmp~4#1; [2025-03-03 15:19:50,057 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1229: havoc main_~node3____CPAchecker_TMP_1~2#1;havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-03 15:19:50,057 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L938: havoc main_~node1__newmax~4#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1;havoc main_~node3__newmax~3#1;havoc main_~node2__newmax~3#1;havoc main_~node1__newmax~3#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1;havoc main_~node3____CPAchecker_TMP_1~1#1;havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node3__newmax~2#1;havoc main_~node2____CPAchecker_TMP_1~1#1;havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node2__newmax~2#1;havoc main_~node1____CPAchecker_TMP_1~1#1;havoc main_~node1____CPAchecker_TMP_0~1#1;havoc main_~node1__newmax~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~node3__newmax~1#1;havoc main_~node2__newmax~1#1;havoc main_~node1__newmax~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__newmax~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__newmax~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2025-03-03 15:19:50,057 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1469: havoc main_~node1____CPAchecker_TMP_1~2#1;havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-03-03 15:19:50,058 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L975: havoc main_~node2__newmax~4#1; [2025-03-03 15:19:50,058 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1012: havoc main_~node3__newmax~4#1; [2025-03-03 15:19:50,058 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1349: havoc main_~node2____CPAchecker_TMP_1~2#1;havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-03 15:19:50,120 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2025-03-03 15:19:50,120 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:19:50,137 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:19:50,139 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:19:50,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:19:50 BoogieIcfgContainer [2025-03-03 15:19:50,140 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:19:50,141 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:19:50,141 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:19:50,145 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:19:50,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:19:48" (1/3) ... [2025-03-03 15:19:50,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee1466c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:19:50, skipping insertion in model container [2025-03-03 15:19:50,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:19:48" (2/3) ... [2025-03-03 15:19:50,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee1466c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:19:50, skipping insertion in model container [2025-03-03 15:19:50,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:19:50" (3/3) ... [2025-03-03 15:19:50,148 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-03 15:19:50,197 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:19:50,200 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 344 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 15:19:50,255 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:19:50,264 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;@68b209e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:19:50,264 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:19:50,270 INFO L276 IsEmpty]: Start isEmpty. Operand has 344 states, 342 states have (on average 1.7690058479532165) internal successors, (605), 343 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:50,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-03 15:19:50,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:19:50,280 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:19:50,281 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:19:50,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:19:50,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1951425086, now seen corresponding path program 1 times [2025-03-03 15:19:50,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:19:50,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605236129] [2025-03-03 15:19:50,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:19:50,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:19:50,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 15:19:50,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 15:19:50,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:19:50,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:19:51,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:19:51,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:19:51,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605236129] [2025-03-03 15:19:51,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605236129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:19:51,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:19:51,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:19:51,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899139582] [2025-03-03 15:19:51,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:19:51,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:19:51,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:19:51,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:19:51,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:19:51,228 INFO L87 Difference]: Start difference. First operand has 344 states, 342 states have (on average 1.7690058479532165) internal successors, (605), 343 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:51,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:19:51,416 INFO L93 Difference]: Finished difference Result 1298 states and 2291 transitions. [2025-03-03 15:19:51,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:19:51,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2025-03-03 15:19:51,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:19:51,432 INFO L225 Difference]: With dead ends: 1298 [2025-03-03 15:19:51,432 INFO L226 Difference]: Without dead ends: 972 [2025-03-03 15:19:51,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:19:51,439 INFO L435 NwaCegarLoop]: 936 mSDtfsCounter, 1299 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1299 SdHoareTripleChecker+Valid, 2030 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:19:51,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1299 Valid, 2030 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:19:51,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2025-03-03 15:19:51,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 656. [2025-03-03 15:19:51,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 655 states have (on average 1.4625954198473283) internal successors, (958), 655 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:51,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 958 transitions. [2025-03-03 15:19:51,505 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 958 transitions. Word has length 155 [2025-03-03 15:19:51,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:19:51,509 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 958 transitions. [2025-03-03 15:19:51,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:51,509 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 958 transitions. [2025-03-03 15:19:51,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 15:19:51,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:19:51,511 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:19:51,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:19:51,512 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:19:51,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:19:51,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1441526762, now seen corresponding path program 1 times [2025-03-03 15:19:51,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:19:51,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467317094] [2025-03-03 15:19:51,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:19:51,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:19:51,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 15:19:51,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 15:19:51,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:19:51,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:19:51,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:19:51,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:19:51,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467317094] [2025-03-03 15:19:51,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467317094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:19:51,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:19:51,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:19:51,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045571551] [2025-03-03 15:19:51,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:19:51,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:19:51,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:19:51,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:19:51,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:19:51,628 INFO L87 Difference]: Start difference. First operand 656 states and 958 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:51,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:19:51,662 INFO L93 Difference]: Finished difference Result 1286 states and 1872 transitions. [2025-03-03 15:19:51,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:19:51,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2025-03-03 15:19:51,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:19:51,666 INFO L225 Difference]: With dead ends: 1286 [2025-03-03 15:19:51,666 INFO L226 Difference]: Without dead ends: 658 [2025-03-03 15:19:51,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:19:51,669 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 0 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:19:51,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1002 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:19:51,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2025-03-03 15:19:51,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2025-03-03 15:19:51,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 657 states have (on average 1.461187214611872) internal successors, (960), 657 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:51,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 960 transitions. [2025-03-03 15:19:51,689 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 960 transitions. Word has length 156 [2025-03-03 15:19:51,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:19:51,690 INFO L471 AbstractCegarLoop]: Abstraction has 658 states and 960 transitions. [2025-03-03 15:19:51,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:51,691 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 960 transitions. [2025-03-03 15:19:51,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 15:19:51,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:19:51,693 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:19:51,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:19:51,693 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:19:51,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:19:51,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1377930778, now seen corresponding path program 1 times [2025-03-03 15:19:51,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:19:51,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697652586] [2025-03-03 15:19:51,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:19:51,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:19:51,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 15:19:51,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 15:19:51,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:19:51,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:19:52,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:19:52,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:19:52,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697652586] [2025-03-03 15:19:52,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697652586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:19:52,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:19:52,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:19:52,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393195267] [2025-03-03 15:19:52,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:19:52,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:19:52,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:19:52,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:19:52,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:19:52,185 INFO L87 Difference]: Start difference. First operand 658 states and 960 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:52,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:19:52,219 INFO L93 Difference]: Finished difference Result 1302 states and 1898 transitions. [2025-03-03 15:19:52,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:19:52,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2025-03-03 15:19:52,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:19:52,222 INFO L225 Difference]: With dead ends: 1302 [2025-03-03 15:19:52,222 INFO L226 Difference]: Without dead ends: 658 [2025-03-03 15:19:52,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:19:52,223 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 20 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:19:52,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1574 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:19:52,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2025-03-03 15:19:52,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 657. [2025-03-03 15:19:52,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 656 states have (on average 1.4573170731707317) internal successors, (956), 656 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:52,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 956 transitions. [2025-03-03 15:19:52,241 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 956 transitions. Word has length 157 [2025-03-03 15:19:52,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:19:52,241 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 956 transitions. [2025-03-03 15:19:52,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:52,241 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 956 transitions. [2025-03-03 15:19:52,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 15:19:52,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:19:52,244 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:19:52,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:19:52,244 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:19:52,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:19:52,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1406006113, now seen corresponding path program 1 times [2025-03-03 15:19:52,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:19:52,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706340680] [2025-03-03 15:19:52,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:19:52,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:19:52,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 15:19:52,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 15:19:52,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:19:52,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:19:52,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:19:52,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:19:52,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706340680] [2025-03-03 15:19:52,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706340680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:19:52,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:19:52,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:19:52,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966360414] [2025-03-03 15:19:52,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:19:52,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:19:52,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:19:52,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:19:52,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:19:52,368 INFO L87 Difference]: Start difference. First operand 657 states and 956 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:52,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:19:52,415 INFO L93 Difference]: Finished difference Result 1734 states and 2531 transitions. [2025-03-03 15:19:52,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:19:52,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2025-03-03 15:19:52,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:19:52,420 INFO L225 Difference]: With dead ends: 1734 [2025-03-03 15:19:52,420 INFO L226 Difference]: Without dead ends: 1269 [2025-03-03 15:19:52,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:19:52,422 INFO L435 NwaCegarLoop]: 950 mSDtfsCounter, 426 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:19:52,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 1405 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:19:52,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2025-03-03 15:19:52,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1267. [2025-03-03 15:19:52,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1267 states, 1266 states have (on average 1.4423380726698263) internal successors, (1826), 1266 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:52,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1267 states and 1826 transitions. [2025-03-03 15:19:52,447 INFO L78 Accepts]: Start accepts. Automaton has 1267 states and 1826 transitions. Word has length 157 [2025-03-03 15:19:52,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:19:52,447 INFO L471 AbstractCegarLoop]: Abstraction has 1267 states and 1826 transitions. [2025-03-03 15:19:52,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:52,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1826 transitions. [2025-03-03 15:19:52,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 15:19:52,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:19:52,449 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:19:52,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:19:52,449 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:19:52,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:19:52,450 INFO L85 PathProgramCache]: Analyzing trace with hash 814435, now seen corresponding path program 1 times [2025-03-03 15:19:52,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:19:52,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626214158] [2025-03-03 15:19:52,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:19:52,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:19:52,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 15:19:52,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 15:19:52,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:19:52,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:19:52,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:19:52,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:19:52,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626214158] [2025-03-03 15:19:52,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626214158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:19:52,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:19:52,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:19:52,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549652735] [2025-03-03 15:19:52,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:19:52,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:19:52,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:19:52,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:19:52,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:19:52,789 INFO L87 Difference]: Start difference. First operand 1267 states and 1826 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:52,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:19:52,865 INFO L93 Difference]: Finished difference Result 3013 states and 4332 transitions. [2025-03-03 15:19:52,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:19:52,865 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2025-03-03 15:19:52,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:19:52,871 INFO L225 Difference]: With dead ends: 3013 [2025-03-03 15:19:52,871 INFO L226 Difference]: Without dead ends: 1775 [2025-03-03 15:19:52,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:19:52,873 INFO L435 NwaCegarLoop]: 757 mSDtfsCounter, 442 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 1943 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:19:52,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 1943 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:19:52,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2025-03-03 15:19:52,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1773. [2025-03-03 15:19:52,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1773 states, 1772 states have (on average 1.4238148984198646) internal successors, (2523), 1772 states have internal predecessors, (2523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:52,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2523 transitions. [2025-03-03 15:19:52,910 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2523 transitions. Word has length 157 [2025-03-03 15:19:52,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:19:52,910 INFO L471 AbstractCegarLoop]: Abstraction has 1773 states and 2523 transitions. [2025-03-03 15:19:52,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:52,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2523 transitions. [2025-03-03 15:19:52,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 15:19:52,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:19:52,913 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:19:52,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:19:52,914 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:19:52,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:19:52,914 INFO L85 PathProgramCache]: Analyzing trace with hash 385226563, now seen corresponding path program 1 times [2025-03-03 15:19:52,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:19:52,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014081490] [2025-03-03 15:19:52,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:19:52,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:19:52,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 15:19:52,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 15:19:52,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:19:52,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:19:53,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:19:53,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:19:53,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014081490] [2025-03-03 15:19:53,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014081490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:19:53,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:19:53,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:19:53,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932214744] [2025-03-03 15:19:53,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:19:53,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:19:53,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:19:53,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:19:53,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:19:53,017 INFO L87 Difference]: Start difference. First operand 1773 states and 2523 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:53,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:19:53,064 INFO L93 Difference]: Finished difference Result 4018 states and 5871 transitions. [2025-03-03 15:19:53,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:19:53,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2025-03-03 15:19:53,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:19:53,073 INFO L225 Difference]: With dead ends: 4018 [2025-03-03 15:19:53,073 INFO L226 Difference]: Without dead ends: 2526 [2025-03-03 15:19:53,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:19:53,077 INFO L435 NwaCegarLoop]: 705 mSDtfsCounter, 315 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:19:53,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 1075 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:19:53,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2526 states. [2025-03-03 15:19:53,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2526 to 2203. [2025-03-03 15:19:53,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2203 states, 2202 states have (on average 1.4604904632152589) internal successors, (3216), 2202 states have internal predecessors, (3216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:53,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2203 states to 2203 states and 3216 transitions. [2025-03-03 15:19:53,131 INFO L78 Accepts]: Start accepts. Automaton has 2203 states and 3216 transitions. Word has length 161 [2025-03-03 15:19:53,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:19:53,132 INFO L471 AbstractCegarLoop]: Abstraction has 2203 states and 3216 transitions. [2025-03-03 15:19:53,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:53,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2203 states and 3216 transitions. [2025-03-03 15:19:53,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 15:19:53,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:19:53,135 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:19:53,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:19:53,135 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:19:53,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:19:53,136 INFO L85 PathProgramCache]: Analyzing trace with hash -638213834, now seen corresponding path program 1 times [2025-03-03 15:19:53,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:19:53,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460638966] [2025-03-03 15:19:53,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:19:53,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:19:53,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 15:19:53,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 15:19:53,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:19:53,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:19:53,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:19:53,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:19:53,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460638966] [2025-03-03 15:19:53,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460638966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:19:53,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:19:53,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:19:53,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682695497] [2025-03-03 15:19:53,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:19:53,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:19:53,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:19:53,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:19:53,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:19:53,236 INFO L87 Difference]: Start difference. First operand 2203 states and 3216 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:53,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:19:53,298 INFO L93 Difference]: Finished difference Result 5165 states and 7624 transitions. [2025-03-03 15:19:53,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:19:53,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2025-03-03 15:19:53,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:19:53,310 INFO L225 Difference]: With dead ends: 5165 [2025-03-03 15:19:53,311 INFO L226 Difference]: Without dead ends: 3431 [2025-03-03 15:19:53,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:19:53,314 INFO L435 NwaCegarLoop]: 920 mSDtfsCounter, 421 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1367 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:19:53,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1367 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:19:53,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3431 states. [2025-03-03 15:19:53,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3431 to 3429. [2025-03-03 15:19:53,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3429 states, 3428 states have (on average 1.4498249708284714) internal successors, (4970), 3428 states have internal predecessors, (4970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:53,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3429 states to 3429 states and 4970 transitions. [2025-03-03 15:19:53,418 INFO L78 Accepts]: Start accepts. Automaton has 3429 states and 4970 transitions. Word has length 164 [2025-03-03 15:19:53,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:19:53,419 INFO L471 AbstractCegarLoop]: Abstraction has 3429 states and 4970 transitions. [2025-03-03 15:19:53,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:53,419 INFO L276 IsEmpty]: Start isEmpty. Operand 3429 states and 4970 transitions. [2025-03-03 15:19:53,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 15:19:53,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:19:53,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:19:53,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:19:53,424 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:19:53,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:19:53,424 INFO L85 PathProgramCache]: Analyzing trace with hash -2102063153, now seen corresponding path program 1 times [2025-03-03 15:19:53,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:19:53,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929101696] [2025-03-03 15:19:53,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:19:53,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:19:53,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 15:19:53,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 15:19:53,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:19:53,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:19:53,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:19:53,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:19:53,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929101696] [2025-03-03 15:19:53,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929101696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:19:53,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:19:53,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:19:53,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386588876] [2025-03-03 15:19:53,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:19:53,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:19:53,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:19:53,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:19:53,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:19:53,924 INFO L87 Difference]: Start difference. First operand 3429 states and 4970 transitions. Second operand has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 8 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:54,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:19:54,682 INFO L93 Difference]: Finished difference Result 14708 states and 22194 transitions. [2025-03-03 15:19:54,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:19:54,683 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 8 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2025-03-03 15:19:54,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:19:54,718 INFO L225 Difference]: With dead ends: 14708 [2025-03-03 15:19:54,718 INFO L226 Difference]: Without dead ends: 11775 [2025-03-03 15:19:54,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:19:54,723 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 4608 mSDsluCounter, 1979 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4608 SdHoareTripleChecker+Valid, 2363 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:19:54,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4608 Valid, 2363 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:19:54,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11775 states. [2025-03-03 15:19:54,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11775 to 8497. [2025-03-03 15:19:54,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8497 states, 8496 states have (on average 1.47575329566855) internal successors, (12538), 8496 states have internal predecessors, (12538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:54,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8497 states to 8497 states and 12538 transitions. [2025-03-03 15:19:54,953 INFO L78 Accepts]: Start accepts. Automaton has 8497 states and 12538 transitions. Word has length 164 [2025-03-03 15:19:54,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:19:54,954 INFO L471 AbstractCegarLoop]: Abstraction has 8497 states and 12538 transitions. [2025-03-03 15:19:54,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 8 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:54,954 INFO L276 IsEmpty]: Start isEmpty. Operand 8497 states and 12538 transitions. [2025-03-03 15:19:54,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 15:19:54,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:19:54,961 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:19:54,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:19:54,962 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:19:54,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:19:54,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1400998575, now seen corresponding path program 1 times [2025-03-03 15:19:54,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:19:54,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917088523] [2025-03-03 15:19:54,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:19:54,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:19:54,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 15:19:55,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 15:19:55,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:19:55,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:19:55,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:19:55,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:19:55,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917088523] [2025-03-03 15:19:55,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917088523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:19:55,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:19:55,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:19:55,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752840072] [2025-03-03 15:19:55,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:19:55,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:19:55,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:19:55,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:19:55,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:19:55,250 INFO L87 Difference]: Start difference. First operand 8497 states and 12538 transitions. Second operand has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:55,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:19:55,378 INFO L93 Difference]: Finished difference Result 15313 states and 23366 transitions. [2025-03-03 15:19:55,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:19:55,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2025-03-03 15:19:55,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:19:55,462 INFO L225 Difference]: With dead ends: 15313 [2025-03-03 15:19:55,462 INFO L226 Difference]: Without dead ends: 10153 [2025-03-03 15:19:55,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:19:55,474 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 855 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:19:55,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 924 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:19:55,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10153 states. [2025-03-03 15:19:55,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10153 to 10151. [2025-03-03 15:19:55,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10151 states, 10150 states have (on average 1.4866995073891625) internal successors, (15090), 10150 states have internal predecessors, (15090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:55,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10151 states to 10151 states and 15090 transitions. [2025-03-03 15:19:55,716 INFO L78 Accepts]: Start accepts. Automaton has 10151 states and 15090 transitions. Word has length 164 [2025-03-03 15:19:55,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:19:55,716 INFO L471 AbstractCegarLoop]: Abstraction has 10151 states and 15090 transitions. [2025-03-03 15:19:55,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:55,716 INFO L276 IsEmpty]: Start isEmpty. Operand 10151 states and 15090 transitions. [2025-03-03 15:19:55,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 15:19:55,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:19:55,723 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:19:55,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:19:55,723 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:19:55,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:19:55,724 INFO L85 PathProgramCache]: Analyzing trace with hash 374008787, now seen corresponding path program 1 times [2025-03-03 15:19:55,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:19:55,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774560429] [2025-03-03 15:19:55,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:19:55,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:19:55,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 15:19:55,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 15:19:55,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:19:55,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:19:55,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:19:55,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:19:55,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774560429] [2025-03-03 15:19:55,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774560429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:19:55,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:19:55,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:19:55,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413236743] [2025-03-03 15:19:55,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:19:55,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:19:55,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:19:55,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:19:55,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:19:55,879 INFO L87 Difference]: Start difference. First operand 10151 states and 15090 transitions. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:56,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:19:56,144 INFO L93 Difference]: Finished difference Result 33009 states and 50906 transitions. [2025-03-03 15:19:56,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:19:56,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2025-03-03 15:19:56,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:19:56,202 INFO L225 Difference]: With dead ends: 33009 [2025-03-03 15:19:56,202 INFO L226 Difference]: Without dead ends: 28079 [2025-03-03 15:19:56,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:19:56,218 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 1142 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1142 SdHoareTripleChecker+Valid, 1649 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:19:56,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1142 Valid, 1649 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:19:56,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28079 states. [2025-03-03 15:19:56,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28079 to 21521. [2025-03-03 15:19:56,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21521 states, 21520 states have (on average 1.51682156133829) internal successors, (32642), 21520 states have internal predecessors, (32642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:56,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21521 states to 21521 states and 32642 transitions. [2025-03-03 15:19:56,792 INFO L78 Accepts]: Start accepts. Automaton has 21521 states and 32642 transitions. Word has length 164 [2025-03-03 15:19:56,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:19:56,793 INFO L471 AbstractCegarLoop]: Abstraction has 21521 states and 32642 transitions. [2025-03-03 15:19:56,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:56,793 INFO L276 IsEmpty]: Start isEmpty. Operand 21521 states and 32642 transitions. [2025-03-03 15:19:56,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 15:19:56,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:19:56,802 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:19:56,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:19:56,803 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:19:56,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:19:56,803 INFO L85 PathProgramCache]: Analyzing trace with hash -647059567, now seen corresponding path program 1 times [2025-03-03 15:19:56,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:19:56,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886561636] [2025-03-03 15:19:56,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:19:56,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:19:56,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 15:19:56,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 15:19:56,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:19:56,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:19:56,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:19:56,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:19:56,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886561636] [2025-03-03 15:19:56,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886561636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:19:56,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:19:56,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:19:56,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717949546] [2025-03-03 15:19:56,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:19:56,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:19:56,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:19:56,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:19:56,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:19:56,894 INFO L87 Difference]: Start difference. First operand 21521 states and 32642 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:57,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:19:57,178 INFO L93 Difference]: Finished difference Result 49817 states and 76354 transitions. [2025-03-03 15:19:57,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:19:57,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2025-03-03 15:19:57,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:19:57,239 INFO L225 Difference]: With dead ends: 49817 [2025-03-03 15:19:57,240 INFO L226 Difference]: Without dead ends: 32147 [2025-03-03 15:19:57,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:19:57,254 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 311 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:19:57,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 816 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:19:57,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32147 states. [2025-03-03 15:19:57,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32147 to 32145. [2025-03-03 15:19:57,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32145 states, 32144 states have (on average 1.5086485813837731) internal successors, (48494), 32144 states have internal predecessors, (48494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:57,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32145 states to 32145 states and 48494 transitions. [2025-03-03 15:19:57,914 INFO L78 Accepts]: Start accepts. Automaton has 32145 states and 48494 transitions. Word has length 164 [2025-03-03 15:19:57,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:19:57,914 INFO L471 AbstractCegarLoop]: Abstraction has 32145 states and 48494 transitions. [2025-03-03 15:19:57,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:57,915 INFO L276 IsEmpty]: Start isEmpty. Operand 32145 states and 48494 transitions. [2025-03-03 15:19:57,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 15:19:57,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:19:57,929 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:19:57,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:19:57,929 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:19:57,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:19:57,929 INFO L85 PathProgramCache]: Analyzing trace with hash 239995281, now seen corresponding path program 1 times [2025-03-03 15:19:57,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:19:57,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067323723] [2025-03-03 15:19:57,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:19:57,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:19:57,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 15:19:57,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 15:19:57,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:19:57,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:19:58,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:19:58,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:19:58,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067323723] [2025-03-03 15:19:58,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067323723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:19:58,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:19:58,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:19:58,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190397069] [2025-03-03 15:19:58,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:19:58,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:19:58,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:19:58,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:19:58,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:19:58,038 INFO L87 Difference]: Start difference. First operand 32145 states and 48494 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:58,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:19:58,309 INFO L93 Difference]: Finished difference Result 73785 states and 112588 transitions. [2025-03-03 15:19:58,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:19:58,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2025-03-03 15:19:58,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:19:58,444 INFO L225 Difference]: With dead ends: 73785 [2025-03-03 15:19:58,445 INFO L226 Difference]: Without dead ends: 60292 [2025-03-03 15:19:58,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:19:58,482 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 319 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:19:58,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 825 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:19:58,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60292 states. [2025-03-03 15:19:59,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60292 to 60290. [2025-03-03 15:19:59,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60290 states, 60289 states have (on average 1.5183698518801108) internal successors, (91541), 60289 states have internal predecessors, (91541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:59,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60290 states to 60290 states and 91541 transitions. [2025-03-03 15:19:59,474 INFO L78 Accepts]: Start accepts. Automaton has 60290 states and 91541 transitions. Word has length 164 [2025-03-03 15:19:59,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:19:59,474 INFO L471 AbstractCegarLoop]: Abstraction has 60290 states and 91541 transitions. [2025-03-03 15:19:59,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:19:59,475 INFO L276 IsEmpty]: Start isEmpty. Operand 60290 states and 91541 transitions. [2025-03-03 15:19:59,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 15:19:59,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:19:59,489 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:19:59,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:19:59,490 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:19:59,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:19:59,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1324097777, now seen corresponding path program 1 times [2025-03-03 15:19:59,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:19:59,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363365424] [2025-03-03 15:19:59,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:19:59,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:19:59,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 15:19:59,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 15:19:59,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:19:59,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:19:59,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:19:59,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:19:59,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363365424] [2025-03-03 15:19:59,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363365424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:19:59,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:19:59,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:19:59,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900993266] [2025-03-03 15:19:59,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:19:59,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:19:59,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:19:59,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:19:59,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:19:59,804 INFO L87 Difference]: Start difference. First operand 60290 states and 91541 transitions. Second operand has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:00,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:00,427 INFO L93 Difference]: Finished difference Result 231633 states and 350629 transitions. [2025-03-03 15:20:00,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:20:00,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2025-03-03 15:20:00,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:01,025 INFO L225 Difference]: With dead ends: 231633 [2025-03-03 15:20:01,025 INFO L226 Difference]: Without dead ends: 171410 [2025-03-03 15:20:01,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:20:01,099 INFO L435 NwaCegarLoop]: 786 mSDtfsCounter, 967 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 967 SdHoareTripleChecker+Valid, 1649 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:01,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [967 Valid, 1649 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:20:01,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171410 states. [2025-03-03 15:20:02,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171410 to 115854. [2025-03-03 15:20:02,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115854 states, 115853 states have (on average 1.502939069337868) internal successors, (174120), 115853 states have internal predecessors, (174120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:03,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115854 states to 115854 states and 174120 transitions. [2025-03-03 15:20:03,152 INFO L78 Accepts]: Start accepts. Automaton has 115854 states and 174120 transitions. Word has length 164 [2025-03-03 15:20:03,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:03,152 INFO L471 AbstractCegarLoop]: Abstraction has 115854 states and 174120 transitions. [2025-03-03 15:20:03,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:03,153 INFO L276 IsEmpty]: Start isEmpty. Operand 115854 states and 174120 transitions. [2025-03-03 15:20:03,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 15:20:03,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:03,183 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:20:03,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:20:03,183 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:03,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:03,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1803163183, now seen corresponding path program 1 times [2025-03-03 15:20:03,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:03,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924343490] [2025-03-03 15:20:03,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:03,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:03,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 15:20:03,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 15:20:03,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:03,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:03,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:20:03,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:03,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924343490] [2025-03-03 15:20:03,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924343490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:03,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:03,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:20:03,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600182203] [2025-03-03 15:20:03,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:03,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:20:03,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:03,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:20:03,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:20:03,269 INFO L87 Difference]: Start difference. First operand 115854 states and 174120 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:04,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:04,147 INFO L93 Difference]: Finished difference Result 231592 states and 348081 transitions. [2025-03-03 15:20:04,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:20:04,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2025-03-03 15:20:04,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:04,587 INFO L225 Difference]: With dead ends: 231592 [2025-03-03 15:20:04,587 INFO L226 Difference]: Without dead ends: 115862 [2025-03-03 15:20:04,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:20:04,622 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 0 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:04,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 982 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:20:04,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115862 states. [2025-03-03 15:20:06,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115862 to 115862. [2025-03-03 15:20:06,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115862 states, 115861 states have (on average 1.5029043422722055) internal successors, (174128), 115861 states have internal predecessors, (174128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:06,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115862 states to 115862 states and 174128 transitions. [2025-03-03 15:20:06,412 INFO L78 Accepts]: Start accepts. Automaton has 115862 states and 174128 transitions. Word has length 165 [2025-03-03 15:20:06,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:06,412 INFO L471 AbstractCegarLoop]: Abstraction has 115862 states and 174128 transitions. [2025-03-03 15:20:06,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:06,413 INFO L276 IsEmpty]: Start isEmpty. Operand 115862 states and 174128 transitions. [2025-03-03 15:20:06,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 15:20:06,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:06,434 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:20:06,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:20:06,434 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:06,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:06,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1206403495, now seen corresponding path program 1 times [2025-03-03 15:20:06,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:06,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821325701] [2025-03-03 15:20:06,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:06,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:06,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 15:20:06,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 15:20:06,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:06,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:06,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:20:06,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:06,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821325701] [2025-03-03 15:20:06,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821325701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:06,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:06,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:20:06,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905954765] [2025-03-03 15:20:06,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:06,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:20:06,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:06,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:20:06,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:20:06,897 INFO L87 Difference]: Start difference. First operand 115862 states and 174128 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:07,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:07,399 INFO L93 Difference]: Finished difference Result 220487 states and 331431 transitions. [2025-03-03 15:20:07,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:20:07,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 166 [2025-03-03 15:20:07,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:07,563 INFO L225 Difference]: With dead ends: 220487 [2025-03-03 15:20:07,564 INFO L226 Difference]: Without dead ends: 104996 [2025-03-03 15:20:07,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:20:07,874 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 21 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1554 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:07,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1554 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:20:07,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104996 states. [2025-03-03 15:20:09,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104996 to 104996. [2025-03-03 15:20:09,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104996 states, 104995 states have (on average 1.5026620315253107) internal successors, (157772), 104995 states have internal predecessors, (157772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:09,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104996 states to 104996 states and 157772 transitions. [2025-03-03 15:20:09,375 INFO L78 Accepts]: Start accepts. Automaton has 104996 states and 157772 transitions. Word has length 166 [2025-03-03 15:20:09,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:09,375 INFO L471 AbstractCegarLoop]: Abstraction has 104996 states and 157772 transitions. [2025-03-03 15:20:09,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:09,375 INFO L276 IsEmpty]: Start isEmpty. Operand 104996 states and 157772 transitions. [2025-03-03 15:20:09,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 15:20:09,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:09,390 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:20:09,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:20:09,391 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:09,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:09,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1064115118, now seen corresponding path program 1 times [2025-03-03 15:20:09,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:09,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114324111] [2025-03-03 15:20:09,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:09,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:09,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 15:20:09,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 15:20:09,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:09,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:09,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:20:09,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:09,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114324111] [2025-03-03 15:20:09,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114324111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:09,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:09,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:20:09,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073313830] [2025-03-03 15:20:09,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:09,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:20:09,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:09,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:20:09,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:20:09,458 INFO L87 Difference]: Start difference. First operand 104996 states and 157772 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:10,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:10,377 INFO L93 Difference]: Finished difference Result 257878 states and 389253 transitions. [2025-03-03 15:20:10,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:20:10,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2025-03-03 15:20:10,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:10,631 INFO L225 Difference]: With dead ends: 257878 [2025-03-03 15:20:10,631 INFO L226 Difference]: Without dead ends: 172098 [2025-03-03 15:20:10,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:20:10,678 INFO L435 NwaCegarLoop]: 683 mSDtfsCounter, 301 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:10,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 1036 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:20:10,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172098 states. [2025-03-03 15:20:12,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172098 to 159552. [2025-03-03 15:20:12,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159552 states, 159551 states have (on average 1.5146504879317586) internal successors, (241664), 159551 states have internal predecessors, (241664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:13,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159552 states to 159552 states and 241664 transitions. [2025-03-03 15:20:13,208 INFO L78 Accepts]: Start accepts. Automaton has 159552 states and 241664 transitions. Word has length 170 [2025-03-03 15:20:13,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:13,208 INFO L471 AbstractCegarLoop]: Abstraction has 159552 states and 241664 transitions. [2025-03-03 15:20:13,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:13,209 INFO L276 IsEmpty]: Start isEmpty. Operand 159552 states and 241664 transitions. [2025-03-03 15:20:13,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 15:20:13,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:13,226 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:20:13,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:20:13,226 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:13,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:13,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1432609191, now seen corresponding path program 1 times [2025-03-03 15:20:13,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:13,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124313582] [2025-03-03 15:20:13,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:13,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:13,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 15:20:13,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 15:20:13,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:13,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:13,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:20:13,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:13,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124313582] [2025-03-03 15:20:13,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124313582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:13,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:13,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:20:13,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832561472] [2025-03-03 15:20:13,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:13,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:20:13,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:13,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:20:13,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:20:13,298 INFO L87 Difference]: Start difference. First operand 159552 states and 241664 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:14,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:14,776 INFO L93 Difference]: Finished difference Result 436028 states and 664954 transitions. [2025-03-03 15:20:14,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:20:14,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2025-03-03 15:20:14,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:15,259 INFO L225 Difference]: With dead ends: 436028 [2025-03-03 15:20:15,259 INFO L226 Difference]: Without dead ends: 277222 [2025-03-03 15:20:15,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:20:15,393 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 298 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:15,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 1023 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:20:15,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277222 states. [2025-03-03 15:20:19,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277222 to 257116. [2025-03-03 15:20:19,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257116 states, 257115 states have (on average 1.5337611574587247) internal successors, (394353), 257115 states have internal predecessors, (394353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:20,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257116 states to 257116 states and 394353 transitions. [2025-03-03 15:20:20,233 INFO L78 Accepts]: Start accepts. Automaton has 257116 states and 394353 transitions. Word has length 170 [2025-03-03 15:20:20,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:20,233 INFO L471 AbstractCegarLoop]: Abstraction has 257116 states and 394353 transitions. [2025-03-03 15:20:20,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:20,233 INFO L276 IsEmpty]: Start isEmpty. Operand 257116 states and 394353 transitions. [2025-03-03 15:20:20,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 15:20:20,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:20,248 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:20:20,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:20:20,248 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:20,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:20,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1936223107, now seen corresponding path program 1 times [2025-03-03 15:20:20,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:20,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391345176] [2025-03-03 15:20:20,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:20,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:20,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 15:20:20,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 15:20:20,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:20,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:20,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:20:20,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:20,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391345176] [2025-03-03 15:20:20,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391345176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:20,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:20,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:20:20,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952032430] [2025-03-03 15:20:20,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:20,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:20:20,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:20,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:20:20,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:20:20,382 INFO L87 Difference]: Start difference. First operand 257116 states and 394353 transitions. Second operand has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:24,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:24,154 INFO L93 Difference]: Finished difference Result 1024556 states and 1590233 transitions. [2025-03-03 15:20:24,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:20:24,155 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 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 171 [2025-03-03 15:20:24,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:25,883 INFO L225 Difference]: With dead ends: 1024556 [2025-03-03 15:20:25,883 INFO L226 Difference]: Without dead ends: 787294 [2025-03-03 15:20:26,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:20:26,082 INFO L435 NwaCegarLoop]: 789 mSDtfsCounter, 1424 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1424 SdHoareTripleChecker+Valid, 1953 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:26,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1424 Valid, 1953 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:20:26,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787294 states. [2025-03-03 15:20:33,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787294 to 409344. [2025-03-03 15:20:33,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409344 states, 409343 states have (on average 1.5297171320872716) internal successors, (626179), 409343 states have internal predecessors, (626179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:34,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409344 states to 409344 states and 626179 transitions. [2025-03-03 15:20:34,993 INFO L78 Accepts]: Start accepts. Automaton has 409344 states and 626179 transitions. Word has length 171 [2025-03-03 15:20:34,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:34,993 INFO L471 AbstractCegarLoop]: Abstraction has 409344 states and 626179 transitions. [2025-03-03 15:20:34,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:34,994 INFO L276 IsEmpty]: Start isEmpty. Operand 409344 states and 626179 transitions. [2025-03-03 15:20:35,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 15:20:35,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:35,006 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:20:35,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:20:35,006 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:35,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:35,007 INFO L85 PathProgramCache]: Analyzing trace with hash 2069506945, now seen corresponding path program 1 times [2025-03-03 15:20:35,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:35,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189878527] [2025-03-03 15:20:35,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:35,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:35,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 15:20:35,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 15:20:35,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:35,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:35,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:20:35,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:35,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189878527] [2025-03-03 15:20:35,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189878527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:35,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:35,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:20:35,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234000562] [2025-03-03 15:20:35,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:35,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:20:35,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:35,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:20:35,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:20:35,243 INFO L87 Difference]: Start difference. First operand 409344 states and 626179 transitions. Second operand has 8 states, 8 states have (on average 21.375) internal successors, (171), 7 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)