./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7b954f9d8b4ab9030eea8f5c4186ef19ab45ad4620470fe362259155373d879e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:26:30,978 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:26:31,022 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:26:31,026 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:26:31,026 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:26:31,039 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:26:31,039 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:26:31,039 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:26:31,040 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:26:31,040 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:26:31,040 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:26:31,040 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:26:31,040 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:26:31,040 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:26:31,040 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:26:31,040 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:26:31,041 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:26:31,041 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:26:31,041 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:26:31,041 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:26:31,041 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:26:31,041 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:26:31,041 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:26:31,041 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:26:31,041 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:26:31,041 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:26:31,041 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:26:31,042 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:26:31,042 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:26:31,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:26:31,042 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:26:31,042 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:26:31,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:26:31,042 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:26:31,042 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:26:31,042 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:26:31,042 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:26:31,043 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:26:31,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:26:31,043 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:26:31,044 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:26:31,044 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:26:31,044 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:26:31,044 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 -> 7b954f9d8b4ab9030eea8f5c4186ef19ab45ad4620470fe362259155373d879e [2025-03-16 19:26:31,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:26:31,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:26:31,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:26:31,281 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:26:31,282 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:26:31,284 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2025-03-16 19:26:32,472 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a49ab16a2/507f47ff595640179cd429f8c9a56424/FLAG19ac8ecba [2025-03-16 19:26:32,723 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:26:32,738 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2025-03-16 19:26:32,755 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a49ab16a2/507f47ff595640179cd429f8c9a56424/FLAG19ac8ecba [2025-03-16 19:26:32,771 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a49ab16a2/507f47ff595640179cd429f8c9a56424 [2025-03-16 19:26:32,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:26:32,774 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:26:32,776 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:26:32,776 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:26:32,779 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:26:32,780 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:26:32" (1/1) ... [2025-03-16 19:26:32,780 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77feebc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:32, skipping insertion in model container [2025-03-16 19:26:32,781 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:26:32" (1/1) ... [2025-03-16 19:26:32,807 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:26:32,948 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c[5339,5352] [2025-03-16 19:26:32,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:26:32,974 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:26:32,999 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c[5339,5352] [2025-03-16 19:26:33,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:26:33,034 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:26:33,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:33 WrapperNode [2025-03-16 19:26:33,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:26:33,036 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:26:33,036 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:26:33,036 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:26:33,040 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:26:33" (1/1) ... [2025-03-16 19:26:33,051 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:26:33" (1/1) ... [2025-03-16 19:26:33,077 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 457 [2025-03-16 19:26:33,078 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:26:33,078 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:26:33,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:26:33,078 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:26:33,087 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:33" (1/1) ... [2025-03-16 19:26:33,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:33" (1/1) ... [2025-03-16 19:26:33,089 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:33" (1/1) ... [2025-03-16 19:26:33,109 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:26:33,111 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:33" (1/1) ... [2025-03-16 19:26:33,111 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:33" (1/1) ... [2025-03-16 19:26:33,116 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:33" (1/1) ... [2025-03-16 19:26:33,119 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:33" (1/1) ... [2025-03-16 19:26:33,119 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:33" (1/1) ... [2025-03-16 19:26:33,120 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:33" (1/1) ... [2025-03-16 19:26:33,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:26:33,122 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:26:33,122 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:26:33,122 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:26:33,123 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:33" (1/1) ... [2025-03-16 19:26:33,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:26:33,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:26:33,153 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:26:33,158 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:26:33,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:26:33,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:26:33,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:26:33,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:26:33,249 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:26:33,250 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:26:33,593 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L349: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-16 19:26:33,593 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L407: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-16 19:26:33,593 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L218: havoc main_~node4__m4~0#1; [2025-03-16 19:26:33,593 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L435: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-16 19:26:33,593 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L493: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-16 19:26:33,593 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L163: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-16 19:26:33,593 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L321: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-16 19:26:33,593 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L182: havoc main_~node2__m2~0#1; [2025-03-16 19:26:33,593 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L521: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-16 19:26:33,593 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L579: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-16 19:26:33,593 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: 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:26:33,594 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L200: havoc main_~node3__m3~0#1; [2025-03-16 19:26:33,616 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-03-16 19:26:33,617 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:26:33,627 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:26:33,629 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:26:33,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:26:33 BoogieIcfgContainer [2025-03-16 19:26:33,629 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:26:33,632 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:26:33,632 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:26:33,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:26:33,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:26:32" (1/3) ... [2025-03-16 19:26:33,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a333864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:26:33, skipping insertion in model container [2025-03-16 19:26:33,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:26:33" (2/3) ... [2025-03-16 19:26:33,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a333864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:26:33, skipping insertion in model container [2025-03-16 19:26:33,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:26:33" (3/3) ... [2025-03-16 19:26:33,639 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2025-03-16 19:26:33,650 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:26:33,651 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c that has 1 procedures, 104 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 19:26:33,695 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:26:33,706 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;@7470c7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:26:33,706 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:26:33,709 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 102 states have (on average 1.7058823529411764) internal successors, (174), 103 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:26:33,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 19:26:33,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:33,715 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] [2025-03-16 19:26:33,715 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:33,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:33,719 INFO L85 PathProgramCache]: Analyzing trace with hash -682132360, now seen corresponding path program 1 times [2025-03-16 19:26:33,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:33,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694521244] [2025-03-16 19:26:33,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:33,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:33,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 19:26:33,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 19:26:33,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:33,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:34,089 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:26:34,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:34,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694521244] [2025-03-16 19:26:34,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694521244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:34,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:34,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:26:34,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821169310] [2025-03-16 19:26:34,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:34,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:26:34,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:34,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:26:34,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:26:34,111 INFO L87 Difference]: Start difference. First operand has 104 states, 102 states have (on average 1.7058823529411764) internal successors, (174), 103 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states 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:26:34,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:34,151 INFO L93 Difference]: Finished difference Result 244 states and 394 transitions. [2025-03-16 19:26:34,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:26:34,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-03-16 19:26:34,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:34,159 INFO L225 Difference]: With dead ends: 244 [2025-03-16 19:26:34,159 INFO L226 Difference]: Without dead ends: 160 [2025-03-16 19:26:34,164 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:26:34,165 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 121 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:34,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 363 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:26:34,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-16 19:26:34,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2025-03-16 19:26:34,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.5031847133757963) internal successors, (236), 157 states have internal predecessors, (236), 0 states have call successors, (0), 0 states 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:26:34,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 236 transitions. [2025-03-16 19:26:34,203 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 236 transitions. Word has length 47 [2025-03-16 19:26:34,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:34,203 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 236 transitions. [2025-03-16 19:26:34,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states 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:26:34,203 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 236 transitions. [2025-03-16 19:26:34,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-16 19:26:34,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:34,204 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] [2025-03-16 19:26:34,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:26:34,204 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:34,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:34,205 INFO L85 PathProgramCache]: Analyzing trace with hash -549184468, now seen corresponding path program 1 times [2025-03-16 19:26:34,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:34,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887943132] [2025-03-16 19:26:34,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:34,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:34,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-16 19:26:34,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-16 19:26:34,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:34,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:34,326 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:26:34,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:34,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887943132] [2025-03-16 19:26:34,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887943132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:34,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:34,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:26:34,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328829607] [2025-03-16 19:26:34,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:34,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:26:34,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:34,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:26:34,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:26:34,328 INFO L87 Difference]: Start difference. First operand 158 states and 236 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states 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:26:34,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:34,360 INFO L93 Difference]: Finished difference Result 390 states and 604 transitions. [2025-03-16 19:26:34,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:26:34,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2025-03-16 19:26:34,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:34,362 INFO L225 Difference]: With dead ends: 390 [2025-03-16 19:26:34,365 INFO L226 Difference]: Without dead ends: 258 [2025-03-16 19:26:34,365 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:26:34,366 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 98 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 306 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:26:34,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 306 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:26:34,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-16 19:26:34,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2025-03-16 19:26:34,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.5333333333333334) internal successors, (391), 255 states have internal predecessors, (391), 0 states have call successors, (0), 0 states 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:26:34,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 391 transitions. [2025-03-16 19:26:34,386 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 391 transitions. Word has length 48 [2025-03-16 19:26:34,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:34,387 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 391 transitions. [2025-03-16 19:26:34,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states 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:26:34,387 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 391 transitions. [2025-03-16 19:26:34,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-16 19:26:34,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:34,388 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:26:34,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:26:34,389 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:34,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:34,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1873508306, now seen corresponding path program 1 times [2025-03-16 19:26:34,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:34,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464017427] [2025-03-16 19:26:34,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:34,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:34,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-16 19:26:34,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-16 19:26:34,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:34,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:34,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:34,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:34,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464017427] [2025-03-16 19:26:34,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464017427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:34,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:34,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:26:34,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291230101] [2025-03-16 19:26:34,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:34,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:26:34,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:34,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:26:34,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:26:34,476 INFO L87 Difference]: Start difference. First operand 256 states and 391 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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:26:34,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:34,502 INFO L93 Difference]: Finished difference Result 652 states and 1017 transitions. [2025-03-16 19:26:34,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:26:34,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2025-03-16 19:26:34,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:34,504 INFO L225 Difference]: With dead ends: 652 [2025-03-16 19:26:34,505 INFO L226 Difference]: Without dead ends: 422 [2025-03-16 19:26:34,506 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:26:34,507 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 93 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 291 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:26:34,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 291 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:26:34,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-03-16 19:26:34,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 420. [2025-03-16 19:26:34,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 1.5441527446300716) internal successors, (647), 419 states have internal predecessors, (647), 0 states have call successors, (0), 0 states 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:26:34,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 647 transitions. [2025-03-16 19:26:34,553 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 647 transitions. Word has length 49 [2025-03-16 19:26:34,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:34,553 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 647 transitions. [2025-03-16 19:26:34,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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:26:34,553 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 647 transitions. [2025-03-16 19:26:34,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 19:26:34,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:34,554 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] [2025-03-16 19:26:34,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:26:34,555 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:34,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:34,555 INFO L85 PathProgramCache]: Analyzing trace with hash 353899206, now seen corresponding path program 1 times [2025-03-16 19:26:34,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:34,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177252521] [2025-03-16 19:26:34,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:34,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:34,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 19:26:34,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 19:26:34,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:34,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:34,700 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:26:34,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:34,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177252521] [2025-03-16 19:26:34,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177252521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:34,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:34,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:26:34,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502635847] [2025-03-16 19:26:34,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:34,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:26:34,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:34,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:26:34,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:26:34,703 INFO L87 Difference]: Start difference. First operand 420 states and 647 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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:26:34,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:34,812 INFO L93 Difference]: Finished difference Result 2390 states and 3752 transitions. [2025-03-16 19:26:34,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:26:34,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2025-03-16 19:26:34,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:34,825 INFO L225 Difference]: With dead ends: 2390 [2025-03-16 19:26:34,827 INFO L226 Difference]: Without dead ends: 1996 [2025-03-16 19:26:34,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:26:34,831 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 849 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:34,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 1269 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:26:34,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2025-03-16 19:26:34,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 812. [2025-03-16 19:26:34,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 811 states have (on average 1.5425400739827373) internal successors, (1251), 811 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states 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:26:34,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1251 transitions. [2025-03-16 19:26:34,878 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1251 transitions. Word has length 50 [2025-03-16 19:26:34,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:34,878 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1251 transitions. [2025-03-16 19:26:34,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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:26:34,878 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1251 transitions. [2025-03-16 19:26:34,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 19:26:34,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:34,880 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] [2025-03-16 19:26:34,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:26:34,880 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:34,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:34,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1913071134, now seen corresponding path program 1 times [2025-03-16 19:26:34,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:34,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320905063] [2025-03-16 19:26:34,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:34,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:34,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 19:26:34,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 19:26:34,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:34,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:35,054 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:26:35,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:35,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320905063] [2025-03-16 19:26:35,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320905063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:35,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:35,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:26:35,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80167347] [2025-03-16 19:26:35,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:35,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:26:35,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:35,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:26:35,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:26:35,056 INFO L87 Difference]: Start difference. First operand 812 states and 1251 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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:26:35,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:35,134 INFO L93 Difference]: Finished difference Result 3548 states and 5479 transitions. [2025-03-16 19:26:35,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:26:35,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-03-16 19:26:35,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:35,143 INFO L225 Difference]: With dead ends: 3548 [2025-03-16 19:26:35,143 INFO L226 Difference]: Without dead ends: 2762 [2025-03-16 19:26:35,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:26:35,146 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 532 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:35,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 536 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:26:35,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2762 states. [2025-03-16 19:26:35,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2762 to 2756. [2025-03-16 19:26:35,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2756 states, 2755 states have (on average 1.5372050816696914) internal successors, (4235), 2755 states have internal predecessors, (4235), 0 states have call successors, (0), 0 states 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:26:35,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2756 states to 2756 states and 4235 transitions. [2025-03-16 19:26:35,204 INFO L78 Accepts]: Start accepts. Automaton has 2756 states and 4235 transitions. Word has length 51 [2025-03-16 19:26:35,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:35,205 INFO L471 AbstractCegarLoop]: Abstraction has 2756 states and 4235 transitions. [2025-03-16 19:26:35,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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:26:35,205 INFO L276 IsEmpty]: Start isEmpty. Operand 2756 states and 4235 transitions. [2025-03-16 19:26:35,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 19:26:35,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:35,208 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] [2025-03-16 19:26:35,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:26:35,210 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:35,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:35,210 INFO L85 PathProgramCache]: Analyzing trace with hash 144561682, now seen corresponding path program 1 times [2025-03-16 19:26:35,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:35,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918045167] [2025-03-16 19:26:35,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:35,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:35,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 19:26:35,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 19:26:35,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:35,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:35,289 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:26:35,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:35,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918045167] [2025-03-16 19:26:35,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918045167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:35,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:35,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:26:35,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479687849] [2025-03-16 19:26:35,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:35,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:26:35,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:35,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:26:35,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:26:35,292 INFO L87 Difference]: Start difference. First operand 2756 states and 4235 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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:26:35,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:35,343 INFO L93 Difference]: Finished difference Result 7512 states and 11501 transitions. [2025-03-16 19:26:35,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:26:35,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-03-16 19:26:35,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:35,360 INFO L225 Difference]: With dead ends: 7512 [2025-03-16 19:26:35,360 INFO L226 Difference]: Without dead ends: 4782 [2025-03-16 19:26:35,393 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:26:35,394 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 107 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 354 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:26:35,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 354 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:26:35,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4782 states. [2025-03-16 19:26:35,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4782 to 4780. [2025-03-16 19:26:35,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4780 states, 4779 states have (on average 1.512241054613936) internal successors, (7227), 4779 states have internal predecessors, (7227), 0 states have call successors, (0), 0 states 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:26:35,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4780 states to 4780 states and 7227 transitions. [2025-03-16 19:26:35,493 INFO L78 Accepts]: Start accepts. Automaton has 4780 states and 7227 transitions. Word has length 51 [2025-03-16 19:26:35,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:35,493 INFO L471 AbstractCegarLoop]: Abstraction has 4780 states and 7227 transitions. [2025-03-16 19:26:35,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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:26:35,494 INFO L276 IsEmpty]: Start isEmpty. Operand 4780 states and 7227 transitions. [2025-03-16 19:26:35,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 19:26:35,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:35,495 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] [2025-03-16 19:26:35,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:26:35,496 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:35,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:35,496 INFO L85 PathProgramCache]: Analyzing trace with hash -211833692, now seen corresponding path program 1 times [2025-03-16 19:26:35,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:35,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745342340] [2025-03-16 19:26:35,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:35,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:35,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 19:26:35,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 19:26:35,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:35,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:35,798 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:26:35,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:35,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745342340] [2025-03-16 19:26:35,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745342340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:35,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:35,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:26:35,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127103394] [2025-03-16 19:26:35,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:35,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:26:35,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:35,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:26:35,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:26:35,799 INFO L87 Difference]: Start difference. First operand 4780 states and 7227 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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:26:35,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:35,847 INFO L93 Difference]: Finished difference Result 5038 states and 7612 transitions. [2025-03-16 19:26:35,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:26:35,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-03-16 19:26:35,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:35,864 INFO L225 Difference]: With dead ends: 5038 [2025-03-16 19:26:35,865 INFO L226 Difference]: Without dead ends: 5036 [2025-03-16 19:26:35,867 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:26:35,868 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:35,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 557 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:26:35,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5036 states. [2025-03-16 19:26:35,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5036 to 5036. [2025-03-16 19:26:35,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5036 states, 5035 states have (on average 1.486196623634558) internal successors, (7483), 5035 states have internal predecessors, (7483), 0 states have call successors, (0), 0 states 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:26:35,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5036 states to 5036 states and 7483 transitions. [2025-03-16 19:26:35,967 INFO L78 Accepts]: Start accepts. Automaton has 5036 states and 7483 transitions. Word has length 53 [2025-03-16 19:26:35,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:35,968 INFO L471 AbstractCegarLoop]: Abstraction has 5036 states and 7483 transitions. [2025-03-16 19:26:35,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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:26:35,969 INFO L276 IsEmpty]: Start isEmpty. Operand 5036 states and 7483 transitions. [2025-03-16 19:26:35,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 19:26:35,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:35,970 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] [2025-03-16 19:26:35,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:26:35,970 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:35,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:35,970 INFO L85 PathProgramCache]: Analyzing trace with hash 2027858756, now seen corresponding path program 1 times [2025-03-16 19:26:35,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:35,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982950197] [2025-03-16 19:26:35,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:35,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:35,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-16 19:26:35,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 19:26:35,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:35,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:36,040 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:26:36,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:36,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982950197] [2025-03-16 19:26:36,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982950197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:36,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:36,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:26:36,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92914231] [2025-03-16 19:26:36,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:36,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:26:36,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:36,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:26:36,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:26:36,042 INFO L87 Difference]: Start difference. First operand 5036 states and 7483 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states 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:26:36,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:36,082 INFO L93 Difference]: Finished difference Result 12170 states and 18083 transitions. [2025-03-16 19:26:36,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:26:36,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-03-16 19:26:36,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:36,103 INFO L225 Difference]: With dead ends: 12170 [2025-03-16 19:26:36,103 INFO L226 Difference]: Without dead ends: 7160 [2025-03-16 19:26:36,111 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:26:36,111 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 83 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:36,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 261 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:26:36,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7160 states. [2025-03-16 19:26:36,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7160 to 7158. [2025-03-16 19:26:36,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7158 states, 7157 states have (on average 1.4767360625960597) internal successors, (10569), 7157 states have internal predecessors, (10569), 0 states have call successors, (0), 0 states 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:26:36,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7158 states to 7158 states and 10569 transitions. [2025-03-16 19:26:36,230 INFO L78 Accepts]: Start accepts. Automaton has 7158 states and 10569 transitions. Word has length 54 [2025-03-16 19:26:36,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:36,230 INFO L471 AbstractCegarLoop]: Abstraction has 7158 states and 10569 transitions. [2025-03-16 19:26:36,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states 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:26:36,231 INFO L276 IsEmpty]: Start isEmpty. Operand 7158 states and 10569 transitions. [2025-03-16 19:26:36,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 19:26:36,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:36,235 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:26:36,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:26:36,235 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:36,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:36,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1160728482, now seen corresponding path program 1 times [2025-03-16 19:26:36,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:36,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837416361] [2025-03-16 19:26:36,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:36,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:36,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 19:26:36,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 19:26:36,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:36,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:36,495 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:36,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:36,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837416361] [2025-03-16 19:26:36,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837416361] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:26:36,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64364297] [2025-03-16 19:26:36,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:36,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:26:36,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:26:36,498 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:26:36,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 19:26:36,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 19:26:36,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 19:26:36,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:36,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:36,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-16 19:26:36,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:26:37,085 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:37,085 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:26:37,695 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:37,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64364297] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:26:37,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:26:37,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2025-03-16 19:26:37,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4466483] [2025-03-16 19:26:37,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:26:37,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-16 19:26:37,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:37,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-16 19:26:37,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:26:37,697 INFO L87 Difference]: Start difference. First operand 7158 states and 10569 transitions. Second operand has 20 states, 20 states have (on average 10.85) internal successors, (217), 20 states have internal predecessors, (217), 0 states have call successors, (0), 0 states 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:26:43,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:43,620 INFO L93 Difference]: Finished difference Result 38804 states and 56733 transitions. [2025-03-16 19:26:43,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2025-03-16 19:26:43,620 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 10.85) internal successors, (217), 20 states have internal predecessors, (217), 0 states have call successors, (0), 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:26:43,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:43,682 INFO L225 Difference]: With dead ends: 38804 [2025-03-16 19:26:43,682 INFO L226 Difference]: Without dead ends: 31674 [2025-03-16 19:26:43,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6890 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=3139, Invalid=15221, Unknown=0, NotChecked=0, Total=18360 [2025-03-16 19:26:43,699 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 7001 mSDsluCounter, 2147 mSDsCounter, 0 mSdLazyCounter, 2444 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7001 SdHoareTripleChecker+Valid, 2275 SdHoareTripleChecker+Invalid, 2546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 2444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:43,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7001 Valid, 2275 Invalid, 2546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 2444 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 19:26:43,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31674 states. [2025-03-16 19:26:43,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31674 to 23803. [2025-03-16 19:26:44,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23803 states, 23802 states have (on average 1.4542055289471474) internal successors, (34613), 23802 states have internal predecessors, (34613), 0 states have call successors, (0), 0 states 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:26:44,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23803 states to 23803 states and 34613 transitions. [2025-03-16 19:26:44,134 INFO L78 Accepts]: Start accepts. Automaton has 23803 states and 34613 transitions. Word has length 75 [2025-03-16 19:26:44,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:44,134 INFO L471 AbstractCegarLoop]: Abstraction has 23803 states and 34613 transitions. [2025-03-16 19:26:44,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 10.85) internal successors, (217), 20 states have internal predecessors, (217), 0 states have call successors, (0), 0 states 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:26:44,135 INFO L276 IsEmpty]: Start isEmpty. Operand 23803 states and 34613 transitions. [2025-03-16 19:26:44,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:26:44,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:44,137 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:26:44,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 19:26:44,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:26:44,338 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:44,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:44,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1686774877, now seen corresponding path program 1 times [2025-03-16 19:26:44,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:44,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116587017] [2025-03-16 19:26:44,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:44,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:44,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:26:44,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:26:44,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:44,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:44,392 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:44,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:44,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116587017] [2025-03-16 19:26:44,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116587017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:44,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:44,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:26:44,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75102398] [2025-03-16 19:26:44,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:44,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:26:44,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:44,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:26:44,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:26:44,394 INFO L87 Difference]: Start difference. First operand 23803 states and 34613 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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:26:44,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:44,490 INFO L93 Difference]: Finished difference Result 60035 states and 87225 transitions. [2025-03-16 19:26:44,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:26:44,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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:26:44,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:44,556 INFO L225 Difference]: With dead ends: 60035 [2025-03-16 19:26:44,556 INFO L226 Difference]: Without dead ends: 41079 [2025-03-16 19:26:44,580 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:26:44,581 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 80 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:44,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 285 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:26:44,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41079 states. [2025-03-16 19:26:45,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41079 to 41077. [2025-03-16 19:26:45,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41077 states, 41076 states have (on average 1.4396728016359919) internal successors, (59136), 41076 states have internal predecessors, (59136), 0 states have call successors, (0), 0 states 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:26:45,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41077 states to 41077 states and 59136 transitions. [2025-03-16 19:26:45,191 INFO L78 Accepts]: Start accepts. Automaton has 41077 states and 59136 transitions. Word has length 76 [2025-03-16 19:26:45,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:45,192 INFO L471 AbstractCegarLoop]: Abstraction has 41077 states and 59136 transitions. [2025-03-16 19:26:45,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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:26:45,192 INFO L276 IsEmpty]: Start isEmpty. Operand 41077 states and 59136 transitions. [2025-03-16 19:26:45,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:26:45,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:45,199 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:26:45,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:26:45,199 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:45,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:45,200 INFO L85 PathProgramCache]: Analyzing trace with hash 634652795, now seen corresponding path program 1 times [2025-03-16 19:26:45,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:45,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277581453] [2025-03-16 19:26:45,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:45,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:45,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:26:45,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:26:45,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:45,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:45,246 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:45,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:45,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277581453] [2025-03-16 19:26:45,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277581453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:45,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:45,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:26:45,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261138546] [2025-03-16 19:26:45,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:45,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:26:45,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:45,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:26:45,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:26:45,247 INFO L87 Difference]: Start difference. First operand 41077 states and 59136 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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:26:45,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:45,577 INFO L93 Difference]: Finished difference Result 102917 states and 147408 transitions. [2025-03-16 19:26:45,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:26:45,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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:26:45,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:45,658 INFO L225 Difference]: With dead ends: 102917 [2025-03-16 19:26:45,658 INFO L226 Difference]: Without dead ends: 66856 [2025-03-16 19:26:45,695 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:26:45,696 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 80 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:45,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 288 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:26:45,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66856 states. [2025-03-16 19:26:46,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66856 to 65414. [2025-03-16 19:26:46,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65414 states, 65413 states have (on average 1.4184336446883647) internal successors, (92784), 65413 states have internal predecessors, (92784), 0 states have call successors, (0), 0 states 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:26:46,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65414 states to 65414 states and 92784 transitions. [2025-03-16 19:26:46,801 INFO L78 Accepts]: Start accepts. Automaton has 65414 states and 92784 transitions. Word has length 76 [2025-03-16 19:26:46,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:46,801 INFO L471 AbstractCegarLoop]: Abstraction has 65414 states and 92784 transitions. [2025-03-16 19:26:46,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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:26:46,801 INFO L276 IsEmpty]: Start isEmpty. Operand 65414 states and 92784 transitions. [2025-03-16 19:26:46,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:26:46,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:46,808 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:26:46,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:26:46,809 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:46,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:46,810 INFO L85 PathProgramCache]: Analyzing trace with hash 299940501, now seen corresponding path program 1 times [2025-03-16 19:26:46,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:46,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714797598] [2025-03-16 19:26:46,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:46,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:46,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:26:46,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:26:46,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:46,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:46,933 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 19:26:46,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:46,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714797598] [2025-03-16 19:26:46,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714797598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:46,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:46,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:26:46,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377867641] [2025-03-16 19:26:46,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:46,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:26:46,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:46,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:26:46,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:26:46,935 INFO L87 Difference]: Start difference. First operand 65414 states and 92784 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states 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:26:47,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:47,520 INFO L93 Difference]: Finished difference Result 160497 states and 229355 transitions. [2025-03-16 19:26:47,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:26:47,521 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 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:26:47,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:47,719 INFO L225 Difference]: With dead ends: 160497 [2025-03-16 19:26:47,719 INFO L226 Difference]: Without dead ends: 135519 [2025-03-16 19:26:47,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:26:47,754 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 712 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:47,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 877 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:26:47,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135519 states. [2025-03-16 19:26:48,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135519 to 89899. [2025-03-16 19:26:48,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89899 states, 89898 states have (on average 1.414024783643685) internal successors, (127118), 89898 states have internal predecessors, (127118), 0 states have call successors, (0), 0 states 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:26:48,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89899 states to 89899 states and 127118 transitions. [2025-03-16 19:26:48,996 INFO L78 Accepts]: Start accepts. Automaton has 89899 states and 127118 transitions. Word has length 76 [2025-03-16 19:26:48,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:48,997 INFO L471 AbstractCegarLoop]: Abstraction has 89899 states and 127118 transitions. [2025-03-16 19:26:48,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states 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:26:48,997 INFO L276 IsEmpty]: Start isEmpty. Operand 89899 states and 127118 transitions. [2025-03-16 19:26:49,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:26:49,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:49,002 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:26:49,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:26:49,003 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:49,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:49,003 INFO L85 PathProgramCache]: Analyzing trace with hash -302085713, now seen corresponding path program 1 times [2025-03-16 19:26:49,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:49,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102672943] [2025-03-16 19:26:49,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:49,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:49,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:26:49,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:26:49,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:49,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:49,050 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:26:49,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:49,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102672943] [2025-03-16 19:26:49,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102672943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:49,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:49,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:26:49,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481782856] [2025-03-16 19:26:49,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:49,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:26:49,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:49,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:26:49,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:26:49,052 INFO L87 Difference]: Start difference. First operand 89899 states and 127118 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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:26:49,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:49,387 INFO L93 Difference]: Finished difference Result 155340 states and 219026 transitions. [2025-03-16 19:26:49,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:26:49,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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:26:49,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:49,522 INFO L225 Difference]: With dead ends: 155340 [2025-03-16 19:26:49,522 INFO L226 Difference]: Without dead ends: 92976 [2025-03-16 19:26:49,577 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:26:49,577 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 84 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:49,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 335 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:26:49,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92976 states. [2025-03-16 19:26:50,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92976 to 82014. [2025-03-16 19:26:50,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82014 states, 82013 states have (on average 1.3993269359735652) internal successors, (114763), 82013 states have internal predecessors, (114763), 0 states have call successors, (0), 0 states 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:26:51,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82014 states to 82014 states and 114763 transitions. [2025-03-16 19:26:51,087 INFO L78 Accepts]: Start accepts. Automaton has 82014 states and 114763 transitions. Word has length 76 [2025-03-16 19:26:51,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:51,087 INFO L471 AbstractCegarLoop]: Abstraction has 82014 states and 114763 transitions. [2025-03-16 19:26:51,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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:26:51,087 INFO L276 IsEmpty]: Start isEmpty. Operand 82014 states and 114763 transitions. [2025-03-16 19:26:51,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:26:51,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:51,093 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:26:51,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:26:51,093 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:51,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:51,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1287191543, now seen corresponding path program 1 times [2025-03-16 19:26:51,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:51,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370836400] [2025-03-16 19:26:51,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:51,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:51,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:26:51,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:26:51,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:51,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:51,202 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 19:26:51,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:51,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370836400] [2025-03-16 19:26:51,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370836400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:51,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:51,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:26:51,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926604316] [2025-03-16 19:26:51,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:51,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:26:51,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:51,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:26:51,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:26:51,204 INFO L87 Difference]: Start difference. First operand 82014 states and 114763 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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:26:51,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:51,908 INFO L93 Difference]: Finished difference Result 174489 states and 246763 transitions. [2025-03-16 19:26:51,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:26:51,908 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 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:26:51,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:52,260 INFO L225 Difference]: With dead ends: 174489 [2025-03-16 19:26:52,260 INFO L226 Difference]: Without dead ends: 147732 [2025-03-16 19:26:52,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:26:52,289 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 715 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:52,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 977 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:26:52,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147732 states. [2025-03-16 19:26:53,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147732 to 108175. [2025-03-16 19:26:53,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108175 states, 108174 states have (on average 1.3973690535618541) internal successors, (151159), 108174 states have internal predecessors, (151159), 0 states have call successors, (0), 0 states 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:26:53,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108175 states to 108175 states and 151159 transitions. [2025-03-16 19:26:53,679 INFO L78 Accepts]: Start accepts. Automaton has 108175 states and 151159 transitions. Word has length 76 [2025-03-16 19:26:53,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:53,679 INFO L471 AbstractCegarLoop]: Abstraction has 108175 states and 151159 transitions. [2025-03-16 19:26:53,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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:26:53,679 INFO L276 IsEmpty]: Start isEmpty. Operand 108175 states and 151159 transitions. [2025-03-16 19:26:53,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:26:53,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:53,685 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:26:53,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:26:53,685 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:53,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:53,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1767048707, now seen corresponding path program 1 times [2025-03-16 19:26:53,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:53,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950992598] [2025-03-16 19:26:53,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:53,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:53,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:26:53,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:26:53,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:53,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:53,970 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:26:53,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:53,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950992598] [2025-03-16 19:26:53,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950992598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:53,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:53,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:26:53,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805117637] [2025-03-16 19:26:53,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:53,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:26:53,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:53,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:26:53,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:26:53,972 INFO L87 Difference]: Start difference. First operand 108175 states and 151159 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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:26:54,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:54,357 INFO L93 Difference]: Finished difference Result 202837 states and 286251 transitions. [2025-03-16 19:26:54,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:26:54,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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 77 [2025-03-16 19:26:54,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:54,577 INFO L225 Difference]: With dead ends: 202837 [2025-03-16 19:26:54,577 INFO L226 Difference]: Without dead ends: 173924 [2025-03-16 19:26:54,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:26:54,642 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 715 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:54,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 883 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:26:54,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173924 states. [2025-03-16 19:26:56,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173924 to 129046. [2025-03-16 19:26:56,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129046 states, 129045 states have (on average 1.3970862877290868) internal successors, (180287), 129045 states have internal predecessors, (180287), 0 states have call successors, (0), 0 states 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:26:56,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129046 states to 129046 states and 180287 transitions. [2025-03-16 19:26:56,671 INFO L78 Accepts]: Start accepts. Automaton has 129046 states and 180287 transitions. Word has length 77 [2025-03-16 19:26:56,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:56,671 INFO L471 AbstractCegarLoop]: Abstraction has 129046 states and 180287 transitions. [2025-03-16 19:26:56,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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:26:56,671 INFO L276 IsEmpty]: Start isEmpty. Operand 129046 states and 180287 transitions. [2025-03-16 19:26:56,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:26:56,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:56,675 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:26:56,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:26:56,676 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:56,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:56,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1404435050, now seen corresponding path program 1 times [2025-03-16 19:26:56,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:56,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022110019] [2025-03-16 19:26:56,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:56,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:56,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:26:56,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:26:56,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:56,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:56,713 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 19:26:56,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:56,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022110019] [2025-03-16 19:26:56,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022110019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:56,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:56,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:26:56,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028801473] [2025-03-16 19:26:56,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:56,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:26:56,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:56,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:26:56,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:26:56,715 INFO L87 Difference]: Start difference. First operand 129046 states and 180287 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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:26:57,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:26:57,262 INFO L93 Difference]: Finished difference Result 254417 states and 355855 transitions. [2025-03-16 19:26:57,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:26:57,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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 77 [2025-03-16 19:26:57,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:26:57,780 INFO L225 Difference]: With dead ends: 254417 [2025-03-16 19:26:57,780 INFO L226 Difference]: Without dead ends: 125583 [2025-03-16 19:26:57,837 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:26:57,838 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 96 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:26:57,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 125 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:26:57,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125583 states. [2025-03-16 19:26:58,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125583 to 124737. [2025-03-16 19:26:58,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124737 states, 124736 states have (on average 1.3890857491021036) internal successors, (173269), 124736 states have internal predecessors, (173269), 0 states have call successors, (0), 0 states 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:26:59,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124737 states to 124737 states and 173269 transitions. [2025-03-16 19:26:59,439 INFO L78 Accepts]: Start accepts. Automaton has 124737 states and 173269 transitions. Word has length 77 [2025-03-16 19:26:59,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:26:59,439 INFO L471 AbstractCegarLoop]: Abstraction has 124737 states and 173269 transitions. [2025-03-16 19:26:59,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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:26:59,439 INFO L276 IsEmpty]: Start isEmpty. Operand 124737 states and 173269 transitions. [2025-03-16 19:26:59,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:26:59,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:26:59,444 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:26:59,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:26:59,444 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:26:59,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:26:59,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1152586294, now seen corresponding path program 1 times [2025-03-16 19:26:59,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:26:59,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79887214] [2025-03-16 19:26:59,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:26:59,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:26:59,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:26:59,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:26:59,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:26:59,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:26:59,537 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 19:26:59,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:26:59,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79887214] [2025-03-16 19:26:59,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79887214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:26:59,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:26:59,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:26:59,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469709167] [2025-03-16 19:26:59,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:26:59,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:26:59,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:26:59,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:26:59,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:26:59,539 INFO L87 Difference]: Start difference. First operand 124737 states and 173269 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states 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:27:00,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:00,109 INFO L93 Difference]: Finished difference Result 197819 states and 276951 transitions. [2025-03-16 19:27:00,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:27:00,109 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 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 77 [2025-03-16 19:27:00,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:00,380 INFO L225 Difference]: With dead ends: 197819 [2025-03-16 19:27:00,380 INFO L226 Difference]: Without dead ends: 182489 [2025-03-16 19:27:00,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:27:00,452 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 726 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:00,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 867 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:00,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182489 states. [2025-03-16 19:27:02,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182489 to 139651. [2025-03-16 19:27:02,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139651 states, 139650 states have (on average 1.3896527031865378) internal successors, (194065), 139650 states have internal predecessors, (194065), 0 states have call successors, (0), 0 states 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:27:02,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139651 states to 139651 states and 194065 transitions. [2025-03-16 19:27:02,407 INFO L78 Accepts]: Start accepts. Automaton has 139651 states and 194065 transitions. Word has length 77 [2025-03-16 19:27:02,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:02,407 INFO L471 AbstractCegarLoop]: Abstraction has 139651 states and 194065 transitions. [2025-03-16 19:27:02,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states 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:27:02,407 INFO L276 IsEmpty]: Start isEmpty. Operand 139651 states and 194065 transitions. [2025-03-16 19:27:02,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:27:02,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:02,412 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 19:27:02,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:27:02,412 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:27:02,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:02,413 INFO L85 PathProgramCache]: Analyzing trace with hash 259907672, now seen corresponding path program 1 times [2025-03-16 19:27:02,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:02,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729229226] [2025-03-16 19:27:02,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:02,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:02,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:27:02,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:27:02,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:02,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:02,448 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:02,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:02,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729229226] [2025-03-16 19:27:02,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729229226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:27:02,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:27:02,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:27:02,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112286474] [2025-03-16 19:27:02,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:27:02,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:27:02,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:02,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:27:02,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:27:02,449 INFO L87 Difference]: Start difference. First operand 139651 states and 194065 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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:27:03,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:03,418 INFO L93 Difference]: Finished difference Result 342438 states and 473299 transitions. [2025-03-16 19:27:03,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:27:03,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-03-16 19:27:03,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:03,723 INFO L225 Difference]: With dead ends: 342438 [2025-03-16 19:27:03,723 INFO L226 Difference]: Without dead ends: 219368 [2025-03-16 19:27:03,834 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:27:03,835 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 78 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:03,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 328 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:27:03,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219368 states. [2025-03-16 19:27:06,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219368 to 206871. [2025-03-16 19:27:06,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206871 states, 206870 states have (on average 1.3668439116353266) internal successors, (282759), 206870 states have internal predecessors, (282759), 0 states have call successors, (0), 0 states 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:27:07,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206871 states to 206871 states and 282759 transitions. [2025-03-16 19:27:07,036 INFO L78 Accepts]: Start accepts. Automaton has 206871 states and 282759 transitions. Word has length 79 [2025-03-16 19:27:07,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:07,036 INFO L471 AbstractCegarLoop]: Abstraction has 206871 states and 282759 transitions. [2025-03-16 19:27:07,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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:27:07,036 INFO L276 IsEmpty]: Start isEmpty. Operand 206871 states and 282759 transitions. [2025-03-16 19:27:07,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:27:07,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:07,045 INFO L218 NwaCegarLoop]: trace histogram [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:27:07,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:27:07,045 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:27:07,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:07,045 INFO L85 PathProgramCache]: Analyzing trace with hash -699457898, now seen corresponding path program 1 times [2025-03-16 19:27:07,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:07,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169820430] [2025-03-16 19:27:07,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:07,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:07,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:27:07,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:27:07,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:07,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:07,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:07,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169820430] [2025-03-16 19:27:07,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169820430] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:27:07,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809282643] [2025-03-16 19:27:07,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:07,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:27:07,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:27:07,154 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:27:07,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 19:27:07,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:27:07,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:27:07,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:07,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:07,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 19:27:07,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:27:07,443 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:07,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:27:07,528 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:07,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809282643] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:27:07,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:27:07,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-16 19:27:07,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959917786] [2025-03-16 19:27:07,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:27:07,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:27:07,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:07,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:27:07,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:27:07,529 INFO L87 Difference]: Start difference. First operand 206871 states and 282759 transitions. Second operand has 11 states, 11 states have (on average 12.545454545454545) internal successors, (138), 10 states have internal predecessors, (138), 0 states have call successors, (0), 0 states 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:27:09,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:09,098 INFO L93 Difference]: Finished difference Result 477273 states and 655881 transitions. [2025-03-16 19:27:09,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:27:09,107 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 12.545454545454545) internal successors, (138), 10 states have internal predecessors, (138), 0 states have call successors, (0), 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 81 [2025-03-16 19:27:09,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:09,495 INFO L225 Difference]: With dead ends: 477273 [2025-03-16 19:27:09,495 INFO L226 Difference]: Without dead ends: 279970 [2025-03-16 19:27:09,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 152 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-16 19:27:09,618 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 771 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:09,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 563 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:27:09,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279970 states. [2025-03-16 19:27:12,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279970 to 206719. [2025-03-16 19:27:12,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206719 states, 206718 states have (on average 1.3731363500033862) internal successors, (283852), 206718 states have internal predecessors, (283852), 0 states have call successors, (0), 0 states 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:27:13,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206719 states to 206719 states and 283852 transitions. [2025-03-16 19:27:13,122 INFO L78 Accepts]: Start accepts. Automaton has 206719 states and 283852 transitions. Word has length 81 [2025-03-16 19:27:13,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:27:13,122 INFO L471 AbstractCegarLoop]: Abstraction has 206719 states and 283852 transitions. [2025-03-16 19:27:13,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.545454545454545) internal successors, (138), 10 states have internal predecessors, (138), 0 states have call successors, (0), 0 states 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:27:13,122 INFO L276 IsEmpty]: Start isEmpty. Operand 206719 states and 283852 transitions. [2025-03-16 19:27:13,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 19:27:13,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:27:13,129 INFO L218 NwaCegarLoop]: trace histogram [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:27:13,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 19:27:13,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:27:13,330 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:27:13,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:27:13,330 INFO L85 PathProgramCache]: Analyzing trace with hash 382408488, now seen corresponding path program 1 times [2025-03-16 19:27:13,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:27:13,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954245091] [2025-03-16 19:27:13,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:13,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:27:13,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 19:27:13,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 19:27:13,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:13,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:13,408 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:13,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:27:13,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954245091] [2025-03-16 19:27:13,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954245091] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:27:13,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024410751] [2025-03-16 19:27:13,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:27:13,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:27:13,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:27:13,411 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:27:13,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 19:27:13,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 19:27:13,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 19:27:13,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:27:13,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:27:13,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 19:27:13,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:27:13,679 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:13,679 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:27:13,749 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:27:13,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024410751] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:27:13,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:27:13,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-16 19:27:13,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635000071] [2025-03-16 19:27:13,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:27:13,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:27:13,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:27:13,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:27:13,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:27:13,750 INFO L87 Difference]: Start difference. First operand 206719 states and 283852 transitions. Second operand has 11 states, 11 states have (on average 13.0) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:27:15,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:27:15,114 INFO L93 Difference]: Finished difference Result 398559 states and 545978 transitions. [2025-03-16 19:27:15,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:27:15,115 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.0) internal successors, (143), 10 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-16 19:27:15,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:27:15,543 INFO L225 Difference]: With dead ends: 398559 [2025-03-16 19:27:15,543 INFO L226 Difference]: Without dead ends: 294697 [2025-03-16 19:27:15,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 154 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-16 19:27:15,609 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 1157 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:27:15,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 432 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:27:15,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294697 states. [2025-03-16 19:27:18,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294697 to 236726. [2025-03-16 19:27:18,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236726 states, 236725 states have (on average 1.3658253247439012) internal successors, (323325), 236725 states have internal predecessors, (323325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)