./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.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_lcr.7.ufo.BOUNDED-14.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 2b8cc349a19a972b0be64ea80cb0d8ffd687af01d6d76bd436b271bb666f9a3a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:45:49,858 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:45:49,910 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:45:49,913 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:45:49,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:45:49,935 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:45:49,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:45:49,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:45:49,938 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:45:49,938 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:45:49,938 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:45:49,938 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:45:49,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:45:49,939 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:45:49,939 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:45:49,939 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:45:49,939 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:45:49,939 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:45:49,939 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:45:49,940 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:45:49,940 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:45:49,940 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:45:49,940 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:45:49,940 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:45:49,940 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:45:49,940 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:45:49,941 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:45:49,941 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:45:49,941 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:45:49,941 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:45:49,941 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:45:49,941 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:45:49,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:45:49,941 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:45:49,941 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:45:49,942 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:45:49,942 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:45:49,942 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:45:49,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:45:49,942 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:45:49,942 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:45:49,942 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:45:49,942 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:45:49,942 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 -> 2b8cc349a19a972b0be64ea80cb0d8ffd687af01d6d76bd436b271bb666f9a3a [2025-02-05 16:45:50,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:45:50,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:45:50,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:45:50,173 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:45:50,173 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:45:50,177 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c [2025-02-05 16:45:51,369 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/80458d243/287f75c9fa9a4fc8b51c225426ac0353/FLAGa785d3215 [2025-02-05 16:45:51,613 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:45:51,613 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c [2025-02-05 16:45:51,620 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/80458d243/287f75c9fa9a4fc8b51c225426ac0353/FLAGa785d3215 [2025-02-05 16:45:51,631 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/80458d243/287f75c9fa9a4fc8b51c225426ac0353 [2025-02-05 16:45:51,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:45:51,634 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:45:51,635 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:45:51,635 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:45:51,637 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:45:51,638 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:45:51" (1/1) ... [2025-02-05 16:45:51,639 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f887bec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:51, skipping insertion in model container [2025-02-05 16:45:51,639 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:45:51" (1/1) ... [2025-02-05 16:45:51,656 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:45:51,806 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_lcr.7.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c[7631,7644] [2025-02-05 16:45:51,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:45:51,839 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:45:51,874 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_lcr.7.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c[7631,7644] [2025-02-05 16:45:51,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:45:51,899 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:45:51,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:51 WrapperNode [2025-02-05 16:45:51,900 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:45:51,901 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:45:51,901 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:45:51,901 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:45:51,905 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:45:51" (1/1) ... [2025-02-05 16:45:51,912 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:45:51" (1/1) ... [2025-02-05 16:45:51,933 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 629 [2025-02-05 16:45:51,933 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:45:51,934 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:45:51,934 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:45:51,934 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:45:51,940 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:51" (1/1) ... [2025-02-05 16:45:51,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:51" (1/1) ... [2025-02-05 16:45:51,942 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:51" (1/1) ... [2025-02-05 16:45:51,953 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:45:51,954 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:51" (1/1) ... [2025-02-05 16:45:51,954 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:51" (1/1) ... [2025-02-05 16:45:51,971 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:51" (1/1) ... [2025-02-05 16:45:51,972 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:51" (1/1) ... [2025-02-05 16:45:51,973 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:51" (1/1) ... [2025-02-05 16:45:51,974 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:51" (1/1) ... [2025-02-05 16:45:51,976 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:45:51,977 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:45:51,977 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:45:51,977 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:45:51,977 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:51" (1/1) ... [2025-02-05 16:45:51,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:45:51,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:45:52,004 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:45:52,008 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:45:52,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:45:52,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:45:52,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:45:52,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:45:52,150 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:45:52,152 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:45:52,626 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L680: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-02-05 16:45:52,626 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L500: havoc main_~node6____CPAchecker_TMP_0~0#1; [2025-02-05 16:45:52,626 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L635: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-02-05 16:45:52,626 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L455: havoc main_~node7____CPAchecker_TMP_0~0#1; [2025-02-05 16:45:52,626 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L340: havoc main_~node7__m7~0#1; [2025-02-05 16:45:52,626 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L325: havoc main_~node6__m6~0#1; [2025-02-05 16:45:52,626 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L590: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-02-05 16:45:52,626 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L310: havoc main_~node5__m5~0#1; [2025-02-05 16:45:52,626 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L295: havoc main_~node4__m4~0#1; [2025-02-05 16:45:52,626 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L725: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-02-05 16:45:52,626 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L395: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-05 16:45:52,626 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L280: havoc main_~node3__m3~0#1; [2025-02-05 16:45:52,627 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L545: havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-02-05 16:45:52,627 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L265: havoc main_~node2__m2~0#1; [2025-02-05 16:45:52,627 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L249: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-02-05 16:45:52,662 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2025-02-05 16:45:52,662 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:45:52,677 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:45:52,677 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:45:52,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:45:52 BoogieIcfgContainer [2025-02-05 16:45:52,677 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:45:52,679 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:45:52,679 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:45:52,683 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:45:52,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:45:51" (1/3) ... [2025-02-05 16:45:52,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ae21d91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:45:52, skipping insertion in model container [2025-02-05 16:45:52,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:51" (2/3) ... [2025-02-05 16:45:52,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ae21d91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:45:52, skipping insertion in model container [2025-02-05 16:45:52,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:45:52" (3/3) ... [2025-02-05 16:45:52,686 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c [2025-02-05 16:45:52,696 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:45:52,699 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.7.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c that has 1 procedures, 136 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:45:52,767 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:45:52,777 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;@3f821489, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:45:52,777 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:45:52,782 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 134 states have (on average 1.7537313432835822) internal successors, (235), 135 states have internal predecessors, (235), 0 states have call successors, (0), 0 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:45:52,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 16:45:52,788 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:52,788 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:45:52,789 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:45:52,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:52,793 INFO L85 PathProgramCache]: Analyzing trace with hash -550288976, now seen corresponding path program 1 times [2025-02-05 16:45:52,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:52,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039023798] [2025-02-05 16:45:52,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:52,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:52,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 16:45:52,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 16:45:52,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:52,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:53,185 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:45:53,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:53,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039023798] [2025-02-05 16:45:53,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039023798] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:53,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:53,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:45:53,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646433209] [2025-02-05 16:45:53,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:53,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:45:53,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:53,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:45:53,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:45:53,215 INFO L87 Difference]: Start difference. First operand has 136 states, 134 states have (on average 1.7537313432835822) internal successors, (235), 135 states have internal predecessors, (235), 0 states have call successors, (0), 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 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:45:53,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:53,275 INFO L93 Difference]: Finished difference Result 294 states and 484 transitions. [2025-02-05 16:45:53,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:45:53,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-02-05 16:45:53,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:53,286 INFO L225 Difference]: With dead ends: 294 [2025-02-05 16:45:53,286 INFO L226 Difference]: Without dead ends: 205 [2025-02-05 16:45:53,288 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:45:53,290 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 166 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:53,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 475 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:45:53,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-05 16:45:53,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 203. [2025-02-05 16:45:53,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 1.4455445544554455) internal successors, (292), 202 states have internal predecessors, (292), 0 states have call successors, (0), 0 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:45:53,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 292 transitions. [2025-02-05 16:45:53,318 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 292 transitions. Word has length 86 [2025-02-05 16:45:53,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:53,319 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 292 transitions. [2025-02-05 16:45:53,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:45:53,319 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 292 transitions. [2025-02-05 16:45:53,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 16:45:53,322 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:53,322 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:45:53,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:45:53,322 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:45:53,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:53,323 INFO L85 PathProgramCache]: Analyzing trace with hash -133436541, now seen corresponding path program 1 times [2025-02-05 16:45:53,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:53,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542159100] [2025-02-05 16:45:53,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:53,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:53,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 16:45:53,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 16:45:53,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:53,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:53,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:45:53,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:53,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542159100] [2025-02-05 16:45:53,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542159100] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:53,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:53,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:45:53,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804768640] [2025-02-05 16:45:53,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:53,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:45:53,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:53,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:45:53,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:45:53,508 INFO L87 Difference]: Start difference. First operand 203 states and 292 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:53,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:53,534 INFO L93 Difference]: Finished difference Result 487 states and 744 transitions. [2025-02-05 16:45:53,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:45:53,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-02-05 16:45:53,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:53,540 INFO L225 Difference]: With dead ends: 487 [2025-02-05 16:45:53,540 INFO L226 Difference]: Without dead ends: 337 [2025-02-05 16:45:53,540 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:45:53,541 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 112 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 408 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:45:53,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 408 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:45:53,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-02-05 16:45:53,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2025-02-05 16:45:53,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.5029940119760479) internal successors, (502), 334 states have internal predecessors, (502), 0 states have call successors, (0), 0 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:45:53,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 502 transitions. [2025-02-05 16:45:53,567 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 502 transitions. Word has length 87 [2025-02-05 16:45:53,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:53,567 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 502 transitions. [2025-02-05 16:45:53,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:53,568 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 502 transitions. [2025-02-05 16:45:53,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-05 16:45:53,569 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:53,569 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:45:53,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:45:53,569 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:45:53,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:53,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1768129219, now seen corresponding path program 1 times [2025-02-05 16:45:53,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:53,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528981909] [2025-02-05 16:45:53,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:53,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:53,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 16:45:53,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 16:45:53,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:53,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:53,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:45:53,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:53,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528981909] [2025-02-05 16:45:53,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528981909] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:53,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:53,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:45:53,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935883373] [2025-02-05 16:45:53,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:53,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:45:53,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:53,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:45:53,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:45:53,723 INFO L87 Difference]: Start difference. First operand 335 states and 502 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 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:45:53,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:53,761 INFO L93 Difference]: Finished difference Result 867 states and 1348 transitions. [2025-02-05 16:45:53,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:45:53,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-02-05 16:45:53,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:53,765 INFO L225 Difference]: With dead ends: 867 [2025-02-05 16:45:53,765 INFO L226 Difference]: Without dead ends: 585 [2025-02-05 16:45:53,766 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:45:53,767 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 107 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 404 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:45:53,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 404 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:45:53,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-02-05 16:45:53,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 583. [2025-02-05 16:45:53,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 582 states have (on average 1.5360824742268042) internal successors, (894), 582 states have internal predecessors, (894), 0 states have call successors, (0), 0 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:45:53,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 894 transitions. [2025-02-05 16:45:53,789 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 894 transitions. Word has length 88 [2025-02-05 16:45:53,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:53,789 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 894 transitions. [2025-02-05 16:45:53,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 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:45:53,789 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 894 transitions. [2025-02-05 16:45:53,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 16:45:53,791 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:53,791 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:45:53,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:45:53,791 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:45:53,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:53,792 INFO L85 PathProgramCache]: Analyzing trace with hash -19676560, now seen corresponding path program 1 times [2025-02-05 16:45:53,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:53,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736111104] [2025-02-05 16:45:53,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:53,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:53,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 16:45:53,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 16:45:53,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:53,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:53,913 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:45:53,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:53,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736111104] [2025-02-05 16:45:53,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736111104] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:53,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:53,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:45:53,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256393319] [2025-02-05 16:45:53,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:53,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:45:53,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:53,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:45:53,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:45:53,915 INFO L87 Difference]: Start difference. First operand 583 states and 894 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 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:45:53,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:53,945 INFO L93 Difference]: Finished difference Result 1579 states and 2472 transitions. [2025-02-05 16:45:53,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:45:53,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-02-05 16:45:53,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:53,952 INFO L225 Difference]: With dead ends: 1579 [2025-02-05 16:45:53,952 INFO L226 Difference]: Without dead ends: 1049 [2025-02-05 16:45:53,953 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:45:53,953 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 102 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 400 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:45:53,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 400 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:45:53,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2025-02-05 16:45:53,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 1047. [2025-02-05 16:45:53,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 1046 states have (on average 1.5506692160611855) internal successors, (1622), 1046 states have internal predecessors, (1622), 0 states have call successors, (0), 0 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:45:53,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1622 transitions. [2025-02-05 16:45:53,990 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1622 transitions. Word has length 89 [2025-02-05 16:45:53,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:53,991 INFO L471 AbstractCegarLoop]: Abstraction has 1047 states and 1622 transitions. [2025-02-05 16:45:53,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 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:45:53,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1622 transitions. [2025-02-05 16:45:53,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 16:45:53,992 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:53,992 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:45:53,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:45:53,993 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:45:53,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:53,993 INFO L85 PathProgramCache]: Analyzing trace with hash -986734134, now seen corresponding path program 1 times [2025-02-05 16:45:53,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:53,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99570231] [2025-02-05 16:45:53,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:53,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:54,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 16:45:54,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 16:45:54,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:54,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:54,112 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:45:54,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:54,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99570231] [2025-02-05 16:45:54,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99570231] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:54,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:54,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:45:54,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934467404] [2025-02-05 16:45:54,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:54,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:45:54,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:54,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:45:54,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:45:54,115 INFO L87 Difference]: Start difference. First operand 1047 states and 1622 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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:45:54,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:54,149 INFO L93 Difference]: Finished difference Result 2907 states and 4552 transitions. [2025-02-05 16:45:54,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:45:54,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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 90 [2025-02-05 16:45:54,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:54,156 INFO L225 Difference]: With dead ends: 2907 [2025-02-05 16:45:54,157 INFO L226 Difference]: Without dead ends: 1913 [2025-02-05 16:45:54,158 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:45:54,159 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 97 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 396 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:45:54,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 396 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:45:54,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1913 states. [2025-02-05 16:45:54,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1913 to 1911. [2025-02-05 16:45:54,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1911 states, 1910 states have (on average 1.5528795811518326) internal successors, (2966), 1910 states have internal predecessors, (2966), 0 states have call successors, (0), 0 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:45:54,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1911 states and 2966 transitions. [2025-02-05 16:45:54,208 INFO L78 Accepts]: Start accepts. Automaton has 1911 states and 2966 transitions. Word has length 90 [2025-02-05 16:45:54,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:54,208 INFO L471 AbstractCegarLoop]: Abstraction has 1911 states and 2966 transitions. [2025-02-05 16:45:54,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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:45:54,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 2966 transitions. [2025-02-05 16:45:54,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 16:45:54,212 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:54,212 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:45:54,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:45:54,215 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:45:54,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:54,216 INFO L85 PathProgramCache]: Analyzing trace with hash 186796637, now seen corresponding path program 1 times [2025-02-05 16:45:54,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:54,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082466853] [2025-02-05 16:45:54,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:54,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:54,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 16:45:54,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 16:45:54,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:54,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:54,301 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:45:54,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:54,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082466853] [2025-02-05 16:45:54,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082466853] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:54,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:54,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:45:54,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577735247] [2025-02-05 16:45:54,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:54,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:45:54,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:54,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:45:54,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:45:54,303 INFO L87 Difference]: Start difference. First operand 1911 states and 2966 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 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:45:54,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:54,336 INFO L93 Difference]: Finished difference Result 5371 states and 8376 transitions. [2025-02-05 16:45:54,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:45:54,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-02-05 16:45:54,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:54,349 INFO L225 Difference]: With dead ends: 5371 [2025-02-05 16:45:54,349 INFO L226 Difference]: Without dead ends: 3513 [2025-02-05 16:45:54,352 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:45:54,353 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 92 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 392 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:45:54,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 392 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:45:54,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3513 states. [2025-02-05 16:45:54,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3513 to 3511. [2025-02-05 16:45:54,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3511 states, 3510 states have (on average 1.547008547008547) internal successors, (5430), 3510 states have internal predecessors, (5430), 0 states have call successors, (0), 0 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:45:54,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3511 states to 3511 states and 5430 transitions. [2025-02-05 16:45:54,466 INFO L78 Accepts]: Start accepts. Automaton has 3511 states and 5430 transitions. Word has length 91 [2025-02-05 16:45:54,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:54,466 INFO L471 AbstractCegarLoop]: Abstraction has 3511 states and 5430 transitions. [2025-02-05 16:45:54,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 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:45:54,466 INFO L276 IsEmpty]: Start isEmpty. Operand 3511 states and 5430 transitions. [2025-02-05 16:45:54,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 16:45:54,468 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:54,469 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:45:54,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:45:54,469 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:45:54,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:54,470 INFO L85 PathProgramCache]: Analyzing trace with hash -791823816, now seen corresponding path program 1 times [2025-02-05 16:45:54,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:54,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766571878] [2025-02-05 16:45:54,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:54,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:54,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 16:45:54,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 16:45:54,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:54,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:54,544 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:45:54,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:54,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766571878] [2025-02-05 16:45:54,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766571878] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:54,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:54,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:45:54,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326317507] [2025-02-05 16:45:54,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:54,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:45:54,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:54,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:45:54,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:45:54,547 INFO L87 Difference]: Start difference. First operand 3511 states and 5430 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:45:54,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:54,595 INFO L93 Difference]: Finished difference Result 9915 states and 15352 transitions. [2025-02-05 16:45:54,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:45:54,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-02-05 16:45:54,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:54,616 INFO L225 Difference]: With dead ends: 9915 [2025-02-05 16:45:54,616 INFO L226 Difference]: Without dead ends: 6457 [2025-02-05 16:45:54,622 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:45:54,623 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 87 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 388 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:45:54,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 388 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:45:54,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6457 states. [2025-02-05 16:45:54,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6457 to 6455. [2025-02-05 16:45:54,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6455 states, 6454 states have (on average 1.5354818717074683) internal successors, (9910), 6454 states have internal predecessors, (9910), 0 states have call successors, (0), 0 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:45:54,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6455 states to 6455 states and 9910 transitions. [2025-02-05 16:45:54,740 INFO L78 Accepts]: Start accepts. Automaton has 6455 states and 9910 transitions. Word has length 92 [2025-02-05 16:45:54,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:54,741 INFO L471 AbstractCegarLoop]: Abstraction has 6455 states and 9910 transitions. [2025-02-05 16:45:54,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:45:54,741 INFO L276 IsEmpty]: Start isEmpty. Operand 6455 states and 9910 transitions. [2025-02-05 16:45:54,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 16:45:54,742 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:54,742 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:45:54,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:45:54,742 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:45:54,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:54,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1286482807, now seen corresponding path program 1 times [2025-02-05 16:45:54,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:54,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099132812] [2025-02-05 16:45:54,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:54,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:54,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 16:45:54,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 16:45:54,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:54,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:54,935 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:45:54,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:54,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099132812] [2025-02-05 16:45:54,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099132812] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:54,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:54,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:45:54,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563011405] [2025-02-05 16:45:54,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:54,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:54,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:54,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:54,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:54,937 INFO L87 Difference]: Start difference. First operand 6455 states and 9910 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:55,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:55,522 INFO L93 Difference]: Finished difference Result 96083 states and 147908 transitions. [2025-02-05 16:45:55,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:45:55,523 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-02-05 16:45:55,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:55,704 INFO L225 Difference]: With dead ends: 96083 [2025-02-05 16:45:55,704 INFO L226 Difference]: Without dead ends: 89681 [2025-02-05 16:45:55,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2025-02-05 16:45:55,738 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 1949 mSDsluCounter, 4856 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1949 SdHoareTripleChecker+Valid, 5032 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:55,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1949 Valid, 5032 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:45:55,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89681 states. [2025-02-05 16:45:56,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89681 to 12855. [2025-02-05 16:45:56,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12855 states, 12854 states have (on average 1.5178154660028007) internal successors, (19510), 12854 states have internal predecessors, (19510), 0 states have call successors, (0), 0 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:45:56,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12855 states to 12855 states and 19510 transitions. [2025-02-05 16:45:56,551 INFO L78 Accepts]: Start accepts. Automaton has 12855 states and 19510 transitions. Word has length 93 [2025-02-05 16:45:56,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:56,551 INFO L471 AbstractCegarLoop]: Abstraction has 12855 states and 19510 transitions. [2025-02-05 16:45:56,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:56,552 INFO L276 IsEmpty]: Start isEmpty. Operand 12855 states and 19510 transitions. [2025-02-05 16:45:56,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:45:56,553 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:56,553 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:45:56,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:45:56,554 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:45:56,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:56,554 INFO L85 PathProgramCache]: Analyzing trace with hash 679487282, now seen corresponding path program 1 times [2025-02-05 16:45:56,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:56,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139849283] [2025-02-05 16:45:56,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:56,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:56,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:45:56,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:45:56,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:56,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:56,644 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:45:56,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:56,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139849283] [2025-02-05 16:45:56,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139849283] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:56,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:56,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:45:56,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587972732] [2025-02-05 16:45:56,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:56,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:45:56,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:56,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:45:56,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:45:56,646 INFO L87 Difference]: Start difference. First operand 12855 states and 19510 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:45:56,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:56,703 INFO L93 Difference]: Finished difference Result 31869 states and 48378 transitions. [2025-02-05 16:45:56,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:45:56,704 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 95 [2025-02-05 16:45:56,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:56,732 INFO L225 Difference]: With dead ends: 31869 [2025-02-05 16:45:56,733 INFO L226 Difference]: Without dead ends: 19067 [2025-02-05 16:45:56,747 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:45:56,750 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 78 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:56,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 348 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:45:56,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19067 states. [2025-02-05 16:45:56,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19067 to 19065. [2025-02-05 16:45:56,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19065 states, 19064 states have (on average 1.506924045321024) internal successors, (28728), 19064 states have internal predecessors, (28728), 0 states have call successors, (0), 0 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:45:56,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19065 states to 19065 states and 28728 transitions. [2025-02-05 16:45:56,987 INFO L78 Accepts]: Start accepts. Automaton has 19065 states and 28728 transitions. Word has length 95 [2025-02-05 16:45:56,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:56,987 INFO L471 AbstractCegarLoop]: Abstraction has 19065 states and 28728 transitions. [2025-02-05 16:45:56,987 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:45:56,987 INFO L276 IsEmpty]: Start isEmpty. Operand 19065 states and 28728 transitions. [2025-02-05 16:45:56,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:45:56,988 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:56,988 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:45:56,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:45:56,988 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:45:56,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:56,988 INFO L85 PathProgramCache]: Analyzing trace with hash 680649131, now seen corresponding path program 1 times [2025-02-05 16:45:56,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:56,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857431506] [2025-02-05 16:45:56,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:56,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:57,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:45:57,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:45:57,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:57,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:57,358 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:45:57,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:57,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857431506] [2025-02-05 16:45:57,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857431506] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:57,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:57,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:45:57,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699142405] [2025-02-05 16:45:57,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:57,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:57,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:57,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:57,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:57,360 INFO L87 Difference]: Start difference. First operand 19065 states and 28728 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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:45:57,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:57,699 INFO L93 Difference]: Finished difference Result 38077 states and 57402 transitions. [2025-02-05 16:45:57,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:45:57,700 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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 95 [2025-02-05 16:45:57,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:57,730 INFO L225 Difference]: With dead ends: 38077 [2025-02-05 16:45:57,730 INFO L226 Difference]: Without dead ends: 19067 [2025-02-05 16:45:57,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:45:57,747 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 376 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:57,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 915 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:45:57,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19067 states. [2025-02-05 16:45:58,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19067 to 19065. [2025-02-05 16:45:58,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19065 states, 19064 states have (on average 1.496852706672262) internal successors, (28536), 19064 states have internal predecessors, (28536), 0 states have call successors, (0), 0 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:45:58,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19065 states to 19065 states and 28536 transitions. [2025-02-05 16:45:58,076 INFO L78 Accepts]: Start accepts. Automaton has 19065 states and 28536 transitions. Word has length 95 [2025-02-05 16:45:58,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:58,076 INFO L471 AbstractCegarLoop]: Abstraction has 19065 states and 28536 transitions. [2025-02-05 16:45:58,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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:45:58,077 INFO L276 IsEmpty]: Start isEmpty. Operand 19065 states and 28536 transitions. [2025-02-05 16:45:58,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:45:58,077 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:58,077 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:45:58,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:45:58,078 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:45:58,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:58,079 INFO L85 PathProgramCache]: Analyzing trace with hash -373758048, now seen corresponding path program 1 times [2025-02-05 16:45:58,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:58,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354144088] [2025-02-05 16:45:58,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:58,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:58,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:45:58,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:45:58,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:58,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:58,198 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:45:58,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:58,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354144088] [2025-02-05 16:45:58,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354144088] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:58,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:58,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:45:58,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572274572] [2025-02-05 16:45:58,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:58,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:45:58,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:58,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:45:58,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:45:58,200 INFO L87 Difference]: Start difference. First operand 19065 states and 28536 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 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:45:58,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:58,328 INFO L93 Difference]: Finished difference Result 38075 states and 57017 transitions. [2025-02-05 16:45:58,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:45:58,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 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 96 [2025-02-05 16:45:58,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:58,348 INFO L225 Difference]: With dead ends: 38075 [2025-02-05 16:45:58,348 INFO L226 Difference]: Without dead ends: 19065 [2025-02-05 16:45:58,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:45:58,365 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 408 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:58,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 155 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:45:58,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19065 states. [2025-02-05 16:45:58,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19065 to 19065. [2025-02-05 16:45:58,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19065 states, 19064 states have (on average 1.4867813680234998) internal successors, (28344), 19064 states have internal predecessors, (28344), 0 states have call successors, (0), 0 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:45:58,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19065 states to 19065 states and 28344 transitions. [2025-02-05 16:45:58,609 INFO L78 Accepts]: Start accepts. Automaton has 19065 states and 28344 transitions. Word has length 96 [2025-02-05 16:45:58,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:58,609 INFO L471 AbstractCegarLoop]: Abstraction has 19065 states and 28344 transitions. [2025-02-05 16:45:58,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 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:45:58,609 INFO L276 IsEmpty]: Start isEmpty. Operand 19065 states and 28344 transitions. [2025-02-05 16:45:58,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:45:58,610 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:58,610 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:45:58,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:45:58,610 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:45:58,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:58,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1416639807, now seen corresponding path program 1 times [2025-02-05 16:45:58,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:58,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390831504] [2025-02-05 16:45:58,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:58,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:58,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:45:58,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:45:58,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:58,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:58,938 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:45:58,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:58,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390831504] [2025-02-05 16:45:58,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390831504] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:58,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:58,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:45:58,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671361849] [2025-02-05 16:45:58,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:58,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:45:58,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:58,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:45:58,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:45:58,939 INFO L87 Difference]: Start difference. First operand 19065 states and 28344 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:45:59,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:59,001 INFO L93 Difference]: Finished difference Result 19579 states and 29113 transitions. [2025-02-05 16:45:59,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:45:59,002 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 96 [2025-02-05 16:45:59,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:59,021 INFO L225 Difference]: With dead ends: 19579 [2025-02-05 16:45:59,022 INFO L226 Difference]: Without dead ends: 19577 [2025-02-05 16:45:59,028 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:45:59,028 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:59,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 692 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:45:59,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19577 states. [2025-02-05 16:45:59,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19577 to 19577. [2025-02-05 16:45:59,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19577 states, 19576 states have (on average 1.4707805476093174) internal successors, (28792), 19576 states have internal predecessors, (28792), 0 states have call successors, (0), 0 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:45:59,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19577 states to 19577 states and 28792 transitions. [2025-02-05 16:45:59,288 INFO L78 Accepts]: Start accepts. Automaton has 19577 states and 28792 transitions. Word has length 96 [2025-02-05 16:45:59,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:59,288 INFO L471 AbstractCegarLoop]: Abstraction has 19577 states and 28792 transitions. [2025-02-05 16:45:59,288 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:45:59,288 INFO L276 IsEmpty]: Start isEmpty. Operand 19577 states and 28792 transitions. [2025-02-05 16:45:59,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 16:45:59,298 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:59,298 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:45:59,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:45:59,299 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:45:59,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:59,299 INFO L85 PathProgramCache]: Analyzing trace with hash -125953132, now seen corresponding path program 1 times [2025-02-05 16:45:59,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:59,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808050042] [2025-02-05 16:45:59,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:59,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:59,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 16:45:59,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 16:45:59,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:59,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:59,543 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:45:59,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:59,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808050042] [2025-02-05 16:45:59,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808050042] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:59,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:59,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:45:59,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117789705] [2025-02-05 16:45:59,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:59,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:59,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:59,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:59,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:59,546 INFO L87 Difference]: Start difference. First operand 19577 states and 28792 transitions. Second operand has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 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:46:00,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:00,096 INFO L93 Difference]: Finished difference Result 153609 states and 226016 transitions. [2025-02-05 16:46:00,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:46:00,097 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 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 130 [2025-02-05 16:46:00,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:00,399 INFO L225 Difference]: With dead ends: 153609 [2025-02-05 16:46:00,399 INFO L226 Difference]: Without dead ends: 140295 [2025-02-05 16:46:00,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-02-05 16:46:00,424 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 1571 mSDsluCounter, 2589 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1571 SdHoareTripleChecker+Valid, 2895 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:00,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1571 Valid, 2895 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:46:00,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140295 states. [2025-02-05 16:46:01,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140295 to 36025. [2025-02-05 16:46:01,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36025 states, 36024 states have (on average 1.4663557628247834) internal successors, (52824), 36024 states have internal predecessors, (52824), 0 states have call successors, (0), 0 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:46:01,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36025 states to 36025 states and 52824 transitions. [2025-02-05 16:46:01,364 INFO L78 Accepts]: Start accepts. Automaton has 36025 states and 52824 transitions. Word has length 130 [2025-02-05 16:46:01,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:01,364 INFO L471 AbstractCegarLoop]: Abstraction has 36025 states and 52824 transitions. [2025-02-05 16:46:01,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.333333333333334) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 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:46:01,364 INFO L276 IsEmpty]: Start isEmpty. Operand 36025 states and 52824 transitions. [2025-02-05 16:46:01,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 16:46:01,372 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:01,372 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:01,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:46:01,372 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:01,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:01,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1958510796, now seen corresponding path program 1 times [2025-02-05 16:46:01,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:01,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303761043] [2025-02-05 16:46:01,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:01,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:01,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 16:46:01,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 16:46:01,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:01,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:01,634 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:46:01,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:01,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303761043] [2025-02-05 16:46:01,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303761043] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:01,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:01,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:46:01,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645006392] [2025-02-05 16:46:01,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:01,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:01,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:01,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:01,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:01,635 INFO L87 Difference]: Start difference. First operand 36025 states and 52824 transitions. Second operand has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 9 states have internal predecessors, (128), 0 states have call successors, (0), 0 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:46:02,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:02,062 INFO L93 Difference]: Finished difference Result 173129 states and 254624 transitions. [2025-02-05 16:46:02,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:46:02,062 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 9 states have internal predecessors, (128), 0 states have call successors, (0), 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 130 [2025-02-05 16:46:02,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:02,213 INFO L225 Difference]: With dead ends: 173129 [2025-02-05 16:46:02,213 INFO L226 Difference]: Without dead ends: 153607 [2025-02-05 16:46:02,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-02-05 16:46:02,401 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 1574 mSDsluCounter, 2493 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1574 SdHoareTripleChecker+Valid, 2798 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:02,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1574 Valid, 2798 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:46:02,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153607 states. [2025-02-05 16:46:03,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153607 to 62201. [2025-02-05 16:46:03,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62201 states, 62200 states have (on average 1.4635369774919613) internal successors, (91032), 62200 states have internal predecessors, (91032), 0 states have call successors, (0), 0 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:46:03,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62201 states to 62201 states and 91032 transitions. [2025-02-05 16:46:03,602 INFO L78 Accepts]: Start accepts. Automaton has 62201 states and 91032 transitions. Word has length 130 [2025-02-05 16:46:03,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:03,602 INFO L471 AbstractCegarLoop]: Abstraction has 62201 states and 91032 transitions. [2025-02-05 16:46:03,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 9 states have internal predecessors, (128), 0 states have call successors, (0), 0 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:46:03,602 INFO L276 IsEmpty]: Start isEmpty. Operand 62201 states and 91032 transitions. [2025-02-05 16:46:03,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 16:46:03,612 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:03,613 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:03,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:46:03,613 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:03,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:03,614 INFO L85 PathProgramCache]: Analyzing trace with hash 713798356, now seen corresponding path program 1 times [2025-02-05 16:46:03,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:03,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972983285] [2025-02-05 16:46:03,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:03,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:03,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 16:46:03,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 16:46:03,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:03,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:03,841 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:46:03,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:03,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972983285] [2025-02-05 16:46:03,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972983285] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:03,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:03,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:46:03,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526144628] [2025-02-05 16:46:03,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:03,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:03,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:03,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:03,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:03,842 INFO L87 Difference]: Start difference. First operand 62201 states and 91032 transitions. Second operand has 9 states, 9 states have (on average 14.11111111111111) internal successors, (127), 9 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:46:04,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:04,470 INFO L93 Difference]: Finished difference Result 192649 states and 283168 transitions. [2025-02-05 16:46:04,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:46:04,471 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.11111111111111) internal successors, (127), 9 states have internal predecessors, (127), 0 states have call successors, (0), 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 130 [2025-02-05 16:46:04,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:04,678 INFO L225 Difference]: With dead ends: 192649 [2025-02-05 16:46:04,678 INFO L226 Difference]: Without dead ends: 173127 [2025-02-05 16:46:04,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-02-05 16:46:04,737 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 1603 mSDsluCounter, 2421 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1603 SdHoareTripleChecker+Valid, 2724 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:04,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1603 Valid, 2724 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:46:04,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173127 states. [2025-02-05 16:46:06,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173127 to 81721. [2025-02-05 16:46:06,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81721 states, 81720 states have (on average 1.463240332843857) internal successors, (119576), 81720 states have internal predecessors, (119576), 0 states have call successors, (0), 0 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:46:06,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81721 states to 81721 states and 119576 transitions. [2025-02-05 16:46:06,526 INFO L78 Accepts]: Start accepts. Automaton has 81721 states and 119576 transitions. Word has length 130 [2025-02-05 16:46:06,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:06,526 INFO L471 AbstractCegarLoop]: Abstraction has 81721 states and 119576 transitions. [2025-02-05 16:46:06,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.11111111111111) internal successors, (127), 9 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:46:06,526 INFO L276 IsEmpty]: Start isEmpty. Operand 81721 states and 119576 transitions. [2025-02-05 16:46:06,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 16:46:06,536 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:06,536 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:06,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:46:06,536 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:06,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:06,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1472285068, now seen corresponding path program 1 times [2025-02-05 16:46:06,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:06,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465445663] [2025-02-05 16:46:06,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:06,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:06,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 16:46:06,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 16:46:06,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:06,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:06,760 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:46:06,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:06,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465445663] [2025-02-05 16:46:06,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465445663] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:06,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:06,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:46:06,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108862026] [2025-02-05 16:46:06,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:06,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:06,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:06,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:06,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:06,762 INFO L87 Difference]: Start difference. First operand 81721 states and 119576 transitions. Second operand has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 0 states have call successors, (0), 0 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:46:07,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:07,523 INFO L93 Difference]: Finished difference Result 212169 states and 311712 transitions. [2025-02-05 16:46:07,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:46:07,524 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 0 states have call successors, (0), 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 130 [2025-02-05 16:46:07,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:07,725 INFO L225 Difference]: With dead ends: 212169 [2025-02-05 16:46:07,726 INFO L226 Difference]: Without dead ends: 192647 [2025-02-05 16:46:07,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-02-05 16:46:07,774 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 1656 mSDsluCounter, 2328 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1656 SdHoareTripleChecker+Valid, 2629 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:07,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1656 Valid, 2629 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:46:07,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192647 states. [2025-02-05 16:46:09,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192647 to 101241. [2025-02-05 16:46:09,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101241 states, 101240 states have (on average 1.4630580798103516) internal successors, (148120), 101240 states have internal predecessors, (148120), 0 states have call successors, (0), 0 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:46:09,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101241 states to 101241 states and 148120 transitions. [2025-02-05 16:46:09,678 INFO L78 Accepts]: Start accepts. Automaton has 101241 states and 148120 transitions. Word has length 130 [2025-02-05 16:46:09,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:09,678 INFO L471 AbstractCegarLoop]: Abstraction has 101241 states and 148120 transitions. [2025-02-05 16:46:09,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 9 states have internal predecessors, (126), 0 states have call successors, (0), 0 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:46:09,678 INFO L276 IsEmpty]: Start isEmpty. Operand 101241 states and 148120 transitions. [2025-02-05 16:46:09,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 16:46:09,688 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:09,688 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:09,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:46:09,688 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:09,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:09,688 INFO L85 PathProgramCache]: Analyzing trace with hash 172263956, now seen corresponding path program 1 times [2025-02-05 16:46:09,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:09,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879389169] [2025-02-05 16:46:09,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:09,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:09,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 16:46:09,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 16:46:09,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:09,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:09,910 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 16:46:09,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:09,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879389169] [2025-02-05 16:46:09,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879389169] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:09,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:09,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:46:09,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760131934] [2025-02-05 16:46:09,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:09,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:09,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:09,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:09,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:09,913 INFO L87 Difference]: Start difference. First operand 101241 states and 148120 transitions. Second operand has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 9 states have internal predecessors, (125), 0 states have call successors, (0), 0 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:46:10,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:10,830 INFO L93 Difference]: Finished difference Result 231689 states and 340256 transitions. [2025-02-05 16:46:10,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:46:10,830 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 9 states have internal predecessors, (125), 0 states have call successors, (0), 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 130 [2025-02-05 16:46:10,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:11,079 INFO L225 Difference]: With dead ends: 231689 [2025-02-05 16:46:11,079 INFO L226 Difference]: Without dead ends: 212167 [2025-02-05 16:46:11,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-02-05 16:46:11,114 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 1724 mSDsluCounter, 2289 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1724 SdHoareTripleChecker+Valid, 2588 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:11,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1724 Valid, 2588 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:46:11,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212167 states. [2025-02-05 16:46:12,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212167 to 120761. [2025-02-05 16:46:12,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120761 states, 120760 states have (on average 1.4629347466048361) internal successors, (176664), 120760 states have internal predecessors, (176664), 0 states have call successors, (0), 0 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:46:13,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120761 states to 120761 states and 176664 transitions. [2025-02-05 16:46:13,192 INFO L78 Accepts]: Start accepts. Automaton has 120761 states and 176664 transitions. Word has length 130 [2025-02-05 16:46:13,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:13,192 INFO L471 AbstractCegarLoop]: Abstraction has 120761 states and 176664 transitions. [2025-02-05 16:46:13,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 9 states have internal predecessors, (125), 0 states have call successors, (0), 0 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:46:13,192 INFO L276 IsEmpty]: Start isEmpty. Operand 120761 states and 176664 transitions. [2025-02-05 16:46:13,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 16:46:13,203 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:13,203 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:13,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:46:13,203 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:13,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:13,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1970983500, now seen corresponding path program 1 times [2025-02-05 16:46:13,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:13,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656422722] [2025-02-05 16:46:13,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:13,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:13,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 16:46:13,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 16:46:13,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:13,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:13,392 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:46:13,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:13,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656422722] [2025-02-05 16:46:13,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656422722] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:13,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:13,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:46:13,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524796904] [2025-02-05 16:46:13,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:13,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:13,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:13,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:13,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:13,394 INFO L87 Difference]: Start difference. First operand 120761 states and 176664 transitions. Second operand has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 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:46:14,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:14,413 INFO L93 Difference]: Finished difference Result 251209 states and 368800 transitions. [2025-02-05 16:46:14,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:46:14,414 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 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 130 [2025-02-05 16:46:14,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:14,689 INFO L225 Difference]: With dead ends: 251209 [2025-02-05 16:46:14,690 INFO L226 Difference]: Without dead ends: 231687 [2025-02-05 16:46:14,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-02-05 16:46:14,731 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 1807 mSDsluCounter, 2349 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1807 SdHoareTripleChecker+Valid, 2646 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:14,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1807 Valid, 2646 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:46:14,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231687 states. [2025-02-05 16:46:16,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231687 to 140281. [2025-02-05 16:46:16,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140281 states, 140280 states have (on average 1.462845737097234) internal successors, (205208), 140280 states have internal predecessors, (205208), 0 states have call successors, (0), 0 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:46:17,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140281 states to 140281 states and 205208 transitions. [2025-02-05 16:46:17,009 INFO L78 Accepts]: Start accepts. Automaton has 140281 states and 205208 transitions. Word has length 130 [2025-02-05 16:46:17,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:17,009 INFO L471 AbstractCegarLoop]: Abstraction has 140281 states and 205208 transitions. [2025-02-05 16:46:17,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 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:46:17,010 INFO L276 IsEmpty]: Start isEmpty. Operand 140281 states and 205208 transitions. [2025-02-05 16:46:17,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 16:46:17,021 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:17,021 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:17,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:46:17,022 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:17,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:17,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1763139244, now seen corresponding path program 1 times [2025-02-05 16:46:17,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:17,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447130641] [2025-02-05 16:46:17,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:17,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:17,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 16:46:17,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 16:46:17,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:17,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:17,203 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:46:17,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:17,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447130641] [2025-02-05 16:46:17,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447130641] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:17,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:17,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:46:17,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802702508] [2025-02-05 16:46:17,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:17,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:17,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:17,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:17,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:17,205 INFO L87 Difference]: Start difference. First operand 140281 states and 205208 transitions. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 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:46:18,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:18,428 INFO L93 Difference]: Finished difference Result 270729 states and 397344 transitions. [2025-02-05 16:46:18,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:46:18,428 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 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 130 [2025-02-05 16:46:18,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:18,683 INFO L225 Difference]: With dead ends: 270729 [2025-02-05 16:46:18,683 INFO L226 Difference]: Without dead ends: 251207 [2025-02-05 16:46:18,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-02-05 16:46:18,712 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 1599 mSDsluCounter, 2536 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1599 SdHoareTripleChecker+Valid, 2832 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:18,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1599 Valid, 2832 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:46:18,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251207 states. [2025-02-05 16:46:20,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251207 to 159801. [2025-02-05 16:46:20,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159801 states, 159800 states have (on average 1.4627784730913642) internal successors, (233752), 159800 states have internal predecessors, (233752), 0 states have call successors, (0), 0 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:46:21,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159801 states to 159801 states and 233752 transitions. [2025-02-05 16:46:21,137 INFO L78 Accepts]: Start accepts. Automaton has 159801 states and 233752 transitions. Word has length 130 [2025-02-05 16:46:21,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:21,137 INFO L471 AbstractCegarLoop]: Abstraction has 159801 states and 233752 transitions. [2025-02-05 16:46:21,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 0 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:46:21,137 INFO L276 IsEmpty]: Start isEmpty. Operand 159801 states and 233752 transitions. [2025-02-05 16:46:21,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 16:46:21,150 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:21,150 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:21,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:46:21,151 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:46:21,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:21,151 INFO L85 PathProgramCache]: Analyzing trace with hash 2012707114, now seen corresponding path program 1 times [2025-02-05 16:46:21,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:21,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907636334] [2025-02-05 16:46:21,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:21,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:21,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 16:46:21,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 16:46:21,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:21,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:21,662 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:46:21,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:21,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907636334] [2025-02-05 16:46:21,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907636334] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:46:21,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581883468] [2025-02-05 16:46:21,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:21,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:46:21,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:46:21,666 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:46:21,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:46:21,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 16:46:21,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 16:46:21,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:21,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:21,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-05 16:46:21,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:46:22,056 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:46:22,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:46:22,694 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:46:22,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581883468] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:46:22,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:46:22,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 4] total 19 [2025-02-05 16:46:22,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230751605] [2025-02-05 16:46:22,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:46:22,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 16:46:22,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:22,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 16:46:22,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:46:22,698 INFO L87 Difference]: Start difference. First operand 159801 states and 233752 transitions. Second operand has 19 states, 19 states have (on average 19.94736842105263) internal successors, (379), 19 states have internal predecessors, (379), 0 states have call successors, (0), 0 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:46:30,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:30,501 INFO L93 Difference]: Finished difference Result 1675991 states and 2438567 transitions. [2025-02-05 16:46:30,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2025-02-05 16:46:30,502 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 19.94736842105263) internal successors, (379), 19 states have internal predecessors, (379), 0 states have call successors, (0), 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 131 [2025-02-05 16:46:30,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:32,517 INFO L225 Difference]: With dead ends: 1675991 [2025-02-05 16:46:32,517 INFO L226 Difference]: Without dead ends: 1516245 [2025-02-05 16:46:33,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5955 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2451, Invalid=12311, Unknown=0, NotChecked=0, Total=14762 [2025-02-05 16:46:33,241 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 6924 mSDsluCounter, 2379 mSDsCounter, 0 mSdLazyCounter, 3010 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6924 SdHoareTripleChecker+Valid, 2704 SdHoareTripleChecker+Invalid, 3110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 3010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:33,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6924 Valid, 2704 Invalid, 3110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 3010 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 16:46:33,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516245 states.