./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 8eb51bb6f9c94e581d6ba21c25f6021e38364df0ee9c7b7b096e4c3b9d6ac008 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:47:42,501 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:47:42,557 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:47:42,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:47:42,561 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:47:42,575 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:47:42,576 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:47:42,576 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:47:42,576 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:47:42,576 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:47:42,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:47:42,576 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:47:42,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:47:42,577 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:47:42,577 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:47:42,577 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:47:42,577 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:47:42,577 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:47:42,577 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:47:42,577 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:47:42,577 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:47:42,577 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:47:42,577 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:47:42,577 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:47:42,577 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:47:42,577 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:47:42,577 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:47:42,577 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:47:42,578 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:47:42,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:47:42,578 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:47:42,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:47:42,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:47:42,578 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:47:42,578 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:47:42,578 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:47:42,578 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:47:42,578 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:47:42,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:47:42,578 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:47:42,578 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:47:42,578 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:47:42,578 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:47:42,578 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-jdk21/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 -> 8eb51bb6f9c94e581d6ba21c25f6021e38364df0ee9c7b7b096e4c3b9d6ac008 [2025-02-05 16:47:42,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:47:42,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:47:42,842 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:47:42,843 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:47:42,843 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:47:42,844 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-02-05 16:47:44,071 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ee37366b/4118b331601243208da4c11c054e34a5/FLAG68be10edc [2025-02-05 16:47:44,374 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:47:44,379 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-02-05 16:47:44,390 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ee37366b/4118b331601243208da4c11c054e34a5/FLAG68be10edc [2025-02-05 16:47:44,637 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ee37366b/4118b331601243208da4c11c054e34a5 [2025-02-05 16:47:44,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:47:44,640 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:47:44,641 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:47:44,641 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:47:44,644 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:47:44,644 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:47:44" (1/1) ... [2025-02-05 16:47:44,645 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6135fcf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:47:44, skipping insertion in model container [2025-02-05 16:47:44,645 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:47:44" (1/1) ... [2025-02-05 16:47:44,676 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:47:44,863 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7920,7933] [2025-02-05 16:47:44,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:47:44,916 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:47:44,959 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7920,7933] [2025-02-05 16:47:44,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:47:44,988 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:47:44,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:47:44 WrapperNode [2025-02-05 16:47:44,989 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:47:44,990 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:47:44,990 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:47:44,990 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:47:44,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:47:44" (1/1) ... [2025-02-05 16:47:45,002 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:47:44" (1/1) ... [2025-02-05 16:47:45,033 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 688 [2025-02-05 16:47:45,033 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:47:45,033 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:47:45,033 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:47:45,034 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:47:45,040 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:47:44" (1/1) ... [2025-02-05 16:47:45,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:47:44" (1/1) ... [2025-02-05 16:47:45,045 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:47:44" (1/1) ... [2025-02-05 16:47:45,062 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-02-05 16:47:45,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:47:44" (1/1) ... [2025-02-05 16:47:45,063 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:47:44" (1/1) ... [2025-02-05 16:47:45,070 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:47:44" (1/1) ... [2025-02-05 16:47:45,071 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:47:44" (1/1) ... [2025-02-05 16:47:45,072 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:47:44" (1/1) ... [2025-02-05 16:47:45,073 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:47:44" (1/1) ... [2025-02-05 16:47:45,075 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:47:45,076 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:47:45,076 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:47:45,076 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:47:45,076 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:47:44" (1/1) ... [2025-02-05 16:47:45,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:47:45,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:47:45,102 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:47:45,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:47:45,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:47:45,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:47:45,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:47:45,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:47:45,240 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:47:45,244 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:47:45,737 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L799: havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-02-05 16:47:45,737 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L254: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2025-02-05 16:47:45,737 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L291: havoc main_~node2__newmax~0#1; [2025-02-05 16:47:45,738 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L409: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-05 16:47:45,738 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L559: havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-02-05 16:47:45,738 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L328: havoc main_~node3__newmax~0#1; [2025-02-05 16:47:45,738 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L679: havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-02-05 16:47:45,767 INFO L? ?]: Removed 50 outVars from TransFormulas that were not future-live. [2025-02-05 16:47:45,767 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:47:45,775 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:47:45,775 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:47:45,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:47:45 BoogieIcfgContainer [2025-02-05 16:47:45,775 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:47:45,777 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:47:45,777 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:47:45,780 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:47:45,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:47:44" (1/3) ... [2025-02-05 16:47:45,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2142339d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:47:45, skipping insertion in model container [2025-02-05 16:47:45,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:47:44" (2/3) ... [2025-02-05 16:47:45,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2142339d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:47:45, skipping insertion in model container [2025-02-05 16:47:45,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:47:45" (3/3) ... [2025-02-05 16:47:45,782 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-02-05 16:47:45,791 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:47:45,792 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c that has 1 procedures, 155 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:47:45,828 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:47:45,835 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;@5a6a5a00, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:47:45,835 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:47:45,838 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 153 states have (on average 1.7450980392156863) internal successors, (267), 154 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:45,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 16:47:45,842 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:47:45,843 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:47:45,843 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:47:45,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:47:45,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1788049557, now seen corresponding path program 1 times [2025-02-05 16:47:45,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:47:45,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395878715] [2025-02-05 16:47:45,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:47:45,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:47:45,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 16:47:45,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 16:47:45,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:47:45,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:47:46,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:47:46,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:47:46,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395878715] [2025-02-05 16:47:46,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395878715] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:47:46,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:47:46,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:47:46,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472143273] [2025-02-05 16:47:46,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:47:46,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:47:46,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:47:46,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:47:46,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:47:46,228 INFO L87 Difference]: Start difference. First operand has 155 states, 153 states have (on average 1.7450980392156863) internal successors, (267), 154 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:46,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:47:46,312 INFO L93 Difference]: Finished difference Result 341 states and 571 transitions. [2025-02-05 16:47:46,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:47:46,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-02-05 16:47:46,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:47:46,319 INFO L225 Difference]: With dead ends: 341 [2025-02-05 16:47:46,320 INFO L226 Difference]: Without dead ends: 237 [2025-02-05 16:47:46,321 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-02-05 16:47:46,323 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 157 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:47:46,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 460 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:47:46,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-02-05 16:47:46,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 234. [2025-02-05 16:47:46,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 1.5665236051502145) internal successors, (365), 233 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:46,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 365 transitions. [2025-02-05 16:47:46,351 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 365 transitions. Word has length 62 [2025-02-05 16:47:46,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:47:46,353 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 365 transitions. [2025-02-05 16:47:46,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:46,353 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 365 transitions. [2025-02-05 16:47:46,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:47:46,355 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:47:46,355 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:47:46,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:47:46,355 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:47:46,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:47:46,355 INFO L85 PathProgramCache]: Analyzing trace with hash 103441115, now seen corresponding path program 1 times [2025-02-05 16:47:46,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:47:46,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175856870] [2025-02-05 16:47:46,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:47:46,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:47:46,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:47:46,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:47:46,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:47:46,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:47:46,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:47:46,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:47:46,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175856870] [2025-02-05 16:47:46,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175856870] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:47:46,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:47:46,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:47:46,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345060927] [2025-02-05 16:47:46,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:47:46,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:47:46,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:47:46,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:47:46,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:47:46,550 INFO L87 Difference]: Start difference. First operand 234 states and 365 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:46,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:47:46,580 INFO L93 Difference]: Finished difference Result 572 states and 917 transitions. [2025-02-05 16:47:46,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:47:46,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-02-05 16:47:46,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:47:46,582 INFO L225 Difference]: With dead ends: 572 [2025-02-05 16:47:46,582 INFO L226 Difference]: Without dead ends: 395 [2025-02-05 16:47:46,583 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-02-05 16:47:46,583 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 133 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:47:46,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 430 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:47:46,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-02-05 16:47:46,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 391. [2025-02-05 16:47:46,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 390 states have (on average 1.5897435897435896) internal successors, (620), 390 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:46,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 620 transitions. [2025-02-05 16:47:46,599 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 620 transitions. Word has length 64 [2025-02-05 16:47:46,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:47:46,599 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 620 transitions. [2025-02-05 16:47:46,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:46,599 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 620 transitions. [2025-02-05 16:47:46,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:47:46,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:47:46,601 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:47:46,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:47:46,601 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:47:46,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:47:46,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1430958571, now seen corresponding path program 1 times [2025-02-05 16:47:46,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:47:46,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482648767] [2025-02-05 16:47:46,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:47:46,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:47:46,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:47:46,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:47:46,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:47:46,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:47:46,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:47:46,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:47:46,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482648767] [2025-02-05 16:47:46,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482648767] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:47:46,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:47:46,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:47:46,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405930202] [2025-02-05 16:47:46,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:47:46,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:47:46,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:47:46,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:47:46,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:47:46,777 INFO L87 Difference]: Start difference. First operand 391 states and 620 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:46,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:47:46,820 INFO L93 Difference]: Finished difference Result 1027 states and 1654 transitions. [2025-02-05 16:47:46,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:47:46,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2025-02-05 16:47:46,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:47:46,824 INFO L225 Difference]: With dead ends: 1027 [2025-02-05 16:47:46,824 INFO L226 Difference]: Without dead ends: 693 [2025-02-05 16:47:46,829 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-02-05 16:47:46,829 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 127 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:47:46,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 431 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:47:46,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2025-02-05 16:47:46,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 687. [2025-02-05 16:47:46,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 686 states have (on average 1.597667638483965) internal successors, (1096), 686 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:46,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1096 transitions. [2025-02-05 16:47:46,876 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1096 transitions. Word has length 66 [2025-02-05 16:47:46,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:47:46,877 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 1096 transitions. [2025-02-05 16:47:46,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:46,877 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1096 transitions. [2025-02-05 16:47:46,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:47:46,879 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:47:46,879 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:47:46,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:47:46,879 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:47:46,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:47:46,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1115151515, now seen corresponding path program 1 times [2025-02-05 16:47:46,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:47:46,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358898532] [2025-02-05 16:47:46,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:47:46,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:47:46,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:47:46,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:47:46,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:47:46,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:47:47,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:47:47,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:47:47,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358898532] [2025-02-05 16:47:47,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358898532] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:47:47,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:47:47,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:47:47,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584445822] [2025-02-05 16:47:47,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:47:47,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:47:47,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:47:47,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:47:47,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:47:47,062 INFO L87 Difference]: Start difference. First operand 687 states and 1096 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:47,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:47:47,237 INFO L93 Difference]: Finished difference Result 2979 states and 4854 transitions. [2025-02-05 16:47:47,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:47:47,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-02-05 16:47:47,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:47:47,247 INFO L225 Difference]: With dead ends: 2979 [2025-02-05 16:47:47,247 INFO L226 Difference]: Without dead ends: 2349 [2025-02-05 16:47:47,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:47:47,251 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 1024 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1024 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:47:47,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1024 Valid, 1598 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:47:47,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2025-02-05 16:47:47,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 1239. [2025-02-05 16:47:47,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1238 states have (on average 1.6082390953150243) internal successors, (1991), 1238 states have internal predecessors, (1991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:47,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1991 transitions. [2025-02-05 16:47:47,291 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1991 transitions. Word has length 68 [2025-02-05 16:47:47,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:47:47,292 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 1991 transitions. [2025-02-05 16:47:47,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:47,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1991 transitions. [2025-02-05 16:47:47,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:47:47,294 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:47:47,294 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:47:47,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:47:47,294 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:47:47,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:47:47,299 INFO L85 PathProgramCache]: Analyzing trace with hash 211837423, now seen corresponding path program 1 times [2025-02-05 16:47:47,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:47:47,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933434416] [2025-02-05 16:47:47,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:47:47,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:47:47,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:47:47,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:47:47,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:47:47,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:47:47,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:47:47,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:47:47,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933434416] [2025-02-05 16:47:47,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933434416] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:47:47,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:47:47,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:47:47,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326265162] [2025-02-05 16:47:47,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:47:47,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:47:47,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:47:47,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:47:47,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:47:47,474 INFO L87 Difference]: Start difference. First operand 1239 states and 1991 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:47,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:47:47,555 INFO L93 Difference]: Finished difference Result 3619 states and 5887 transitions. [2025-02-05 16:47:47,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:47:47,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-02-05 16:47:47,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:47:47,563 INFO L225 Difference]: With dead ends: 3619 [2025-02-05 16:47:47,563 INFO L226 Difference]: Without dead ends: 2437 [2025-02-05 16:47:47,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:47:47,565 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 456 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:47:47,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 690 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:47:47,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2025-02-05 16:47:47,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 1829. [2025-02-05 16:47:47,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1828 states have (on average 1.6148796498905909) internal successors, (2952), 1828 states have internal predecessors, (2952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:47,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2952 transitions. [2025-02-05 16:47:47,616 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2952 transitions. Word has length 69 [2025-02-05 16:47:47,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:47:47,616 INFO L471 AbstractCegarLoop]: Abstraction has 1829 states and 2952 transitions. [2025-02-05 16:47:47,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:47,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2952 transitions. [2025-02-05 16:47:47,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:47:47,618 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:47:47,618 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:47:47,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:47:47,619 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:47:47,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:47:47,619 INFO L85 PathProgramCache]: Analyzing trace with hash -2021185026, now seen corresponding path program 1 times [2025-02-05 16:47:47,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:47:47,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22561925] [2025-02-05 16:47:47,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:47:47,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:47:47,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:47:47,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:47:47,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:47:47,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:47:47,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:47:47,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:47:47,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22561925] [2025-02-05 16:47:47,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22561925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:47:47,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:47:47,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:47:47,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838076689] [2025-02-05 16:47:47,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:47:47,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:47:47,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:47:47,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:47:47,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:47:47,722 INFO L87 Difference]: Start difference. First operand 1829 states and 2952 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:47,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:47:47,798 INFO L93 Difference]: Finished difference Result 5313 states and 8631 transitions. [2025-02-05 16:47:47,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:47:47,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-02-05 16:47:47,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:47:47,808 INFO L225 Difference]: With dead ends: 5313 [2025-02-05 16:47:47,809 INFO L226 Difference]: Without dead ends: 3541 [2025-02-05 16:47:47,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:47:47,812 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 456 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:47:47,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 785 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:47:47,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3541 states. [2025-02-05 16:47:47,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3541 to 2673. [2025-02-05 16:47:47,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2673 states, 2672 states have (on average 1.6137724550898203) internal successors, (4312), 2672 states have internal predecessors, (4312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:47,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 4312 transitions. [2025-02-05 16:47:47,871 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 4312 transitions. Word has length 70 [2025-02-05 16:47:47,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:47:47,871 INFO L471 AbstractCegarLoop]: Abstraction has 2673 states and 4312 transitions. [2025-02-05 16:47:47,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:47,871 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 4312 transitions. [2025-02-05 16:47:47,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-05 16:47:47,872 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:47:47,873 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:47:47,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:47:47,873 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:47:47,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:47:47,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1769473714, now seen corresponding path program 1 times [2025-02-05 16:47:47,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:47:47,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915444307] [2025-02-05 16:47:47,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:47:47,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:47:47,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-05 16:47:47,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-05 16:47:47,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:47:47,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:47:47,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:47:47,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:47:47,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915444307] [2025-02-05 16:47:47,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915444307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:47:47,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:47:47,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:47:47,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600869065] [2025-02-05 16:47:47,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:47:47,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:47:47,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:47:47,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:47:47,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:47:47,964 INFO L87 Difference]: Start difference. First operand 2673 states and 4312 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:48,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:47:48,044 INFO L93 Difference]: Finished difference Result 7713 states and 12507 transitions. [2025-02-05 16:47:48,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:47:48,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2025-02-05 16:47:48,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:47:48,059 INFO L225 Difference]: With dead ends: 7713 [2025-02-05 16:47:48,060 INFO L226 Difference]: Without dead ends: 5097 [2025-02-05 16:47:48,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:47:48,064 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 454 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:47:48,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 787 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:47:48,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5097 states. [2025-02-05 16:47:48,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5097 to 3869. [2025-02-05 16:47:48,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3869 states, 3868 states have (on average 1.6116856256463288) internal successors, (6234), 3868 states have internal predecessors, (6234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:48,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3869 states to 3869 states and 6234 transitions. [2025-02-05 16:47:48,166 INFO L78 Accepts]: Start accepts. Automaton has 3869 states and 6234 transitions. Word has length 71 [2025-02-05 16:47:48,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:47:48,166 INFO L471 AbstractCegarLoop]: Abstraction has 3869 states and 6234 transitions. [2025-02-05 16:47:48,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:48,166 INFO L276 IsEmpty]: Start isEmpty. Operand 3869 states and 6234 transitions. [2025-02-05 16:47:48,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-05 16:47:48,172 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:47:48,172 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:47:48,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:47:48,172 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:47:48,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:47:48,173 INFO L85 PathProgramCache]: Analyzing trace with hash 481049690, now seen corresponding path program 1 times [2025-02-05 16:47:48,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:47:48,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850185944] [2025-02-05 16:47:48,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:47:48,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:47:48,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-05 16:47:48,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-05 16:47:48,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:47:48,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:47:48,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:47:48,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:47:48,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850185944] [2025-02-05 16:47:48,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850185944] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:47:48,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:47:48,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:47:48,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882914982] [2025-02-05 16:47:48,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:47:48,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:47:48,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:47:48,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:47:48,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:47:48,244 INFO L87 Difference]: Start difference. First operand 3869 states and 6234 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:48,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:47:48,293 INFO L93 Difference]: Finished difference Result 8646 states and 14040 transitions. [2025-02-05 16:47:48,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:47:48,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-02-05 16:47:48,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:47:48,311 INFO L225 Difference]: With dead ends: 8646 [2025-02-05 16:47:48,311 INFO L226 Difference]: Without dead ends: 5881 [2025-02-05 16:47:48,317 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-02-05 16:47:48,318 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 138 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:47:48,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 536 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:47:48,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5881 states. [2025-02-05 16:47:48,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5881 to 5879. [2025-02-05 16:47:48,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5879 states, 5878 states have (on average 1.6124532153793807) internal successors, (9478), 5878 states have internal predecessors, (9478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:48,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5879 states to 5879 states and 9478 transitions. [2025-02-05 16:47:48,423 INFO L78 Accepts]: Start accepts. Automaton has 5879 states and 9478 transitions. Word has length 72 [2025-02-05 16:47:48,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:47:48,423 INFO L471 AbstractCegarLoop]: Abstraction has 5879 states and 9478 transitions. [2025-02-05 16:47:48,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:48,423 INFO L276 IsEmpty]: Start isEmpty. Operand 5879 states and 9478 transitions. [2025-02-05 16:47:48,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-05 16:47:48,424 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:47:48,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:47:48,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:47:48,426 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:47:48,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:47:48,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1856469720, now seen corresponding path program 1 times [2025-02-05 16:47:48,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:47:48,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168098795] [2025-02-05 16:47:48,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:47:48,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:47:48,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-05 16:47:48,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-05 16:47:48,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:47:48,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:47:48,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:47:48,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:47:48,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168098795] [2025-02-05 16:47:48,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168098795] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:47:48,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:47:48,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:47:48,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21235488] [2025-02-05 16:47:48,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:47:48,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:47:48,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:47:48,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:47:48,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:47:48,517 INFO L87 Difference]: Start difference. First operand 5879 states and 9478 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:48,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:47:48,574 INFO L93 Difference]: Finished difference Result 12993 states and 20995 transitions. [2025-02-05 16:47:48,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:47:48,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-02-05 16:47:48,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:47:48,606 INFO L225 Difference]: With dead ends: 12993 [2025-02-05 16:47:48,606 INFO L226 Difference]: Without dead ends: 8823 [2025-02-05 16:47:48,614 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-02-05 16:47:48,614 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 126 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:47:48,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 481 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:47:48,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8823 states. [2025-02-05 16:47:48,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8823 to 8821. [2025-02-05 16:47:48,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8821 states, 8820 states have (on average 1.6052154195011339) internal successors, (14158), 8820 states have internal predecessors, (14158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:48,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8821 states to 8821 states and 14158 transitions. [2025-02-05 16:47:48,833 INFO L78 Accepts]: Start accepts. Automaton has 8821 states and 14158 transitions. Word has length 72 [2025-02-05 16:47:48,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:47:48,833 INFO L471 AbstractCegarLoop]: Abstraction has 8821 states and 14158 transitions. [2025-02-05 16:47:48,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:48,833 INFO L276 IsEmpty]: Start isEmpty. Operand 8821 states and 14158 transitions. [2025-02-05 16:47:48,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-05 16:47:48,834 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:47:48,834 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:47:48,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:47:48,834 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:47:48,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:47:48,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1492720088, now seen corresponding path program 1 times [2025-02-05 16:47:48,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:47:48,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309793571] [2025-02-05 16:47:48,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:47:48,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:47:48,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-05 16:47:48,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-05 16:47:48,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:47:48,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:47:48,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:47:48,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:47:48,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309793571] [2025-02-05 16:47:48,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309793571] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:47:48,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:47:48,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:47:48,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444537074] [2025-02-05 16:47:48,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:47:48,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:47:48,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:47:48,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:47:48,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:47:48,906 INFO L87 Difference]: Start difference. First operand 8821 states and 14158 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:48,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:47:48,958 INFO L93 Difference]: Finished difference Result 19170 states and 30844 transitions. [2025-02-05 16:47:48,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:47:48,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-02-05 16:47:48,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:47:48,983 INFO L225 Difference]: With dead ends: 19170 [2025-02-05 16:47:48,983 INFO L226 Difference]: Without dead ends: 12906 [2025-02-05 16:47:48,994 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-02-05 16:47:48,994 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 132 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:47:48,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 521 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:47:49,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12906 states. [2025-02-05 16:47:49,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12906 to 12904. [2025-02-05 16:47:49,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12904 states, 12903 states have (on average 1.5969154460203054) internal successors, (20605), 12903 states have internal predecessors, (20605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:49,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12904 states to 12904 states and 20605 transitions. [2025-02-05 16:47:49,337 INFO L78 Accepts]: Start accepts. Automaton has 12904 states and 20605 transitions. Word has length 72 [2025-02-05 16:47:49,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:47:49,337 INFO L471 AbstractCegarLoop]: Abstraction has 12904 states and 20605 transitions. [2025-02-05 16:47:49,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:49,337 INFO L276 IsEmpty]: Start isEmpty. Operand 12904 states and 20605 transitions. [2025-02-05 16:47:49,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-05 16:47:49,338 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:47:49,338 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:47:49,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:47:49,338 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:47:49,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:47:49,343 INFO L85 PathProgramCache]: Analyzing trace with hash -291327020, now seen corresponding path program 1 times [2025-02-05 16:47:49,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:47:49,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937677039] [2025-02-05 16:47:49,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:47:49,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:47:49,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 16:47:49,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 16:47:49,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:47:49,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:47:49,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:47:49,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:47:49,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937677039] [2025-02-05 16:47:49,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937677039] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:47:49,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:47:49,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:47:49,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765517765] [2025-02-05 16:47:49,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:47:49,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:47:49,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:47:49,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:47:49,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:47:49,655 INFO L87 Difference]: Start difference. First operand 12904 states and 20605 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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-02-05 16:47:49,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:47:49,791 INFO L93 Difference]: Finished difference Result 25719 states and 41086 transitions. [2025-02-05 16:47:49,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:47:49,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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 73 [2025-02-05 16:47:49,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:47:49,817 INFO L225 Difference]: With dead ends: 25719 [2025-02-05 16:47:49,817 INFO L226 Difference]: Without dead ends: 12906 [2025-02-05 16:47:49,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:47:49,836 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 257 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:47:49,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 636 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:47:49,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12906 states. [2025-02-05 16:47:50,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12906 to 12904. [2025-02-05 16:47:50,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12904 states, 12903 states have (on average 1.5872277764860885) internal successors, (20480), 12903 states have internal predecessors, (20480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:50,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12904 states to 12904 states and 20480 transitions. [2025-02-05 16:47:50,136 INFO L78 Accepts]: Start accepts. Automaton has 12904 states and 20480 transitions. Word has length 73 [2025-02-05 16:47:50,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:47:50,136 INFO L471 AbstractCegarLoop]: Abstraction has 12904 states and 20480 transitions. [2025-02-05 16:47:50,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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-02-05 16:47:50,136 INFO L276 IsEmpty]: Start isEmpty. Operand 12904 states and 20480 transitions. [2025-02-05 16:47:50,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 16:47:50,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:47:50,137 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:47:50,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:47:50,137 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:47:50,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:47:50,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1701786232, now seen corresponding path program 1 times [2025-02-05 16:47:50,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:47:50,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818029732] [2025-02-05 16:47:50,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:47:50,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:47:50,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 16:47:50,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 16:47:50,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:47:50,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:47:50,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:47:50,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:47:50,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818029732] [2025-02-05 16:47:50,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818029732] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:47:50,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:47:50,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:47:50,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40715959] [2025-02-05 16:47:50,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:47:50,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:47:50,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:47:50,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:47:50,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:47:50,315 INFO L87 Difference]: Start difference. First operand 12904 states and 20480 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:50,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:47:50,516 INFO L93 Difference]: Finished difference Result 36939 states and 58780 transitions. [2025-02-05 16:47:50,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:47:50,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-05 16:47:50,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:47:50,558 INFO L225 Difference]: With dead ends: 36939 [2025-02-05 16:47:50,559 INFO L226 Difference]: Without dead ends: 24126 [2025-02-05 16:47:50,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:47:50,571 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 379 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:47:50,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 640 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:47:50,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24126 states. [2025-02-05 16:47:50,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24126 to 24124. [2025-02-05 16:47:50,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24124 states, 24123 states have (on average 1.576711022675455) internal successors, (38035), 24123 states have internal predecessors, (38035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:50,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24124 states to 24124 states and 38035 transitions. [2025-02-05 16:47:50,907 INFO L78 Accepts]: Start accepts. Automaton has 24124 states and 38035 transitions. Word has length 76 [2025-02-05 16:47:50,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:47:50,907 INFO L471 AbstractCegarLoop]: Abstraction has 24124 states and 38035 transitions. [2025-02-05 16:47:50,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:50,907 INFO L276 IsEmpty]: Start isEmpty. Operand 24124 states and 38035 transitions. [2025-02-05 16:47:50,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:47:50,907 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:47:50,907 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:47:50,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:47:50,908 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:47:50,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:47:50,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1214810335, now seen corresponding path program 1 times [2025-02-05 16:47:50,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:47:50,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835931813] [2025-02-05 16:47:50,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:47:50,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:47:50,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:47:50,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:47:50,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:47:50,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:47:51,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:47:51,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:47:51,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835931813] [2025-02-05 16:47:51,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835931813] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:47:51,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:47:51,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:47:51,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595530378] [2025-02-05 16:47:51,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:47:51,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:47:51,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:47:51,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:47:51,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:47:51,373 INFO L87 Difference]: Start difference. First operand 24124 states and 38035 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:51,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:47:51,462 INFO L93 Difference]: Finished difference Result 24850 states and 39122 transitions. [2025-02-05 16:47:51,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:47:51,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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-02-05 16:47:51,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:47:51,508 INFO L225 Difference]: With dead ends: 24850 [2025-02-05 16:47:51,508 INFO L226 Difference]: Without dead ends: 24848 [2025-02-05 16:47:51,517 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-02-05 16:47:51,518 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 0 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:47:51,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 904 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:47:51,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24848 states. [2025-02-05 16:47:51,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24848 to 24848. [2025-02-05 16:47:51,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24848 states, 24847 states have (on average 1.5595444118002173) internal successors, (38750), 24847 states have internal predecessors, (38750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:51,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24848 states to 24848 states and 38750 transitions. [2025-02-05 16:47:51,848 INFO L78 Accepts]: Start accepts. Automaton has 24848 states and 38750 transitions. Word has length 77 [2025-02-05 16:47:51,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:47:51,848 INFO L471 AbstractCegarLoop]: Abstraction has 24848 states and 38750 transitions. [2025-02-05 16:47:51,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:51,848 INFO L276 IsEmpty]: Start isEmpty. Operand 24848 states and 38750 transitions. [2025-02-05 16:47:51,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 16:47:51,849 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:47:51,850 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:47:51,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:47:51,850 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:47:51,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:47:51,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1244537545, now seen corresponding path program 1 times [2025-02-05 16:47:51,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:47:51,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399512687] [2025-02-05 16:47:51,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:47:51,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:47:51,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 16:47:51,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 16:47:51,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:47:51,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:47:51,921 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:47:51,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:47:51,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399512687] [2025-02-05 16:47:51,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399512687] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:47:51,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:47:51,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:47:51,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133030593] [2025-02-05 16:47:51,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:47:51,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:47:51,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:47:51,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:47:51,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:47:51,923 INFO L87 Difference]: Start difference. First operand 24848 states and 38750 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:52,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:47:52,055 INFO L93 Difference]: Finished difference Result 57401 states and 89979 transitions. [2025-02-05 16:47:52,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:47:52,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-02-05 16:47:52,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:47:52,139 INFO L225 Difference]: With dead ends: 57401 [2025-02-05 16:47:52,139 INFO L226 Difference]: Without dead ends: 45439 [2025-02-05 16:47:52,163 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-02-05 16:47:52,164 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 117 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:47:52,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 425 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:47:52,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45439 states. [2025-02-05 16:47:52,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45439 to 45387. [2025-02-05 16:47:52,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45387 states, 45386 states have (on average 1.5631912924690434) internal successors, (70947), 45386 states have internal predecessors, (70947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:52,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45387 states to 45387 states and 70947 transitions. [2025-02-05 16:47:52,778 INFO L78 Accepts]: Start accepts. Automaton has 45387 states and 70947 transitions. Word has length 103 [2025-02-05 16:47:52,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:47:52,778 INFO L471 AbstractCegarLoop]: Abstraction has 45387 states and 70947 transitions. [2025-02-05 16:47:52,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:52,779 INFO L276 IsEmpty]: Start isEmpty. Operand 45387 states and 70947 transitions. [2025-02-05 16:47:52,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 16:47:52,780 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:47:52,780 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:47:52,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:47:52,781 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:47:52,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:47:52,781 INFO L85 PathProgramCache]: Analyzing trace with hash 130882485, now seen corresponding path program 1 times [2025-02-05 16:47:52,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:47:52,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297855244] [2025-02-05 16:47:52,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:47:52,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:47:52,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 16:47:52,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 16:47:52,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:47:52,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:47:53,059 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 16:47:53,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:47:53,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297855244] [2025-02-05 16:47:53,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297855244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:47:53,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:47:53,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:47:53,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335294085] [2025-02-05 16:47:53,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:47:53,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:47:53,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:47:53,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:47:53,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:47:53,065 INFO L87 Difference]: Start difference. First operand 45387 states and 70947 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:53,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:47:53,461 INFO L93 Difference]: Finished difference Result 111556 states and 174816 transitions. [2025-02-05 16:47:53,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:47:53,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 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 103 [2025-02-05 16:47:53,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:47:53,762 INFO L225 Difference]: With dead ends: 111556 [2025-02-05 16:47:53,763 INFO L226 Difference]: Without dead ends: 90380 [2025-02-05 16:47:53,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:47:53,788 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 584 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:47:53,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 1068 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:47:53,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90380 states. [2025-02-05 16:47:54,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90380 to 70258. [2025-02-05 16:47:54,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70258 states, 70257 states have (on average 1.5612963832785345) internal successors, (109692), 70257 states have internal predecessors, (109692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:54,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70258 states to 70258 states and 109692 transitions. [2025-02-05 16:47:54,927 INFO L78 Accepts]: Start accepts. Automaton has 70258 states and 109692 transitions. Word has length 103 [2025-02-05 16:47:54,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:47:54,927 INFO L471 AbstractCegarLoop]: Abstraction has 70258 states and 109692 transitions. [2025-02-05 16:47:54,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:54,927 INFO L276 IsEmpty]: Start isEmpty. Operand 70258 states and 109692 transitions. [2025-02-05 16:47:54,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 16:47:54,929 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:47:54,930 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:47:54,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:47:54,930 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:47:54,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:47:54,931 INFO L85 PathProgramCache]: Analyzing trace with hash -232867147, now seen corresponding path program 1 times [2025-02-05 16:47:54,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:47:54,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673395535] [2025-02-05 16:47:54,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:47:54,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:47:54,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 16:47:54,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 16:47:54,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:47:54,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:47:55,067 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 16:47:55,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:47:55,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673395535] [2025-02-05 16:47:55,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673395535] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:47:55,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:47:55,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:47:55,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416730212] [2025-02-05 16:47:55,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:47:55,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:47:55,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:47:55,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:47:55,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:47:55,069 INFO L87 Difference]: Start difference. First operand 70258 states and 109692 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:55,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:47:55,846 INFO L93 Difference]: Finished difference Result 119968 states and 188028 transitions. [2025-02-05 16:47:55,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:47:55,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 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 103 [2025-02-05 16:47:55,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:47:56,000 INFO L225 Difference]: With dead ends: 119968 [2025-02-05 16:47:56,000 INFO L226 Difference]: Without dead ends: 98792 [2025-02-05 16:47:56,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:47:56,037 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 581 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:47:56,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 1142 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:47:56,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98792 states. [2025-02-05 16:47:57,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98792 to 95018. [2025-02-05 16:47:57,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95018 states, 95017 states have (on average 1.5619941694644117) internal successors, (148416), 95017 states have internal predecessors, (148416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:57,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95018 states to 95018 states and 148416 transitions. [2025-02-05 16:47:57,779 INFO L78 Accepts]: Start accepts. Automaton has 95018 states and 148416 transitions. Word has length 103 [2025-02-05 16:47:57,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:47:57,782 INFO L471 AbstractCegarLoop]: Abstraction has 95018 states and 148416 transitions. [2025-02-05 16:47:57,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:57,783 INFO L276 IsEmpty]: Start isEmpty. Operand 95018 states and 148416 transitions. [2025-02-05 16:47:57,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 16:47:57,784 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:47:57,784 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:47:57,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:47:57,784 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:47:57,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:47:57,785 INFO L85 PathProgramCache]: Analyzing trace with hash 545488215, now seen corresponding path program 1 times [2025-02-05 16:47:57,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:47:57,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863504395] [2025-02-05 16:47:57,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:47:57,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:47:57,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 16:47:57,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 16:47:57,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:47:57,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:47:57,854 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:47:57,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:47:57,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863504395] [2025-02-05 16:47:57,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863504395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:47:57,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:47:57,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:47:57,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129458525] [2025-02-05 16:47:57,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:47:57,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:47:57,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:47:57,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:47:57,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:47:57,856 INFO L87 Difference]: Start difference. First operand 95018 states and 148416 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:47:58,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:47:58,602 INFO L93 Difference]: Finished difference Result 279637 states and 436304 transitions. [2025-02-05 16:47:58,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:47:58,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-02-05 16:47:58,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:47:58,945 INFO L225 Difference]: With dead ends: 279637 [2025-02-05 16:47:58,945 INFO L226 Difference]: Without dead ends: 184696 [2025-02-05 16:47:59,024 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-02-05 16:47:59,026 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 159 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:47:59,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 523 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:47:59,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184696 states. [2025-02-05 16:48:01,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184696 to 184694. [2025-02-05 16:48:01,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184694 states, 184693 states have (on average 1.5503565376056483) internal successors, (286340), 184693 states have internal predecessors, (286340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:01,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184694 states to 184694 states and 286340 transitions. [2025-02-05 16:48:01,564 INFO L78 Accepts]: Start accepts. Automaton has 184694 states and 286340 transitions. Word has length 104 [2025-02-05 16:48:01,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:01,564 INFO L471 AbstractCegarLoop]: Abstraction has 184694 states and 286340 transitions. [2025-02-05 16:48:01,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:01,565 INFO L276 IsEmpty]: Start isEmpty. Operand 184694 states and 286340 transitions. [2025-02-05 16:48:01,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 16:48:01,567 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:01,567 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:48:01,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:48:01,568 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:48:01,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:01,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1722471881, now seen corresponding path program 1 times [2025-02-05 16:48:01,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:01,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835626160] [2025-02-05 16:48:01,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:01,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:01,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 16:48:01,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 16:48:01,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:01,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:01,622 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:48:01,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:01,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835626160] [2025-02-05 16:48:01,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835626160] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:01,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:01,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:48:01,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683309648] [2025-02-05 16:48:01,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:01,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:48:01,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:01,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:48:01,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:48:01,623 INFO L87 Difference]: Start difference. First operand 184694 states and 286340 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:03,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:03,744 INFO L93 Difference]: Finished difference Result 543285 states and 841201 transitions. [2025-02-05 16:48:03,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:48:03,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-02-05 16:48:03,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:04,513 INFO L225 Difference]: With dead ends: 543285 [2025-02-05 16:48:04,513 INFO L226 Difference]: Without dead ends: 358747 [2025-02-05 16:48:04,651 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-02-05 16:48:04,652 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 178 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:04,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 561 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:48:04,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358747 states. [2025-02-05 16:48:08,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358747 to 358745. [2025-02-05 16:48:08,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358745 states, 358744 states have (on average 1.5380466293512922) internal successors, (551765), 358744 states have internal predecessors, (551765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:09,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358745 states to 358745 states and 551765 transitions. [2025-02-05 16:48:09,417 INFO L78 Accepts]: Start accepts. Automaton has 358745 states and 551765 transitions. Word has length 104 [2025-02-05 16:48:09,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:09,417 INFO L471 AbstractCegarLoop]: Abstraction has 358745 states and 551765 transitions. [2025-02-05 16:48:09,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:09,417 INFO L276 IsEmpty]: Start isEmpty. Operand 358745 states and 551765 transitions. [2025-02-05 16:48:09,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 16:48:09,422 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:09,422 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:48:09,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:48:09,423 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:48:09,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:09,423 INFO L85 PathProgramCache]: Analyzing trace with hash 893569045, now seen corresponding path program 1 times [2025-02-05 16:48:09,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:09,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173699394] [2025-02-05 16:48:09,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:09,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:09,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 16:48:09,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 16:48:09,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:09,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:09,978 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:48:09,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:09,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173699394] [2025-02-05 16:48:09,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173699394] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:09,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:09,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:48:09,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274441228] [2025-02-05 16:48:09,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:09,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:48:09,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:09,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:48:09,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:48:09,982 INFO L87 Difference]: Start difference. First operand 358745 states and 551765 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:12,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:12,122 INFO L93 Difference]: Finished difference Result 580427 states and 895584 transitions. [2025-02-05 16:48:12,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:48:12,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-02-05 16:48:12,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:12,866 INFO L225 Difference]: With dead ends: 580427 [2025-02-05 16:48:12,867 INFO L226 Difference]: Without dead ends: 373893 [2025-02-05 16:48:12,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:48:12,985 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 259 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:12,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 741 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:48:13,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373893 states. [2025-02-05 16:48:16,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373893 to 251033. [2025-02-05 16:48:16,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251033 states, 251032 states have (on average 1.5335933267471875) internal successors, (384981), 251032 states have internal predecessors, (384981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:17,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251033 states to 251033 states and 384981 transitions. [2025-02-05 16:48:17,694 INFO L78 Accepts]: Start accepts. Automaton has 251033 states and 384981 transitions. Word has length 104 [2025-02-05 16:48:17,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:17,695 INFO L471 AbstractCegarLoop]: Abstraction has 251033 states and 384981 transitions. [2025-02-05 16:48:17,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:17,695 INFO L276 IsEmpty]: Start isEmpty. Operand 251033 states and 384981 transitions. [2025-02-05 16:48:17,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-05 16:48:17,699 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:17,699 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:48:17,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:48:17,699 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:48:17,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:17,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1326171118, now seen corresponding path program 1 times [2025-02-05 16:48:17,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:17,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652813722] [2025-02-05 16:48:17,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:17,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:17,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-05 16:48:17,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-05 16:48:17,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:17,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:17,809 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 16:48:17,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:17,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652813722] [2025-02-05 16:48:17,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652813722] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:17,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:17,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:48:17,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391465104] [2025-02-05 16:48:17,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:17,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:48:17,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:17,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:48:17,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:48:17,810 INFO L87 Difference]: Start difference. First operand 251033 states and 384981 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:20,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:48:20,283 INFO L93 Difference]: Finished difference Result 611583 states and 941677 transitions. [2025-02-05 16:48:20,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:48:20,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 105 [2025-02-05 16:48:20,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:48:21,091 INFO L225 Difference]: With dead ends: 611583 [2025-02-05 16:48:21,091 INFO L226 Difference]: Without dead ends: 360825 [2025-02-05 16:48:21,237 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-02-05 16:48:21,238 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 140 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:48:21,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 447 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:48:21,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360825 states. [2025-02-05 16:48:25,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360825 to 347467. [2025-02-05 16:48:25,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347467 states, 347466 states have (on average 1.5261493210846528) internal successors, (530285), 347466 states have internal predecessors, (530285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:26,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347467 states to 347467 states and 530285 transitions. [2025-02-05 16:48:26,624 INFO L78 Accepts]: Start accepts. Automaton has 347467 states and 530285 transitions. Word has length 105 [2025-02-05 16:48:26,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:48:26,625 INFO L471 AbstractCegarLoop]: Abstraction has 347467 states and 530285 transitions. [2025-02-05 16:48:26,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:48:26,625 INFO L276 IsEmpty]: Start isEmpty. Operand 347467 states and 530285 transitions. [2025-02-05 16:48:26,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-05 16:48:26,628 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:48:26,628 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:48:26,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:48:26,628 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:48:26,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:48:26,629 INFO L85 PathProgramCache]: Analyzing trace with hash 321178127, now seen corresponding path program 1 times [2025-02-05 16:48:26,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:48:26,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596803828] [2025-02-05 16:48:26,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:48:26,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:48:26,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-05 16:48:26,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-05 16:48:26,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:48:26,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:48:26,670 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 16:48:26,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:48:26,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596803828] [2025-02-05 16:48:26,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596803828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:48:26,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:48:26,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:48:26,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800252370] [2025-02-05 16:48:26,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:48:26,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:48:26,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:48:26,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:48:26,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:48:26,671 INFO L87 Difference]: Start difference. First operand 347467 states and 530285 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)