./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6fd1b86eb4bd4da10127873e4ddea09cb0ce3be9adebe9545b8e8b0c5a6a02d7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:38:41,163 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:38:41,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:38:41,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:38:41,232 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:38:41,250 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:38:41,251 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:38:41,251 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:38:41,251 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:38:41,251 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:38:41,251 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:38:41,251 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:38:41,252 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:38:41,252 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:38:41,252 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:38:41,252 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:38:41,252 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:38:41,255 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:38:41,256 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:38:41,256 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:38:41,256 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:38:41,256 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:38:41,256 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:38:41,256 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:38:41,256 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:38:41,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:38:41,256 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:38:41,256 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:38:41,256 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:38:41,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:38:41,256 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:38:41,256 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:38:41,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:38:41,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:38:41,257 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:38:41,257 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:38:41,257 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:38:41,257 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:38:41,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:38:41,257 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:38:41,257 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:38:41,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:38:41,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:38:41,257 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6fd1b86eb4bd4da10127873e4ddea09cb0ce3be9adebe9545b8e8b0c5a6a02d7 [2025-03-16 19:38:41,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:38:41,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:38:41,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:38:41,510 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:38:41,510 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:38:41,511 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.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2025-03-16 19:38:42,740 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b437af9ea/79350b00a31d45b186a618e0b97a054a/FLAG585172b6e [2025-03-16 19:38:43,031 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:38:43,032 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2025-03-16 19:38:43,043 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b437af9ea/79350b00a31d45b186a618e0b97a054a/FLAG585172b6e [2025-03-16 19:38:43,320 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b437af9ea/79350b00a31d45b186a618e0b97a054a [2025-03-16 19:38:43,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:38:43,323 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:38:43,325 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:38:43,325 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:38:43,328 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:38:43,330 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:38:43" (1/1) ... [2025-03-16 19:38:43,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@96a702a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:43, skipping insertion in model container [2025-03-16 19:38:43,332 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:38:43" (1/1) ... [2025-03-16 19:38:43,362 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:38:43,500 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.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[7806,7819] [2025-03-16 19:38:43,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:38:43,536 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:38:43,587 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.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[7806,7819] [2025-03-16 19:38:43,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:38:43,612 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:38:43,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:43 WrapperNode [2025-03-16 19:38:43,612 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:38:43,613 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:38:43,613 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:38:43,613 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:38:43,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:43" (1/1) ... [2025-03-16 19:38:43,625 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:43" (1/1) ... [2025-03-16 19:38:43,654 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 687 [2025-03-16 19:38:43,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:38:43,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:38:43,658 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:38:43,658 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:38:43,665 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:43" (1/1) ... [2025-03-16 19:38:43,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:43" (1/1) ... [2025-03-16 19:38:43,671 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:43" (1/1) ... [2025-03-16 19:38:43,686 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 19:38:43,686 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:43" (1/1) ... [2025-03-16 19:38:43,687 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:43" (1/1) ... [2025-03-16 19:38:43,693 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:43" (1/1) ... [2025-03-16 19:38:43,695 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:43" (1/1) ... [2025-03-16 19:38:43,697 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:43" (1/1) ... [2025-03-16 19:38:43,698 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:43" (1/1) ... [2025-03-16 19:38:43,706 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:38:43,707 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:38:43,707 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:38:43,707 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:38:43,708 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:43" (1/1) ... [2025-03-16 19:38:43,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:38:43,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:38:43,739 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:38:43,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:38:43,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:38:43,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:38:43,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:38:43,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:38:43,860 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:38:43,862 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:38:44,404 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L322: havoc main_~node3__newmax~0#1; [2025-03-16 19:38:44,404 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L289: havoc main_~node2__newmax~0#1; [2025-03-16 19:38:44,404 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L256: 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-16 19:38:44,404 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L410: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-16 19:38:44,404 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L776: havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-16 19:38:44,404 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L661: havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-16 19:38:44,404 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L546: havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-16 19:38:44,436 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-03-16 19:38:44,439 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:38:44,449 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:38:44,451 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:38:44,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:38:44 BoogieIcfgContainer [2025-03-16 19:38:44,451 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:38:44,453 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:38:44,454 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:38:44,458 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:38:44,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:38:43" (1/3) ... [2025-03-16 19:38:44,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792e0e10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:38:44, skipping insertion in model container [2025-03-16 19:38:44,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:38:43" (2/3) ... [2025-03-16 19:38:44,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792e0e10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:38:44, skipping insertion in model container [2025-03-16 19:38:44,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:38:44" (3/3) ... [2025-03-16 19:38:44,460 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2025-03-16 19:38:44,473 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:38:44,475 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c that has 1 procedures, 148 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 19:38:44,525 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:38:44,532 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;@40c44cb1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:38:44,532 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:38:44,535 INFO L276 IsEmpty]: Start isEmpty. Operand has 148 states, 146 states have (on average 1.7671232876712328) internal successors, (258), 147 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:44,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 19:38:44,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:44,543 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] [2025-03-16 19:38:44,543 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:44,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:44,548 INFO L85 PathProgramCache]: Analyzing trace with hash -919712139, now seen corresponding path program 1 times [2025-03-16 19:38:44,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:44,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141898996] [2025-03-16 19:38:44,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:44,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:44,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 19:38:44,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 19:38:44,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:44,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:45,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:45,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:45,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141898996] [2025-03-16 19:38:45,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141898996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:45,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:45,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:38:45,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102297051] [2025-03-16 19:38:45,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:45,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:38:45,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:45,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:38:45,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:45,030 INFO L87 Difference]: Start difference. First operand has 148 states, 146 states have (on average 1.7671232876712328) internal successors, (258), 147 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:45,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:45,104 INFO L93 Difference]: Finished difference Result 310 states and 526 transitions. [2025-03-16 19:38:45,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:38:45,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-03-16 19:38:45,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:45,114 INFO L225 Difference]: With dead ends: 310 [2025-03-16 19:38:45,114 INFO L226 Difference]: Without dead ends: 212 [2025-03-16 19:38:45,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:45,122 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 150 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:45,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 431 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:45,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-16 19:38:45,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2025-03-16 19:38:45,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 1.569377990430622) internal successors, (328), 209 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:45,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 328 transitions. [2025-03-16 19:38:45,153 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 328 transitions. Word has length 61 [2025-03-16 19:38:45,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:45,153 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 328 transitions. [2025-03-16 19:38:45,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:45,154 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 328 transitions. [2025-03-16 19:38:45,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 19:38:45,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:45,155 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] [2025-03-16 19:38:45,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:38:45,156 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:45,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:45,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1807027333, now seen corresponding path program 1 times [2025-03-16 19:38:45,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:45,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708470449] [2025-03-16 19:38:45,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:45,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:45,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 19:38:45,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 19:38:45,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:45,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:45,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:45,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:45,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708470449] [2025-03-16 19:38:45,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708470449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:45,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:45,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:38:45,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667458604] [2025-03-16 19:38:45,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:45,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:38:45,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:45,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:38:45,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:45,340 INFO L87 Difference]: Start difference. First operand 210 states and 328 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:45,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:45,388 INFO L93 Difference]: Finished difference Result 502 states and 808 transitions. [2025-03-16 19:38:45,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:38:45,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-03-16 19:38:45,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:45,393 INFO L225 Difference]: With dead ends: 502 [2025-03-16 19:38:45,395 INFO L226 Difference]: Without dead ends: 348 [2025-03-16 19:38:45,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:45,396 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 125 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:45,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 414 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:45,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-03-16 19:38:45,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 346. [2025-03-16 19:38:45,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 345 states have (on average 1.5971014492753624) internal successors, (551), 345 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:45,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 551 transitions. [2025-03-16 19:38:45,416 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 551 transitions. Word has length 63 [2025-03-16 19:38:45,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:45,417 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 551 transitions. [2025-03-16 19:38:45,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:45,417 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 551 transitions. [2025-03-16 19:38:45,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 19:38:45,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:45,421 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] [2025-03-16 19:38:45,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:38:45,421 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:45,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:45,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1196449205, now seen corresponding path program 1 times [2025-03-16 19:38:45,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:45,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44376847] [2025-03-16 19:38:45,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:45,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:45,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 19:38:45,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 19:38:45,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:45,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:45,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:45,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:45,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44376847] [2025-03-16 19:38:45,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44376847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:45,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:45,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:38:45,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121884442] [2025-03-16 19:38:45,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:45,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:38:45,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:45,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:38:45,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:45,574 INFO L87 Difference]: Start difference. First operand 346 states and 551 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:45,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:45,603 INFO L93 Difference]: Finished difference Result 894 states and 1449 transitions. [2025-03-16 19:38:45,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:38:45,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-03-16 19:38:45,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:45,606 INFO L225 Difference]: With dead ends: 894 [2025-03-16 19:38:45,606 INFO L226 Difference]: Without dead ends: 604 [2025-03-16 19:38:45,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:45,610 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 119 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:45,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 415 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:45,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-03-16 19:38:45,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 602. [2025-03-16 19:38:45,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 601 states have (on average 1.6089850249584026) internal successors, (967), 601 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:45,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 967 transitions. [2025-03-16 19:38:45,639 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 967 transitions. Word has length 65 [2025-03-16 19:38:45,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:45,639 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 967 transitions. [2025-03-16 19:38:45,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:45,640 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 967 transitions. [2025-03-16 19:38:45,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-16 19:38:45,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:45,644 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] [2025-03-16 19:38:45,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:38:45,644 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:45,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:45,644 INFO L85 PathProgramCache]: Analyzing trace with hash 636520965, now seen corresponding path program 1 times [2025-03-16 19:38:45,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:45,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531632246] [2025-03-16 19:38:45,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:45,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:45,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-16 19:38:45,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-16 19:38:45,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:45,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:45,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:45,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:45,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531632246] [2025-03-16 19:38:45,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531632246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:45,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:45,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:38:45,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496347568] [2025-03-16 19:38:45,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:45,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:38:45,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:45,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:38:45,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:38:45,788 INFO L87 Difference]: Start difference. First operand 602 states and 967 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:45,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:45,972 INFO L93 Difference]: Finished difference Result 3078 states and 5037 transitions. [2025-03-16 19:38:45,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:38:45,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-03-16 19:38:45,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:45,982 INFO L225 Difference]: With dead ends: 3078 [2025-03-16 19:38:45,983 INFO L226 Difference]: Without dead ends: 2532 [2025-03-16 19:38:45,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:38:45,985 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 856 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:45,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 1617 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:38:45,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2532 states. [2025-03-16 19:38:46,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2532 to 1130. [2025-03-16 19:38:46,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 1129 states have (on average 1.6182462356067315) internal successors, (1827), 1129 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:46,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1827 transitions. [2025-03-16 19:38:46,027 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1827 transitions. Word has length 67 [2025-03-16 19:38:46,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:46,028 INFO L471 AbstractCegarLoop]: Abstraction has 1130 states and 1827 transitions. [2025-03-16 19:38:46,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:46,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1827 transitions. [2025-03-16 19:38:46,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 19:38:46,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:46,030 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] [2025-03-16 19:38:46,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:38:46,031 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:46,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:46,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1740807677, now seen corresponding path program 1 times [2025-03-16 19:38:46,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:46,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633903851] [2025-03-16 19:38:46,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:46,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:46,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 19:38:46,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 19:38:46,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:46,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:46,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:46,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:46,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633903851] [2025-03-16 19:38:46,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633903851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:46,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:46,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:38:46,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327394522] [2025-03-16 19:38:46,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:46,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:38:46,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:46,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:38:46,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:38:46,168 INFO L87 Difference]: Start difference. First operand 1130 states and 1827 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:46,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:46,247 INFO L93 Difference]: Finished difference Result 4120 states and 6710 transitions. [2025-03-16 19:38:46,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:38:46,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2025-03-16 19:38:46,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:46,259 INFO L225 Difference]: With dead ends: 4120 [2025-03-16 19:38:46,259 INFO L226 Difference]: Without dead ends: 3046 [2025-03-16 19:38:46,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:38:46,265 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 430 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:46,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 754 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:38:46,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3046 states. [2025-03-16 19:38:46,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3046 to 2079. [2025-03-16 19:38:46,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2079 states, 2078 states have (on average 1.618383060635226) internal successors, (3363), 2078 states have internal predecessors, (3363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:46,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 3363 transitions. [2025-03-16 19:38:46,328 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 3363 transitions. Word has length 68 [2025-03-16 19:38:46,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:46,328 INFO L471 AbstractCegarLoop]: Abstraction has 2079 states and 3363 transitions. [2025-03-16 19:38:46,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:46,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 3363 transitions. [2025-03-16 19:38:46,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 19:38:46,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:46,330 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] [2025-03-16 19:38:46,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:38:46,331 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:46,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:46,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1968581341, now seen corresponding path program 1 times [2025-03-16 19:38:46,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:46,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307541140] [2025-03-16 19:38:46,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:46,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:46,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 19:38:46,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 19:38:46,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:46,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:46,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:46,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:46,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307541140] [2025-03-16 19:38:46,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307541140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:46,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:46,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:38:46,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942705218] [2025-03-16 19:38:46,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:46,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:38:46,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:46,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:38:46,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:46,412 INFO L87 Difference]: Start difference. First operand 2079 states and 3363 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:46,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:46,445 INFO L93 Difference]: Finished difference Result 4969 states and 8088 transitions. [2025-03-16 19:38:46,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:38:46,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-03-16 19:38:46,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:46,454 INFO L225 Difference]: With dead ends: 4969 [2025-03-16 19:38:46,455 INFO L226 Difference]: Without dead ends: 2946 [2025-03-16 19:38:46,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:46,460 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 132 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:46,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 511 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:46,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2025-03-16 19:38:46,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 2944. [2025-03-16 19:38:46,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2944 states, 2943 states have (on average 1.6248725790010194) internal successors, (4782), 2943 states have internal predecessors, (4782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:46,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 4782 transitions. [2025-03-16 19:38:46,513 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 4782 transitions. Word has length 69 [2025-03-16 19:38:46,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:46,513 INFO L471 AbstractCegarLoop]: Abstraction has 2944 states and 4782 transitions. [2025-03-16 19:38:46,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:46,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 4782 transitions. [2025-03-16 19:38:46,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 19:38:46,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:46,514 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] [2025-03-16 19:38:46,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:38:46,514 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:46,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:46,515 INFO L85 PathProgramCache]: Analyzing trace with hash 561544899, now seen corresponding path program 1 times [2025-03-16 19:38:46,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:46,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593817030] [2025-03-16 19:38:46,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:46,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:46,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 19:38:46,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 19:38:46,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:46,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:46,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:46,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:46,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593817030] [2025-03-16 19:38:46,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593817030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:46,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:46,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:38:46,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972317065] [2025-03-16 19:38:46,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:46,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:38:46,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:46,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:38:46,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:46,581 INFO L87 Difference]: Start difference. First operand 2944 states and 4782 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:46,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:46,630 INFO L93 Difference]: Finished difference Result 5676 states and 9249 transitions. [2025-03-16 19:38:46,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:38:46,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-03-16 19:38:46,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:46,642 INFO L225 Difference]: With dead ends: 5676 [2025-03-16 19:38:46,643 INFO L226 Difference]: Without dead ends: 4054 [2025-03-16 19:38:46,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:46,645 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 126 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:46,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 497 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:46,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4054 states. [2025-03-16 19:38:46,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4054 to 4052. [2025-03-16 19:38:46,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4052 states, 4051 states have (on average 1.61885954085411) internal successors, (6558), 4051 states have internal predecessors, (6558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:46,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4052 states to 4052 states and 6558 transitions. [2025-03-16 19:38:46,717 INFO L78 Accepts]: Start accepts. Automaton has 4052 states and 6558 transitions. Word has length 69 [2025-03-16 19:38:46,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:46,717 INFO L471 AbstractCegarLoop]: Abstraction has 4052 states and 6558 transitions. [2025-03-16 19:38:46,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:46,717 INFO L276 IsEmpty]: Start isEmpty. Operand 4052 states and 6558 transitions. [2025-03-16 19:38:46,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 19:38:46,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:46,718 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] [2025-03-16 19:38:46,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:38:46,718 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:46,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:46,719 INFO L85 PathProgramCache]: Analyzing trace with hash -59842461, now seen corresponding path program 1 times [2025-03-16 19:38:46,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:46,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119037347] [2025-03-16 19:38:46,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:46,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:46,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 19:38:46,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 19:38:46,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:46,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:46,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:46,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:46,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119037347] [2025-03-16 19:38:46,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119037347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:46,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:46,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:38:46,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505397554] [2025-03-16 19:38:46,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:46,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:38:46,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:46,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:38:46,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:46,800 INFO L87 Difference]: Start difference. First operand 4052 states and 6558 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:46,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:46,851 INFO L93 Difference]: Finished difference Result 7708 states and 12513 transitions. [2025-03-16 19:38:46,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:38:46,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-03-16 19:38:46,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:46,870 INFO L225 Difference]: With dead ends: 7708 [2025-03-16 19:38:46,870 INFO L226 Difference]: Without dead ends: 5492 [2025-03-16 19:38:46,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:46,876 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 120 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:46,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 474 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:46,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5492 states. [2025-03-16 19:38:46,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5492 to 5490. [2025-03-16 19:38:46,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5490 states, 5489 states have (on average 1.6112224448897796) internal successors, (8844), 5489 states have internal predecessors, (8844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:46,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5490 states to 5490 states and 8844 transitions. [2025-03-16 19:38:46,997 INFO L78 Accepts]: Start accepts. Automaton has 5490 states and 8844 transitions. Word has length 69 [2025-03-16 19:38:46,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:46,997 INFO L471 AbstractCegarLoop]: Abstraction has 5490 states and 8844 transitions. [2025-03-16 19:38:46,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:46,997 INFO L276 IsEmpty]: Start isEmpty. Operand 5490 states and 8844 transitions. [2025-03-16 19:38:46,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 19:38:46,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:46,998 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] [2025-03-16 19:38:46,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:38:46,998 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:46,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:46,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1871326376, now seen corresponding path program 1 times [2025-03-16 19:38:46,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:46,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623127422] [2025-03-16 19:38:46,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:46,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:47,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 19:38:47,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 19:38:47,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:47,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:47,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:47,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:47,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623127422] [2025-03-16 19:38:47,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623127422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:47,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:47,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:38:47,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748797651] [2025-03-16 19:38:47,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:47,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:38:47,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:47,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:38:47,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:38:47,112 INFO L87 Difference]: Start difference. First operand 5490 states and 8844 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:47,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:47,257 INFO L93 Difference]: Finished difference Result 17546 states and 28346 transitions. [2025-03-16 19:38:47,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:38:47,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-03-16 19:38:47,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:47,297 INFO L225 Difference]: With dead ends: 17546 [2025-03-16 19:38:47,297 INFO L226 Difference]: Without dead ends: 12146 [2025-03-16 19:38:47,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:38:47,310 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 429 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:47,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 746 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:38:47,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12146 states. [2025-03-16 19:38:47,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12146 to 8783. [2025-03-16 19:38:47,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8783 states, 8782 states have (on average 1.6020268731496243) internal successors, (14069), 8782 states have internal predecessors, (14069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:47,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8783 states to 8783 states and 14069 transitions. [2025-03-16 19:38:47,539 INFO L78 Accepts]: Start accepts. Automaton has 8783 states and 14069 transitions. Word has length 69 [2025-03-16 19:38:47,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:47,539 INFO L471 AbstractCegarLoop]: Abstraction has 8783 states and 14069 transitions. [2025-03-16 19:38:47,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:47,540 INFO L276 IsEmpty]: Start isEmpty. Operand 8783 states and 14069 transitions. [2025-03-16 19:38:47,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 19:38:47,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:47,540 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] [2025-03-16 19:38:47,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:38:47,540 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:47,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:47,541 INFO L85 PathProgramCache]: Analyzing trace with hash -2116724346, now seen corresponding path program 1 times [2025-03-16 19:38:47,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:47,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932400624] [2025-03-16 19:38:47,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:47,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:47,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 19:38:47,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 19:38:47,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:47,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:47,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:47,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:47,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932400624] [2025-03-16 19:38:47,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932400624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:47,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:47,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:38:47,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002582682] [2025-03-16 19:38:47,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:47,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:38:47,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:47,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:38:47,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:38:47,615 INFO L87 Difference]: Start difference. First operand 8783 states and 14069 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:47,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:47,753 INFO L93 Difference]: Finished difference Result 27680 states and 44432 transitions. [2025-03-16 19:38:47,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:38:47,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2025-03-16 19:38:47,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:47,791 INFO L225 Difference]: With dead ends: 27680 [2025-03-16 19:38:47,791 INFO L226 Difference]: Without dead ends: 18987 [2025-03-16 19:38:47,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:38:47,808 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 427 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:47,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 748 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:38:47,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18987 states. [2025-03-16 19:38:48,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18987 to 13832. [2025-03-16 19:38:48,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13832 states, 13831 states have (on average 1.5922203745210035) internal successors, (22022), 13831 states have internal predecessors, (22022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:48,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13832 states to 13832 states and 22022 transitions. [2025-03-16 19:38:48,090 INFO L78 Accepts]: Start accepts. Automaton has 13832 states and 22022 transitions. Word has length 70 [2025-03-16 19:38:48,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:48,090 INFO L471 AbstractCegarLoop]: Abstraction has 13832 states and 22022 transitions. [2025-03-16 19:38:48,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:48,090 INFO L276 IsEmpty]: Start isEmpty. Operand 13832 states and 22022 transitions. [2025-03-16 19:38:48,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 19:38:48,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:48,091 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] [2025-03-16 19:38:48,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:38:48,091 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:48,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:48,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1693886824, now seen corresponding path program 1 times [2025-03-16 19:38:48,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:48,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091312723] [2025-03-16 19:38:48,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:48,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:48,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 19:38:48,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 19:38:48,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:48,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:48,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:48,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:48,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091312723] [2025-03-16 19:38:48,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091312723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:48,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:48,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:38:48,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049989792] [2025-03-16 19:38:48,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:48,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:38:48,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:48,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:38:48,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:38:48,249 INFO L87 Difference]: Start difference. First operand 13832 states and 22022 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:48,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:48,359 INFO L93 Difference]: Finished difference Result 27576 states and 43921 transitions. [2025-03-16 19:38:48,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:38:48,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2025-03-16 19:38:48,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:48,430 INFO L225 Difference]: With dead ends: 27576 [2025-03-16 19:38:48,430 INFO L226 Difference]: Without dead ends: 13834 [2025-03-16 19:38:48,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:38:48,439 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 358 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:48,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 606 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:48,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13834 states. [2025-03-16 19:38:48,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13834 to 13832. [2025-03-16 19:38:48,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13832 states, 13831 states have (on average 1.5813751717157112) internal successors, (21872), 13831 states have internal predecessors, (21872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:48,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13832 states to 13832 states and 21872 transitions. [2025-03-16 19:38:48,602 INFO L78 Accepts]: Start accepts. Automaton has 13832 states and 21872 transitions. Word has length 72 [2025-03-16 19:38:48,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:48,602 INFO L471 AbstractCegarLoop]: Abstraction has 13832 states and 21872 transitions. [2025-03-16 19:38:48,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:48,603 INFO L276 IsEmpty]: Start isEmpty. Operand 13832 states and 21872 transitions. [2025-03-16 19:38:48,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 19:38:48,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:48,604 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] [2025-03-16 19:38:48,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:38:48,604 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:48,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:48,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1895763982, now seen corresponding path program 1 times [2025-03-16 19:38:48,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:48,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618188505] [2025-03-16 19:38:48,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:48,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:48,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 19:38:48,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 19:38:48,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:48,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:48,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:48,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:48,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618188505] [2025-03-16 19:38:48,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618188505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:48,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:48,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:38:48,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638321045] [2025-03-16 19:38:48,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:48,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:38:48,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:48,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:38:48,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:38:48,751 INFO L87 Difference]: Start difference. First operand 13832 states and 21872 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:48,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:48,939 INFO L93 Difference]: Finished difference Result 39889 states and 63221 transitions. [2025-03-16 19:38:48,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:38:48,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-03-16 19:38:48,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:48,986 INFO L225 Difference]: With dead ends: 39889 [2025-03-16 19:38:48,986 INFO L226 Difference]: Without dead ends: 26147 [2025-03-16 19:38:49,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:38:49,010 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 352 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:49,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 611 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:38:49,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26147 states. [2025-03-16 19:38:49,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26147 to 26145. [2025-03-16 19:38:49,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26145 states, 26144 states have (on average 1.5704559363525092) internal successors, (41058), 26144 states have internal predecessors, (41058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:49,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26145 states to 26145 states and 41058 transitions. [2025-03-16 19:38:49,409 INFO L78 Accepts]: Start accepts. Automaton has 26145 states and 41058 transitions. Word has length 75 [2025-03-16 19:38:49,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:49,409 INFO L471 AbstractCegarLoop]: Abstraction has 26145 states and 41058 transitions. [2025-03-16 19:38:49,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:49,409 INFO L276 IsEmpty]: Start isEmpty. Operand 26145 states and 41058 transitions. [2025-03-16 19:38:49,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:38:49,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:49,410 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] [2025-03-16 19:38:49,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:38:49,410 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:49,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:49,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1361814069, now seen corresponding path program 1 times [2025-03-16 19:38:49,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:49,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274103405] [2025-03-16 19:38:49,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:49,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:49,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:38:49,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:38:49,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:49,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:49,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:49,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:49,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274103405] [2025-03-16 19:38:49,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274103405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:49,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:49,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:38:49,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893890379] [2025-03-16 19:38:49,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:49,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:38:49,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:49,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:38:49,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:38:49,743 INFO L87 Difference]: Start difference. First operand 26145 states and 41058 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:49,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:49,827 INFO L93 Difference]: Finished difference Result 26921 states and 42220 transitions. [2025-03-16 19:38:49,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:38:49,827 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-03-16 19:38:49,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:49,868 INFO L225 Difference]: With dead ends: 26921 [2025-03-16 19:38:49,869 INFO L226 Difference]: Without dead ends: 26919 [2025-03-16 19:38:49,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:38:49,879 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 0 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:49,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 863 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:49,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26919 states. [2025-03-16 19:38:50,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26919 to 26919. [2025-03-16 19:38:50,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26919 states, 26918 states have (on average 1.5537187012408054) internal successors, (41823), 26918 states have internal predecessors, (41823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:50,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26919 states to 26919 states and 41823 transitions. [2025-03-16 19:38:50,162 INFO L78 Accepts]: Start accepts. Automaton has 26919 states and 41823 transitions. Word has length 76 [2025-03-16 19:38:50,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:50,163 INFO L471 AbstractCegarLoop]: Abstraction has 26919 states and 41823 transitions. [2025-03-16 19:38:50,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:50,163 INFO L276 IsEmpty]: Start isEmpty. Operand 26919 states and 41823 transitions. [2025-03-16 19:38:50,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:38:50,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:50,165 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:50,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:38:50,165 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:50,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:50,165 INFO L85 PathProgramCache]: Analyzing trace with hash -267533140, now seen corresponding path program 1 times [2025-03-16 19:38:50,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:50,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530134174] [2025-03-16 19:38:50,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:50,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:50,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:38:50,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:38:50,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:50,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:50,384 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:38:50,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:50,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530134174] [2025-03-16 19:38:50,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530134174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:50,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:50,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:38:50,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202466443] [2025-03-16 19:38:50,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:50,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:38:50,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:50,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:38:50,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:38:50,387 INFO L87 Difference]: Start difference. First operand 26919 states and 41823 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:50,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:50,626 INFO L93 Difference]: Finished difference Result 70171 states and 109183 transitions. [2025-03-16 19:38:50,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:38:50,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 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 100 [2025-03-16 19:38:50,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:50,739 INFO L225 Difference]: With dead ends: 70171 [2025-03-16 19:38:50,740 INFO L226 Difference]: Without dead ends: 54604 [2025-03-16 19:38:50,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-16 19:38:50,773 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 543 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:50,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 1087 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:38:50,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54604 states. [2025-03-16 19:38:51,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54604 to 41815. [2025-03-16 19:38:51,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41815 states, 41814 states have (on average 1.55127469268666) internal successors, (64865), 41814 states have internal predecessors, (64865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:51,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41815 states to 41815 states and 64865 transitions. [2025-03-16 19:38:51,359 INFO L78 Accepts]: Start accepts. Automaton has 41815 states and 64865 transitions. Word has length 100 [2025-03-16 19:38:51,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:51,360 INFO L471 AbstractCegarLoop]: Abstraction has 41815 states and 64865 transitions. [2025-03-16 19:38:51,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:51,360 INFO L276 IsEmpty]: Start isEmpty. Operand 41815 states and 64865 transitions. [2025-03-16 19:38:51,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:38:51,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:51,362 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:51,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:38:51,362 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:51,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:51,363 INFO L85 PathProgramCache]: Analyzing trace with hash -2032374196, now seen corresponding path program 1 times [2025-03-16 19:38:51,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:51,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175168849] [2025-03-16 19:38:51,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:51,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:51,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:38:51,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:38:51,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:51,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:51,474 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 19:38:51,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:51,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175168849] [2025-03-16 19:38:51,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175168849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:51,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:51,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:38:51,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737100599] [2025-03-16 19:38:51,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:51,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:38:51,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:51,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:38:51,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:38:51,475 INFO L87 Difference]: Start difference. First operand 41815 states and 64865 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:52,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:52,002 INFO L93 Difference]: Finished difference Result 76826 states and 119615 transitions. [2025-03-16 19:38:52,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:38:52,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 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 100 [2025-03-16 19:38:52,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:52,092 INFO L225 Difference]: With dead ends: 76826 [2025-03-16 19:38:52,093 INFO L226 Difference]: Without dead ends: 64508 [2025-03-16 19:38:52,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-16 19:38:52,113 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 550 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:52,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 995 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:38:52,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64508 states. [2025-03-16 19:38:52,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64508 to 58324. [2025-03-16 19:38:52,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58324 states, 58323 states have (on average 1.5503832107401883) internal successors, (90423), 58323 states have internal predecessors, (90423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:52,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58324 states to 58324 states and 90423 transitions. [2025-03-16 19:38:52,985 INFO L78 Accepts]: Start accepts. Automaton has 58324 states and 90423 transitions. Word has length 100 [2025-03-16 19:38:52,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:52,987 INFO L471 AbstractCegarLoop]: Abstraction has 58324 states and 90423 transitions. [2025-03-16 19:38:52,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:52,987 INFO L276 IsEmpty]: Start isEmpty. Operand 58324 states and 90423 transitions. [2025-03-16 19:38:52,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:38:52,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:52,989 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:52,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:38:52,989 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:52,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:52,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1641205740, now seen corresponding path program 1 times [2025-03-16 19:38:52,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:52,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033478038] [2025-03-16 19:38:52,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:52,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:53,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:38:53,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:38:53,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:53,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:53,157 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 19:38:53,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:53,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033478038] [2025-03-16 19:38:53,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033478038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:53,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:53,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:38:53,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682412634] [2025-03-16 19:38:53,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:53,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:38:53,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:53,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:38:53,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:38:53,159 INFO L87 Difference]: Start difference. First operand 58324 states and 90423 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:53,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:53,457 INFO L93 Difference]: Finished difference Result 81714 states and 127239 transitions. [2025-03-16 19:38:53,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:38:53,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 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 100 [2025-03-16 19:38:53,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:53,562 INFO L225 Difference]: With dead ends: 81714 [2025-03-16 19:38:53,563 INFO L226 Difference]: Without dead ends: 69396 [2025-03-16 19:38:53,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-16 19:38:53,596 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 558 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:53,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 1023 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:38:53,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69396 states. [2025-03-16 19:38:54,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69396 to 66938. [2025-03-16 19:38:54,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66938 states, 66937 states have (on average 1.5520713506730208) internal successors, (103891), 66937 states have internal predecessors, (103891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:54,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66938 states to 66938 states and 103891 transitions. [2025-03-16 19:38:54,468 INFO L78 Accepts]: Start accepts. Automaton has 66938 states and 103891 transitions. Word has length 100 [2025-03-16 19:38:54,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:54,468 INFO L471 AbstractCegarLoop]: Abstraction has 66938 states and 103891 transitions. [2025-03-16 19:38:54,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:54,468 INFO L276 IsEmpty]: Start isEmpty. Operand 66938 states and 103891 transitions. [2025-03-16 19:38:54,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:38:54,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:54,470 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:54,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:38:54,471 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:54,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:54,471 INFO L85 PathProgramCache]: Analyzing trace with hash 298286140, now seen corresponding path program 1 times [2025-03-16 19:38:54,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:54,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963092902] [2025-03-16 19:38:54,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:54,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:54,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:38:54,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:38:54,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:54,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:54,559 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:38:54,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:54,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963092902] [2025-03-16 19:38:54,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963092902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:54,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:54,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:38:54,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945179470] [2025-03-16 19:38:54,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:54,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:38:54,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:54,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:38:54,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:38:54,561 INFO L87 Difference]: Start difference. First operand 66938 states and 103891 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:54,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:54,855 INFO L93 Difference]: Finished difference Result 115184 states and 179336 transitions. [2025-03-16 19:38:54,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:38:54,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-16 19:38:54,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:55,010 INFO L225 Difference]: With dead ends: 115184 [2025-03-16 19:38:55,010 INFO L226 Difference]: Without dead ends: 89713 [2025-03-16 19:38:55,060 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-16 19:38:55,061 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 249 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:55,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 701 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:55,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89713 states. [2025-03-16 19:38:56,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89713 to 87257. [2025-03-16 19:38:56,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87257 states, 87256 states have (on average 1.5500481342257266) internal successors, (135251), 87256 states have internal predecessors, (135251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:56,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87257 states to 87257 states and 135251 transitions. [2025-03-16 19:38:56,402 INFO L78 Accepts]: Start accepts. Automaton has 87257 states and 135251 transitions. Word has length 101 [2025-03-16 19:38:56,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:56,402 INFO L471 AbstractCegarLoop]: Abstraction has 87257 states and 135251 transitions. [2025-03-16 19:38:56,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:56,402 INFO L276 IsEmpty]: Start isEmpty. Operand 87257 states and 135251 transitions. [2025-03-16 19:38:56,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:38:56,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:56,405 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:56,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:38:56,405 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:56,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:56,405 INFO L85 PathProgramCache]: Analyzing trace with hash -519362310, now seen corresponding path program 1 times [2025-03-16 19:38:56,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:56,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416855494] [2025-03-16 19:38:56,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:56,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:56,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:38:56,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:38:56,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:56,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:56,661 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:38:56,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:56,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416855494] [2025-03-16 19:38:56,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416855494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:56,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:56,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:38:56,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091286523] [2025-03-16 19:38:56,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:56,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:38:56,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:56,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:38:56,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:56,662 INFO L87 Difference]: Start difference. First operand 87257 states and 135251 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:57,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:57,151 INFO L93 Difference]: Finished difference Result 199895 states and 310159 transitions. [2025-03-16 19:38:57,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:38:57,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-16 19:38:57,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:57,418 INFO L225 Difference]: With dead ends: 199895 [2025-03-16 19:38:57,418 INFO L226 Difference]: Without dead ends: 154173 [2025-03-16 19:38:57,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:57,497 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 110 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:57,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 409 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:57,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154173 states. [2025-03-16 19:38:59,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154173 to 153895. [2025-03-16 19:38:59,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153895 states, 153894 states have (on average 1.5477406526570237) internal successors, (238188), 153894 states have internal predecessors, (238188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:59,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153895 states to 153895 states and 238188 transitions. [2025-03-16 19:38:59,506 INFO L78 Accepts]: Start accepts. Automaton has 153895 states and 238188 transitions. Word has length 101 [2025-03-16 19:38:59,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:59,506 INFO L471 AbstractCegarLoop]: Abstraction has 153895 states and 238188 transitions. [2025-03-16 19:38:59,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:59,506 INFO L276 IsEmpty]: Start isEmpty. Operand 153895 states and 238188 transitions. [2025-03-16 19:38:59,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 19:38:59,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:59,509 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:59,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:38:59,509 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:59,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:59,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1414550434, now seen corresponding path program 1 times [2025-03-16 19:38:59,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:59,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765030917] [2025-03-16 19:38:59,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:59,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:59,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 19:38:59,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 19:38:59,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:59,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:59,886 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:59,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:59,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765030917] [2025-03-16 19:38:59,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765030917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:59,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:59,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:38:59,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460726478] [2025-03-16 19:38:59,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:59,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:38:59,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:59,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:38:59,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:59,887 INFO L87 Difference]: Start difference. First operand 153895 states and 238188 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:01,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:39:01,459 INFO L93 Difference]: Finished difference Result 452042 states and 698754 transitions. [2025-03-16 19:39:01,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:39:01,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2025-03-16 19:39:01,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:39:01,937 INFO L225 Difference]: With dead ends: 452042 [2025-03-16 19:39:01,937 INFO L226 Difference]: Without dead ends: 298223 [2025-03-16 19:39:02,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:39:02,011 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 152 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:39:02,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 504 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:39:02,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298223 states. [2025-03-16 19:39:05,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298223 to 298221. [2025-03-16 19:39:05,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298221 states, 298220 states have (on average 1.535661592113205) internal successors, (457965), 298220 states have internal predecessors, (457965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:06,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298221 states to 298221 states and 457965 transitions. [2025-03-16 19:39:06,097 INFO L78 Accepts]: Start accepts. Automaton has 298221 states and 457965 transitions. Word has length 102 [2025-03-16 19:39:06,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:39:06,097 INFO L471 AbstractCegarLoop]: Abstraction has 298221 states and 457965 transitions. [2025-03-16 19:39:06,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:06,098 INFO L276 IsEmpty]: Start isEmpty. Operand 298221 states and 457965 transitions. [2025-03-16 19:39:06,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 19:39:06,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:39:06,106 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:39:06,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:39:06,106 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:39:06,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:39:06,107 INFO L85 PathProgramCache]: Analyzing trace with hash -172735806, now seen corresponding path program 1 times [2025-03-16 19:39:06,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:39:06,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402576449] [2025-03-16 19:39:06,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:39:06,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:39:06,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 19:39:06,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 19:39:06,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:39:06,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:39:06,160 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:39:06,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:39:06,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402576449] [2025-03-16 19:39:06,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402576449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:39:06,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:39:06,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:39:06,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997412218] [2025-03-16 19:39:06,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:39:06,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:39:06,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:39:06,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:39:06,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:39:06,161 INFO L87 Difference]: Start difference. First operand 298221 states and 457965 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:09,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:39:09,548 INFO L93 Difference]: Finished difference Result 875412 states and 1342342 transitions. [2025-03-16 19:39:09,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:39:09,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2025-03-16 19:39:09,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:39:10,713 INFO L225 Difference]: With dead ends: 875412 [2025-03-16 19:39:10,713 INFO L226 Difference]: Without dead ends: 577346 [2025-03-16 19:39:10,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:39:10,943 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 171 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:39:10,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 542 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:39:11,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577346 states. [2025-03-16 19:39:17,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577346 to 577344. [2025-03-16 19:39:17,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577344 states, 577343 states have (on average 1.5227966737277494) internal successors, (879176), 577343 states have internal predecessors, (879176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:19,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577344 states to 577344 states and 879176 transitions. [2025-03-16 19:39:19,095 INFO L78 Accepts]: Start accepts. Automaton has 577344 states and 879176 transitions. Word has length 102 [2025-03-16 19:39:19,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:39:19,095 INFO L471 AbstractCegarLoop]: Abstraction has 577344 states and 879176 transitions. [2025-03-16 19:39:19,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:39:19,096 INFO L276 IsEmpty]: Start isEmpty. Operand 577344 states and 879176 transitions. [2025-03-16 19:39:19,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 19:39:19,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:39:19,101 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:39:19,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:39:19,101 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:39:19,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:39:19,101 INFO L85 PathProgramCache]: Analyzing trace with hash -651056214, now seen corresponding path program 1 times [2025-03-16 19:39:19,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:39:19,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999592475] [2025-03-16 19:39:19,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:39:19,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:39:19,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 19:39:19,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 19:39:19,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:39:19,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:39:19,759 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:39:19,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:39:19,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999592475] [2025-03-16 19:39:19,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999592475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:39:19,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:39:19,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:39:19,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708993019] [2025-03-16 19:39:19,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:39:19,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:39:19,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:39:19,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:39:19,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:39:19,761 INFO L87 Difference]: Start difference. First operand 577344 states and 879176 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)