./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+nlh-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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+nlh-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 54dd2c42579f0de559de8ea2b74ae8f2f84f80b7530dd7d24e9994fd7ce14291 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:33:48,815 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:33:48,898 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:33:48,906 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:33:48,908 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:33:48,926 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:33:48,927 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:33:48,927 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:33:48,928 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:33:48,928 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:33:48,928 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:33:48,928 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:33:48,928 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:33:48,928 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:33:48,928 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:33:48,928 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:33:48,928 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:33:48,929 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:33:48,929 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:33:48,929 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:33:48,929 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:33:48,929 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:33:48,929 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:33:48,929 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:33:48,929 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:33:48,929 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:33:48,929 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:33:48,929 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:33:48,930 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:33:48,930 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:33:48,930 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:33:48,930 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:33:48,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:33:48,930 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:33:48,930 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:33:48,930 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:33:48,930 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:33:48,930 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:33:48,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:33:48,931 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:33:48,931 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:33:48,931 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:33:48,931 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:33:48,931 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 -> 54dd2c42579f0de559de8ea2b74ae8f2f84f80b7530dd7d24e9994fd7ce14291 [2025-02-05 16:33:49,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:33:49,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:33:49,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:33:49,185 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:33:49,186 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:33:49,187 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2025-02-05 16:33:50,366 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c47601b18/3837cb603d4d4affaabf48a04d98d0ba/FLAG9f5146d9c [2025-02-05 16:33:50,710 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:33:50,712 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2025-02-05 16:33:50,727 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c47601b18/3837cb603d4d4affaabf48a04d98d0ba/FLAG9f5146d9c [2025-02-05 16:33:50,744 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c47601b18/3837cb603d4d4affaabf48a04d98d0ba [2025-02-05 16:33:50,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:33:50,749 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:33:50,750 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:33:50,751 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:33:50,755 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:33:50,755 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:33:50" (1/1) ... [2025-02-05 16:33:50,756 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ec176d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:33:50, skipping insertion in model container [2025-02-05 16:33:50,756 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:33:50" (1/1) ... [2025-02-05 16:33:50,790 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:33:50,960 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c[7253,7266] [2025-02-05 16:33:51,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:33:51,018 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:33:51,049 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-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c[7253,7266] [2025-02-05 16:33:51,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:33:51,081 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:33:51,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:33:51 WrapperNode [2025-02-05 16:33:51,082 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:33:51,083 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:33:51,083 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:33:51,084 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:33:51,089 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:33:51" (1/1) ... [2025-02-05 16:33:51,097 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:33:51" (1/1) ... [2025-02-05 16:33:51,120 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 738 [2025-02-05 16:33:51,121 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:33:51,122 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:33:51,122 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:33:51,122 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:33:51,128 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:33:51" (1/1) ... [2025-02-05 16:33:51,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:33:51" (1/1) ... [2025-02-05 16:33:51,131 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:33:51" (1/1) ... [2025-02-05 16:33:51,141 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:33:51,142 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:33:51" (1/1) ... [2025-02-05 16:33:51,142 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:33:51" (1/1) ... [2025-02-05 16:33:51,148 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:33:51" (1/1) ... [2025-02-05 16:33:51,148 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:33:51" (1/1) ... [2025-02-05 16:33:51,149 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:33:51" (1/1) ... [2025-02-05 16:33:51,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:33:51" (1/1) ... [2025-02-05 16:33:51,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:33:51,157 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:33:51,157 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:33:51,157 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:33:51,158 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:33:51" (1/1) ... [2025-02-05 16:33:51,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:33:51,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:33:51,186 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:33:51,192 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:33:51,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:33:51,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:33:51,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:33:51,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:33:51,281 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:33:51,282 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:33:51,735 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L185: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-02-05 16:33:51,735 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1078: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-02-05 16:33:51,735 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L749: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-05 16:33:51,735 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L518: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-02-05 16:33:51,736 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L387: havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;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;havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-02-05 16:33:51,736 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L206: havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-02-05 16:33:51,736 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L604: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-02-05 16:33:51,736 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L406: havoc main_~node2__m2~2#1; [2025-02-05 16:33:51,736 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1034: havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-02-05 16:33:51,736 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L490: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-02-05 16:33:51,736 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L424: havoc main_~node3__m3~2#1; [2025-02-05 16:33:51,736 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L227: havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-02-05 16:33:51,736 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L442: havoc main_~node4__m4~2#1; [2025-02-05 16:33:51,736 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L690: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-02-05 16:33:51,736 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L576: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-02-05 16:33:51,736 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L164: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-02-05 16:33:51,736 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1122: havoc main_~node1____CPAchecker_TMP_1~1#1; [2025-02-05 16:33:51,736 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L990: havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-02-05 16:33:51,736 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L777: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-02-05 16:33:51,736 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L662: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-02-05 16:33:51,772 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2025-02-05 16:33:51,772 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:33:51,791 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:33:51,791 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:33:51,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:33:51 BoogieIcfgContainer [2025-02-05 16:33:51,792 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:33:51,794 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:33:51,794 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:33:51,798 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:33:51,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:33:50" (1/3) ... [2025-02-05 16:33:51,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb2947 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:33:51, skipping insertion in model container [2025-02-05 16:33:51,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:33:51" (2/3) ... [2025-02-05 16:33:51,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb2947 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:33:51, skipping insertion in model container [2025-02-05 16:33:51,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:33:51" (3/3) ... [2025-02-05 16:33:51,801 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2025-02-05 16:33:51,811 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:33:51,812 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c that has 1 procedures, 180 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:33:51,863 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:33:51,871 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;@555a6458, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:33:51,872 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:33:51,876 INFO L276 IsEmpty]: Start isEmpty. Operand has 180 states, 178 states have (on average 1.7191011235955056) internal successors, (306), 179 states have internal predecessors, (306), 0 states have call successors, (0), 0 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:33:51,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:33:51,880 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:51,880 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:51,881 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:51,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:51,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1757487568, now seen corresponding path program 1 times [2025-02-05 16:33:51,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:51,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136135805] [2025-02-05 16:33:51,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:51,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:51,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:33:52,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:33:52,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:52,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:52,400 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:33:52,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:52,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136135805] [2025-02-05 16:33:52,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136135805] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:52,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:52,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:33:52,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735881938] [2025-02-05 16:33:52,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:52,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:33:52,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:52,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:33:52,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:33:52,424 INFO L87 Difference]: Start difference. First operand has 180 states, 178 states have (on average 1.7191011235955056) internal successors, (306), 179 states have internal predecessors, (306), 0 states have call successors, (0), 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 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:52,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:52,608 INFO L93 Difference]: Finished difference Result 640 states and 1036 transitions. [2025-02-05 16:33:52,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:33:52,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-02-05 16:33:52,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:52,619 INFO L225 Difference]: With dead ends: 640 [2025-02-05 16:33:52,619 INFO L226 Difference]: Without dead ends: 541 [2025-02-05 16:33:52,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:33:52,623 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 1465 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 1395 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:52,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1465 Valid, 1395 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:33:52,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-02-05 16:33:52,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 275. [2025-02-05 16:33:52,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 274 states have (on average 1.5036496350364963) internal successors, (412), 274 states have internal predecessors, (412), 0 states have call successors, (0), 0 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:33:52,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 412 transitions. [2025-02-05 16:33:52,660 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 412 transitions. Word has length 65 [2025-02-05 16:33:52,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:52,660 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 412 transitions. [2025-02-05 16:33:52,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:52,661 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 412 transitions. [2025-02-05 16:33:52,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:33:52,662 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:52,662 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:52,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:33:52,662 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:52,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:52,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1351499395, now seen corresponding path program 1 times [2025-02-05 16:33:52,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:52,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818223542] [2025-02-05 16:33:52,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:52,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:52,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:33:52,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:33:52,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:52,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:52,985 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:33:52,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:52,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818223542] [2025-02-05 16:33:52,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818223542] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:52,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:52,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:33:52,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502296982] [2025-02-05 16:33:52,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:52,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:33:52,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:52,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:33:52,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:33:52,990 INFO L87 Difference]: Start difference. First operand 275 states and 412 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:53,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:53,128 INFO L93 Difference]: Finished difference Result 1013 states and 1556 transitions. [2025-02-05 16:33:53,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:33:53,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-05 16:33:53,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:53,135 INFO L225 Difference]: With dead ends: 1013 [2025-02-05 16:33:53,135 INFO L226 Difference]: Without dead ends: 801 [2025-02-05 16:33:53,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:33:53,139 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 1687 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1687 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:53,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1687 Valid, 702 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:33:53,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2025-02-05 16:33:53,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 795. [2025-02-05 16:33:53,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 794 states have (on average 1.5251889168765742) internal successors, (1211), 794 states have internal predecessors, (1211), 0 states have call successors, (0), 0 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:33:53,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1211 transitions. [2025-02-05 16:33:53,172 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1211 transitions. Word has length 66 [2025-02-05 16:33:53,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:53,172 INFO L471 AbstractCegarLoop]: Abstraction has 795 states and 1211 transitions. [2025-02-05 16:33:53,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:53,172 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1211 transitions. [2025-02-05 16:33:53,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:33:53,174 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:53,174 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:53,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:33:53,175 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:53,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:53,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1014158194, now seen corresponding path program 1 times [2025-02-05 16:33:53,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:53,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511965623] [2025-02-05 16:33:53,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:53,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:53,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:33:53,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:33:53,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:53,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:53,304 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:33:53,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:53,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511965623] [2025-02-05 16:33:53,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511965623] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:53,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:53,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:33:53,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3373851] [2025-02-05 16:33:53,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:53,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:33:53,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:53,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:33:53,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:33:53,306 INFO L87 Difference]: Start difference. First operand 795 states and 1211 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:53,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:53,490 INFO L93 Difference]: Finished difference Result 2017 states and 3117 transitions. [2025-02-05 16:33:53,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:33:53,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-05 16:33:53,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:53,495 INFO L225 Difference]: With dead ends: 2017 [2025-02-05 16:33:53,495 INFO L226 Difference]: Without dead ends: 1323 [2025-02-05 16:33:53,496 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:33:53,497 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 930 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:53,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [930 Valid, 250 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:33:53,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2025-02-05 16:33:53,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1321. [2025-02-05 16:33:53,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1320 states have (on average 1.5340909090909092) internal successors, (2025), 1320 states have internal predecessors, (2025), 0 states have call successors, (0), 0 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:33:53,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 2025 transitions. [2025-02-05 16:33:53,520 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 2025 transitions. Word has length 67 [2025-02-05 16:33:53,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:53,520 INFO L471 AbstractCegarLoop]: Abstraction has 1321 states and 2025 transitions. [2025-02-05 16:33:53,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:53,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 2025 transitions. [2025-02-05 16:33:53,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:33:53,523 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:53,523 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:53,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:33:53,523 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:53,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:53,524 INFO L85 PathProgramCache]: Analyzing trace with hash -2042450118, now seen corresponding path program 1 times [2025-02-05 16:33:53,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:53,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206956392] [2025-02-05 16:33:53,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:53,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:53,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:33:53,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:33:53,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:53,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:53,661 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:33:53,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:53,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206956392] [2025-02-05 16:33:53,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206956392] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:53,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:53,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:33:53,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34037847] [2025-02-05 16:33:53,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:53,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:33:53,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:53,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:33:53,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:33:53,664 INFO L87 Difference]: Start difference. First operand 1321 states and 2025 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:53,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:53,869 INFO L93 Difference]: Finished difference Result 3648 states and 5640 transitions. [2025-02-05 16:33:53,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:33:53,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-05 16:33:53,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:53,878 INFO L225 Difference]: With dead ends: 3648 [2025-02-05 16:33:53,878 INFO L226 Difference]: Without dead ends: 2401 [2025-02-05 16:33:53,880 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:33:53,882 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 956 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 956 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:53,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [956 Valid, 248 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:33:53,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2025-02-05 16:33:53,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 2399. [2025-02-05 16:33:53,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2399 states, 2398 states have (on average 1.536697247706422) internal successors, (3685), 2398 states have internal predecessors, (3685), 0 states have call successors, (0), 0 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:33:53,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2399 states to 2399 states and 3685 transitions. [2025-02-05 16:33:53,930 INFO L78 Accepts]: Start accepts. Automaton has 2399 states and 3685 transitions. Word has length 67 [2025-02-05 16:33:53,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:53,930 INFO L471 AbstractCegarLoop]: Abstraction has 2399 states and 3685 transitions. [2025-02-05 16:33:53,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:53,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2399 states and 3685 transitions. [2025-02-05 16:33:53,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:33:53,932 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:53,933 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:53,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:33:53,933 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:53,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:53,933 INFO L85 PathProgramCache]: Analyzing trace with hash 400489446, now seen corresponding path program 1 times [2025-02-05 16:33:53,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:53,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703857129] [2025-02-05 16:33:53,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:53,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:53,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:33:53,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:33:53,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:53,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:54,043 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:33:54,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:54,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703857129] [2025-02-05 16:33:54,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703857129] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:54,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:54,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:33:54,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707969848] [2025-02-05 16:33:54,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:54,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:33:54,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:54,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:33:54,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:33:54,044 INFO L87 Difference]: Start difference. First operand 2399 states and 3685 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:54,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:54,260 INFO L93 Difference]: Finished difference Result 6925 states and 10693 transitions. [2025-02-05 16:33:54,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:33:54,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-05 16:33:54,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:54,274 INFO L225 Difference]: With dead ends: 6925 [2025-02-05 16:33:54,274 INFO L226 Difference]: Without dead ends: 4577 [2025-02-05 16:33:54,277 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:33:54,277 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 982 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:54,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [982 Valid, 246 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:33:54,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4577 states. [2025-02-05 16:33:54,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4577 to 4575. [2025-02-05 16:33:54,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4575 states, 4574 states have (on average 1.5343244425010931) internal successors, (7018), 4574 states have internal predecessors, (7018), 0 states have call successors, (0), 0 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:33:54,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4575 states to 4575 states and 7018 transitions. [2025-02-05 16:33:54,347 INFO L78 Accepts]: Start accepts. Automaton has 4575 states and 7018 transitions. Word has length 67 [2025-02-05 16:33:54,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:54,347 INFO L471 AbstractCegarLoop]: Abstraction has 4575 states and 7018 transitions. [2025-02-05 16:33:54,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:54,347 INFO L276 IsEmpty]: Start isEmpty. Operand 4575 states and 7018 transitions. [2025-02-05 16:33:54,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:33:54,348 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:54,348 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:54,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:33:54,349 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:54,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:54,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1276308846, now seen corresponding path program 1 times [2025-02-05 16:33:54,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:54,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144987611] [2025-02-05 16:33:54,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:54,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:54,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:33:54,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:33:54,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:54,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:54,498 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:33:54,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:54,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144987611] [2025-02-05 16:33:54,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144987611] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:54,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:54,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:33:54,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691955458] [2025-02-05 16:33:54,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:54,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:33:54,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:54,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:33:54,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:33:54,499 INFO L87 Difference]: Start difference. First operand 4575 states and 7018 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:54,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:54,861 INFO L93 Difference]: Finished difference Result 13473 states and 20725 transitions. [2025-02-05 16:33:54,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:33:54,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-05 16:33:54,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:54,916 INFO L225 Difference]: With dead ends: 13473 [2025-02-05 16:33:54,916 INFO L226 Difference]: Without dead ends: 8933 [2025-02-05 16:33:54,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:33:54,931 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 1010 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:54,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 242 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:33:54,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8933 states. [2025-02-05 16:33:55,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8933 to 8931. [2025-02-05 16:33:55,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8931 states, 8930 states have (on average 1.5264277715565508) internal successors, (13631), 8930 states have internal predecessors, (13631), 0 states have call successors, (0), 0 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:33:55,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8931 states to 8931 states and 13631 transitions. [2025-02-05 16:33:55,328 INFO L78 Accepts]: Start accepts. Automaton has 8931 states and 13631 transitions. Word has length 67 [2025-02-05 16:33:55,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:55,328 INFO L471 AbstractCegarLoop]: Abstraction has 8931 states and 13631 transitions. [2025-02-05 16:33:55,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:55,328 INFO L276 IsEmpty]: Start isEmpty. Operand 8931 states and 13631 transitions. [2025-02-05 16:33:55,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:33:55,334 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:55,334 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:55,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:33:55,334 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:55,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:55,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1882816673, now seen corresponding path program 1 times [2025-02-05 16:33:55,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:55,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398735649] [2025-02-05 16:33:55,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:55,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:55,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:33:55,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:33:55,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:55,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:55,621 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:33:55,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:55,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398735649] [2025-02-05 16:33:55,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398735649] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:55,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:55,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:33:55,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938733240] [2025-02-05 16:33:55,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:55,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:33:55,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:55,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:33:55,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:33:55,623 INFO L87 Difference]: Start difference. First operand 8931 states and 13631 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:55,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:55,664 INFO L93 Difference]: Finished difference Result 9189 states and 14016 transitions. [2025-02-05 16:33:55,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:33:55,665 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-02-05 16:33:55,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:55,694 INFO L225 Difference]: With dead ends: 9189 [2025-02-05 16:33:55,694 INFO L226 Difference]: Without dead ends: 9187 [2025-02-05 16:33:55,697 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:33:55,697 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 0 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:55,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 966 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:33:55,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9187 states. [2025-02-05 16:33:55,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9187 to 9187. [2025-02-05 16:33:55,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9187 states, 9186 states have (on average 1.5117570215545395) internal successors, (13887), 9186 states have internal predecessors, (13887), 0 states have call successors, (0), 0 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:33:55,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9187 states to 9187 states and 13887 transitions. [2025-02-05 16:33:55,836 INFO L78 Accepts]: Start accepts. Automaton has 9187 states and 13887 transitions. Word has length 68 [2025-02-05 16:33:55,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:55,836 INFO L471 AbstractCegarLoop]: Abstraction has 9187 states and 13887 transitions. [2025-02-05 16:33:55,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:55,837 INFO L276 IsEmpty]: Start isEmpty. Operand 9187 states and 13887 transitions. [2025-02-05 16:33:55,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:33:55,838 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:55,838 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:55,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:33:55,839 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:55,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:55,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1766999374, now seen corresponding path program 1 times [2025-02-05 16:33:55,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:55,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711527596] [2025-02-05 16:33:55,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:55,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:55,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:33:55,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:33:55,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:55,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:56,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:33:56,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:56,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711527596] [2025-02-05 16:33:56,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711527596] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:56,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:56,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:33:56,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462382567] [2025-02-05 16:33:56,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:56,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:33:56,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:56,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:33:56,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:33:56,013 INFO L87 Difference]: Start difference. First operand 9187 states and 13887 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:56,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:56,064 INFO L93 Difference]: Finished difference Result 25031 states and 37773 transitions. [2025-02-05 16:33:56,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:33:56,064 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-02-05 16:33:56,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:56,094 INFO L225 Difference]: With dead ends: 25031 [2025-02-05 16:33:56,094 INFO L226 Difference]: Without dead ends: 16453 [2025-02-05 16:33:56,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:33:56,106 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 201 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:56,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 610 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:33:56,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16453 states. [2025-02-05 16:33:56,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16453 to 16451. [2025-02-05 16:33:56,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16451 states, 16450 states have (on average 1.497082066869301) internal successors, (24627), 16450 states have internal predecessors, (24627), 0 states have call successors, (0), 0 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:33:56,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16451 states to 16451 states and 24627 transitions. [2025-02-05 16:33:56,377 INFO L78 Accepts]: Start accepts. Automaton has 16451 states and 24627 transitions. Word has length 69 [2025-02-05 16:33:56,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:56,377 INFO L471 AbstractCegarLoop]: Abstraction has 16451 states and 24627 transitions. [2025-02-05 16:33:56,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:56,378 INFO L276 IsEmpty]: Start isEmpty. Operand 16451 states and 24627 transitions. [2025-02-05 16:33:56,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:33:56,381 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:56,381 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:56,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:33:56,382 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:56,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:56,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1733795456, now seen corresponding path program 1 times [2025-02-05 16:33:56,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:56,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608491475] [2025-02-05 16:33:56,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:56,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:56,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:33:56,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:33:56,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:56,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:56,438 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:33:56,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:56,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608491475] [2025-02-05 16:33:56,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608491475] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:56,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:56,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:33:56,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200664528] [2025-02-05 16:33:56,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:56,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:33:56,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:56,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:33:56,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:33:56,440 INFO L87 Difference]: Start difference. First operand 16451 states and 24627 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:56,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:56,505 INFO L93 Difference]: Finished difference Result 34060 states and 50935 transitions. [2025-02-05 16:33:56,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:33:56,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-02-05 16:33:56,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:56,539 INFO L225 Difference]: With dead ends: 34060 [2025-02-05 16:33:56,539 INFO L226 Difference]: Without dead ends: 21080 [2025-02-05 16:33:56,617 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:33:56,621 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 164 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:56,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 467 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:33:56,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21080 states. [2025-02-05 16:33:56,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21080 to 20873. [2025-02-05 16:33:56,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20873 states, 20872 states have (on average 1.4734572633192795) internal successors, (30754), 20872 states have internal predecessors, (30754), 0 states have call successors, (0), 0 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:33:56,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20873 states to 20873 states and 30754 transitions. [2025-02-05 16:33:56,939 INFO L78 Accepts]: Start accepts. Automaton has 20873 states and 30754 transitions. Word has length 70 [2025-02-05 16:33:56,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:56,939 INFO L471 AbstractCegarLoop]: Abstraction has 20873 states and 30754 transitions. [2025-02-05 16:33:56,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:56,940 INFO L276 IsEmpty]: Start isEmpty. Operand 20873 states and 30754 transitions. [2025-02-05 16:33:56,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:33:56,942 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:56,942 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:56,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:33:56,942 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:56,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:56,942 INFO L85 PathProgramCache]: Analyzing trace with hash 903569409, now seen corresponding path program 1 times [2025-02-05 16:33:56,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:56,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605034939] [2025-02-05 16:33:56,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:56,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:56,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:33:56,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:33:56,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:56,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:56,989 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:33:56,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:56,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605034939] [2025-02-05 16:33:56,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605034939] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:56,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:56,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:33:56,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798938265] [2025-02-05 16:33:56,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:56,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:33:56,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:56,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:33:56,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:33:56,990 INFO L87 Difference]: Start difference. First operand 20873 states and 30754 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:57,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:57,067 INFO L93 Difference]: Finished difference Result 36328 states and 53336 transitions. [2025-02-05 16:33:57,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:33:57,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-02-05 16:33:57,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:57,110 INFO L225 Difference]: With dead ends: 36328 [2025-02-05 16:33:57,110 INFO L226 Difference]: Without dead ends: 23938 [2025-02-05 16:33:57,126 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:33:57,126 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 152 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:57,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 484 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:33:57,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23938 states. [2025-02-05 16:33:57,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23938 to 23685. [2025-02-05 16:33:57,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23685 states, 23684 states have (on average 1.4434639419017057) internal successors, (34187), 23684 states have internal predecessors, (34187), 0 states have call successors, (0), 0 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:33:57,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23685 states to 23685 states and 34187 transitions. [2025-02-05 16:33:57,494 INFO L78 Accepts]: Start accepts. Automaton has 23685 states and 34187 transitions. Word has length 70 [2025-02-05 16:33:57,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:57,494 INFO L471 AbstractCegarLoop]: Abstraction has 23685 states and 34187 transitions. [2025-02-05 16:33:57,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:57,495 INFO L276 IsEmpty]: Start isEmpty. Operand 23685 states and 34187 transitions. [2025-02-05 16:33:57,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:33:57,497 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:57,498 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:57,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:33:57,498 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:57,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:57,499 INFO L85 PathProgramCache]: Analyzing trace with hash 574085408, now seen corresponding path program 1 times [2025-02-05 16:33:57,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:57,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194060058] [2025-02-05 16:33:57,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:57,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:57,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:33:57,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:33:57,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:57,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:57,633 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:33:57,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:57,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194060058] [2025-02-05 16:33:57,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194060058] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:57,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:57,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:33:57,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125326408] [2025-02-05 16:33:57,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:57,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:33:57,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:57,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:33:57,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:33:57,636 INFO L87 Difference]: Start difference. First operand 23685 states and 34187 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:57,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:57,926 INFO L93 Difference]: Finished difference Result 44850 states and 64940 transitions. [2025-02-05 16:33:57,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:33:57,926 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-02-05 16:33:57,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:57,977 INFO L225 Difference]: With dead ends: 44850 [2025-02-05 16:33:57,977 INFO L226 Difference]: Without dead ends: 40456 [2025-02-05 16:33:57,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:33:57,993 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 1146 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1146 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:57,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1146 Valid, 1290 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:33:58,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40456 states. [2025-02-05 16:33:58,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40456 to 28019. [2025-02-05 16:33:58,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28019 states, 28018 states have (on average 1.4408237561567563) internal successors, (40369), 28018 states have internal predecessors, (40369), 0 states have call successors, (0), 0 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:33:58,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28019 states to 28019 states and 40369 transitions. [2025-02-05 16:33:58,443 INFO L78 Accepts]: Start accepts. Automaton has 28019 states and 40369 transitions. Word has length 70 [2025-02-05 16:33:58,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:58,443 INFO L471 AbstractCegarLoop]: Abstraction has 28019 states and 40369 transitions. [2025-02-05 16:33:58,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:58,444 INFO L276 IsEmpty]: Start isEmpty. Operand 28019 states and 40369 transitions. [2025-02-05 16:33:58,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:33:58,447 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:58,447 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:58,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:33:58,447 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:58,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:58,448 INFO L85 PathProgramCache]: Analyzing trace with hash 661224353, now seen corresponding path program 1 times [2025-02-05 16:33:58,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:58,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505707098] [2025-02-05 16:33:58,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:58,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:58,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:33:58,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:33:58,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:58,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:58,504 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:33:58,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:58,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505707098] [2025-02-05 16:33:58,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505707098] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:58,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:58,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:33:58,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960096870] [2025-02-05 16:33:58,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:58,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:33:58,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:58,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:33:58,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:33:58,506 INFO L87 Difference]: Start difference. First operand 28019 states and 40369 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:58,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:58,736 INFO L93 Difference]: Finished difference Result 70611 states and 101623 transitions. [2025-02-05 16:33:58,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:33:58,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-02-05 16:33:58,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:58,787 INFO L225 Difference]: With dead ends: 70611 [2025-02-05 16:33:58,787 INFO L226 Difference]: Without dead ends: 45926 [2025-02-05 16:33:58,811 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:33:58,811 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 173 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:58,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 465 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:33:58,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45926 states. [2025-02-05 16:33:59,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45926 to 45818. [2025-02-05 16:33:59,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45818 states, 45817 states have (on average 1.4235545758124712) internal successors, (65223), 45817 states have internal predecessors, (65223), 0 states have call successors, (0), 0 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:33:59,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45818 states to 45818 states and 65223 transitions. [2025-02-05 16:33:59,314 INFO L78 Accepts]: Start accepts. Automaton has 45818 states and 65223 transitions. Word has length 70 [2025-02-05 16:33:59,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:33:59,314 INFO L471 AbstractCegarLoop]: Abstraction has 45818 states and 65223 transitions. [2025-02-05 16:33:59,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:59,314 INFO L276 IsEmpty]: Start isEmpty. Operand 45818 states and 65223 transitions. [2025-02-05 16:33:59,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:33:59,319 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:33:59,319 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:33:59,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:33:59,319 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:33:59,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:33:59,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1568873343, now seen corresponding path program 1 times [2025-02-05 16:33:59,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:33:59,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967057189] [2025-02-05 16:33:59,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:33:59,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:33:59,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:33:59,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:33:59,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:33:59,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:33:59,532 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:33:59,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:33:59,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967057189] [2025-02-05 16:33:59,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967057189] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:33:59,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:33:59,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:33:59,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934744006] [2025-02-05 16:33:59,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:33:59,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:33:59,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:33:59,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:33:59,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:33:59,534 INFO L87 Difference]: Start difference. First operand 45818 states and 65223 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:33:59,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:33:59,739 INFO L93 Difference]: Finished difference Result 87059 states and 124582 transitions. [2025-02-05 16:33:59,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:33:59,740 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-02-05 16:33:59,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:33:59,823 INFO L225 Difference]: With dead ends: 87059 [2025-02-05 16:33:59,823 INFO L226 Difference]: Without dead ends: 76329 [2025-02-05 16:33:59,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:33:59,853 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 1042 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:33:59,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1042 Valid, 1187 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:33:59,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76329 states. [2025-02-05 16:34:00,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76329 to 56438. [2025-02-05 16:34:00,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56438 states, 56437 states have (on average 1.4229140457501284) internal successors, (80305), 56437 states have internal predecessors, (80305), 0 states have call successors, (0), 0 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:34:00,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56438 states to 56438 states and 80305 transitions. [2025-02-05 16:34:00,853 INFO L78 Accepts]: Start accepts. Automaton has 56438 states and 80305 transitions. Word has length 70 [2025-02-05 16:34:00,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:00,854 INFO L471 AbstractCegarLoop]: Abstraction has 56438 states and 80305 transitions. [2025-02-05 16:34:00,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:00,854 INFO L276 IsEmpty]: Start isEmpty. Operand 56438 states and 80305 transitions. [2025-02-05 16:34:00,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:34:00,859 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:00,859 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:00,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:34:00,859 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:00,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:00,860 INFO L85 PathProgramCache]: Analyzing trace with hash -2070599040, now seen corresponding path program 1 times [2025-02-05 16:34:00,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:00,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290745498] [2025-02-05 16:34:00,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:00,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:00,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:34:00,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:34:00,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:00,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:00,969 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:34:00,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:00,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290745498] [2025-02-05 16:34:00,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290745498] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:00,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:00,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:34:00,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112967769] [2025-02-05 16:34:00,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:00,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:34:00,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:00,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:34:00,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:34:00,971 INFO L87 Difference]: Start difference. First operand 56438 states and 80305 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:01,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:01,338 INFO L93 Difference]: Finished difference Result 102299 states and 146378 transitions. [2025-02-05 16:34:01,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:34:01,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-02-05 16:34:01,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:01,455 INFO L225 Difference]: With dead ends: 102299 [2025-02-05 16:34:01,456 INFO L226 Difference]: Without dead ends: 86829 [2025-02-05 16:34:01,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:34:01,493 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 1112 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:01,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 1297 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:01,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86829 states. [2025-02-05 16:34:02,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86829 to 67146. [2025-02-05 16:34:02,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67146 states, 67145 states have (on average 1.4248119740859335) internal successors, (95669), 67145 states have internal predecessors, (95669), 0 states have call successors, (0), 0 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:34:02,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67146 states to 67146 states and 95669 transitions. [2025-02-05 16:34:02,577 INFO L78 Accepts]: Start accepts. Automaton has 67146 states and 95669 transitions. Word has length 70 [2025-02-05 16:34:02,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:02,578 INFO L471 AbstractCegarLoop]: Abstraction has 67146 states and 95669 transitions. [2025-02-05 16:34:02,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:02,578 INFO L276 IsEmpty]: Start isEmpty. Operand 67146 states and 95669 transitions. [2025-02-05 16:34:02,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:34:02,590 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:02,590 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:02,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:34:02,591 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:02,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:02,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1167374047, now seen corresponding path program 1 times [2025-02-05 16:34:02,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:02,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257238926] [2025-02-05 16:34:02,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:02,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:02,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:34:02,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:34:02,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:02,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:02,736 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:34:02,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:02,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257238926] [2025-02-05 16:34:02,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257238926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:02,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:02,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:34:02,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801288319] [2025-02-05 16:34:02,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:02,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:34:02,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:02,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:34:02,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:34:02,737 INFO L87 Difference]: Start difference. First operand 67146 states and 95669 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:03,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:03,105 INFO L93 Difference]: Finished difference Result 112732 states and 161242 transitions. [2025-02-05 16:34:03,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:34:03,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-02-05 16:34:03,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:03,238 INFO L225 Difference]: With dead ends: 112732 [2025-02-05 16:34:03,238 INFO L226 Difference]: Without dead ends: 98514 [2025-02-05 16:34:03,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:34:03,277 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 1121 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:03,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1121 Valid, 1098 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:34:03,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98514 states. [2025-02-05 16:34:04,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98514 to 74401. [2025-02-05 16:34:04,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74401 states, 74400 states have (on average 1.4260618279569892) internal successors, (106099), 74400 states have internal predecessors, (106099), 0 states have call successors, (0), 0 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:34:04,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74401 states to 74401 states and 106099 transitions. [2025-02-05 16:34:04,434 INFO L78 Accepts]: Start accepts. Automaton has 74401 states and 106099 transitions. Word has length 70 [2025-02-05 16:34:04,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:04,434 INFO L471 AbstractCegarLoop]: Abstraction has 74401 states and 106099 transitions. [2025-02-05 16:34:04,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:04,435 INFO L276 IsEmpty]: Start isEmpty. Operand 74401 states and 106099 transitions. [2025-02-05 16:34:04,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-05 16:34:04,440 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:04,440 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:04,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:34:04,440 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:04,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:04,441 INFO L85 PathProgramCache]: Analyzing trace with hash -2063564947, now seen corresponding path program 1 times [2025-02-05 16:34:04,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:04,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139190693] [2025-02-05 16:34:04,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:04,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:04,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 16:34:04,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 16:34:04,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:04,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:04,495 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:34:04,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:04,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139190693] [2025-02-05 16:34:04,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139190693] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:04,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:04,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:04,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931053858] [2025-02-05 16:34:04,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:04,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:04,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:04,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:04,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:04,497 INFO L87 Difference]: Start difference. First operand 74401 states and 106099 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:04,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:04,944 INFO L93 Difference]: Finished difference Result 111632 states and 158178 transitions. [2025-02-05 16:34:04,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:04,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-02-05 16:34:04,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:05,034 INFO L225 Difference]: With dead ends: 111632 [2025-02-05 16:34:05,035 INFO L226 Difference]: Without dead ends: 71025 [2025-02-05 16:34:05,074 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:34:05,074 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 139 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:05,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 556 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:05,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71025 states. [2025-02-05 16:34:05,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71025 to 62536. [2025-02-05 16:34:05,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62536 states, 62535 states have (on average 1.3985927880386984) internal successors, (87461), 62535 states have internal predecessors, (87461), 0 states have call successors, (0), 0 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:34:05,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62536 states to 62536 states and 87461 transitions. [2025-02-05 16:34:05,932 INFO L78 Accepts]: Start accepts. Automaton has 62536 states and 87461 transitions. Word has length 73 [2025-02-05 16:34:05,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:05,936 INFO L471 AbstractCegarLoop]: Abstraction has 62536 states and 87461 transitions. [2025-02-05 16:34:05,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:05,937 INFO L276 IsEmpty]: Start isEmpty. Operand 62536 states and 87461 transitions. [2025-02-05 16:34:05,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 16:34:05,945 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:05,945 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:05,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:34:05,945 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:05,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:05,947 INFO L85 PathProgramCache]: Analyzing trace with hash 993648459, now seen corresponding path program 1 times [2025-02-05 16:34:05,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:05,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601785786] [2025-02-05 16:34:05,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:05,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:05,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 16:34:05,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 16:34:05,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:05,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:06,051 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:34:06,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:06,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601785786] [2025-02-05 16:34:06,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601785786] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:06,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:06,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:34:06,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425170541] [2025-02-05 16:34:06,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:06,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:34:06,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:06,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:34:06,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:34:06,052 INFO L87 Difference]: Start difference. First operand 62536 states and 87461 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:07,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:07,180 INFO L93 Difference]: Finished difference Result 186124 states and 257594 transitions. [2025-02-05 16:34:07,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:34:07,181 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-02-05 16:34:07,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:07,403 INFO L225 Difference]: With dead ends: 186124 [2025-02-05 16:34:07,404 INFO L226 Difference]: Without dead ends: 163366 [2025-02-05 16:34:07,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:34:07,438 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 1621 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1621 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:07,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1621 Valid, 454 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:34:07,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163366 states. [2025-02-05 16:34:08,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163366 to 62764. [2025-02-05 16:34:08,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62764 states, 62763 states have (on average 1.3981963895925944) internal successors, (87755), 62763 states have internal predecessors, (87755), 0 states have call successors, (0), 0 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:34:08,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62764 states to 62764 states and 87755 transitions. [2025-02-05 16:34:08,797 INFO L78 Accepts]: Start accepts. Automaton has 62764 states and 87755 transitions. Word has length 75 [2025-02-05 16:34:08,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:08,797 INFO L471 AbstractCegarLoop]: Abstraction has 62764 states and 87755 transitions. [2025-02-05 16:34:08,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:08,797 INFO L276 IsEmpty]: Start isEmpty. Operand 62764 states and 87755 transitions. [2025-02-05 16:34:08,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 16:34:08,807 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:08,807 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:08,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:34:08,807 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:08,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:08,807 INFO L85 PathProgramCache]: Analyzing trace with hash 92701932, now seen corresponding path program 1 times [2025-02-05 16:34:08,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:08,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156613301] [2025-02-05 16:34:08,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:08,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:08,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 16:34:08,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 16:34:08,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:08,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:08,911 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:34:08,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:08,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156613301] [2025-02-05 16:34:08,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156613301] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:08,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:08,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:34:08,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800375765] [2025-02-05 16:34:08,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:08,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:34:08,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:08,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:34:08,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:34:08,913 INFO L87 Difference]: Start difference. First operand 62764 states and 87755 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:10,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:10,072 INFO L93 Difference]: Finished difference Result 189049 states and 262786 transitions. [2025-02-05 16:34:10,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:34:10,072 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-02-05 16:34:10,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:10,283 INFO L225 Difference]: With dead ends: 189049 [2025-02-05 16:34:10,284 INFO L226 Difference]: Without dead ends: 166234 [2025-02-05 16:34:10,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:34:10,312 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 1774 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1774 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:10,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1774 Valid, 468 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:34:10,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166234 states. [2025-02-05 16:34:11,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166234 to 62880. [2025-02-05 16:34:11,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62880 states, 62879 states have (on average 1.3978911878369567) internal successors, (87898), 62879 states have internal predecessors, (87898), 0 states have call successors, (0), 0 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:34:11,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62880 states to 62880 states and 87898 transitions. [2025-02-05 16:34:11,938 INFO L78 Accepts]: Start accepts. Automaton has 62880 states and 87898 transitions. Word has length 75 [2025-02-05 16:34:11,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:11,938 INFO L471 AbstractCegarLoop]: Abstraction has 62880 states and 87898 transitions. [2025-02-05 16:34:11,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:11,938 INFO L276 IsEmpty]: Start isEmpty. Operand 62880 states and 87898 transitions. [2025-02-05 16:34:11,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 16:34:11,944 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:11,944 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:11,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:34:11,945 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:11,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:11,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1428162901, now seen corresponding path program 1 times [2025-02-05 16:34:11,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:11,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949987731] [2025-02-05 16:34:11,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:11,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:11,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 16:34:11,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 16:34:11,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:11,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:12,031 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:34:12,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:12,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949987731] [2025-02-05 16:34:12,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949987731] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:12,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:12,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:34:12,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002606649] [2025-02-05 16:34:12,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:12,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:34:12,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:12,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:34:12,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:34:12,033 INFO L87 Difference]: Start difference. First operand 62880 states and 87898 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:12,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:12,627 INFO L93 Difference]: Finished difference Result 149143 states and 205675 transitions. [2025-02-05 16:34:12,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:34:12,628 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-02-05 16:34:12,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:12,814 INFO L225 Difference]: With dead ends: 149143 [2025-02-05 16:34:12,814 INFO L226 Difference]: Without dead ends: 137237 [2025-02-05 16:34:12,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:34:12,864 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 1443 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1443 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:12,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1443 Valid, 445 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:34:12,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137237 states. [2025-02-05 16:34:13,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137237 to 63336. [2025-02-05 16:34:13,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63336 states, 63335 states have (on average 1.3966685087234547) internal successors, (88458), 63335 states have internal predecessors, (88458), 0 states have call successors, (0), 0 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:34:14,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63336 states to 63336 states and 88458 transitions. [2025-02-05 16:34:14,185 INFO L78 Accepts]: Start accepts. Automaton has 63336 states and 88458 transitions. Word has length 75 [2025-02-05 16:34:14,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:14,186 INFO L471 AbstractCegarLoop]: Abstraction has 63336 states and 88458 transitions. [2025-02-05 16:34:14,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:14,186 INFO L276 IsEmpty]: Start isEmpty. Operand 63336 states and 88458 transitions. [2025-02-05 16:34:14,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 16:34:14,192 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:14,192 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:14,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:34:14,193 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:14,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:14,193 INFO L85 PathProgramCache]: Analyzing trace with hash -113043957, now seen corresponding path program 1 times [2025-02-05 16:34:14,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:14,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7927562] [2025-02-05 16:34:14,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:14,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:14,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 16:34:14,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 16:34:14,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:14,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:14,304 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:34:14,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:14,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7927562] [2025-02-05 16:34:14,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7927562] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:14,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:14,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:34:14,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204502217] [2025-02-05 16:34:14,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:14,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:34:14,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:14,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:34:14,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:34:14,306 INFO L87 Difference]: Start difference. First operand 63336 states and 88458 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:15,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:15,034 INFO L93 Difference]: Finished difference Result 154513 states and 213527 transitions. [2025-02-05 16:34:15,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:34:15,034 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-02-05 16:34:15,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:15,202 INFO L225 Difference]: With dead ends: 154513 [2025-02-05 16:34:15,202 INFO L226 Difference]: Without dead ends: 120476 [2025-02-05 16:34:15,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:34:15,259 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 1233 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1233 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:15,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1233 Valid, 401 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:34:15,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120476 states. [2025-02-05 16:34:16,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120476 to 63386. [2025-02-05 16:34:16,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63386 states, 63385 states have (on average 1.3965133706712944) internal successors, (88518), 63385 states have internal predecessors, (88518), 0 states have call successors, (0), 0 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:34:16,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63386 states to 63386 states and 88518 transitions. [2025-02-05 16:34:16,594 INFO L78 Accepts]: Start accepts. Automaton has 63386 states and 88518 transitions. Word has length 75 [2025-02-05 16:34:16,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:16,594 INFO L471 AbstractCegarLoop]: Abstraction has 63386 states and 88518 transitions. [2025-02-05 16:34:16,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:16,594 INFO L276 IsEmpty]: Start isEmpty. Operand 63386 states and 88518 transitions. [2025-02-05 16:34:16,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:34:16,604 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:16,604 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:16,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:34:16,605 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:16,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:16,605 INFO L85 PathProgramCache]: Analyzing trace with hash 965654185, now seen corresponding path program 1 times [2025-02-05 16:34:16,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:16,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510065484] [2025-02-05 16:34:16,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:16,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:16,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:34:16,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:34:16,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:16,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:17,095 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:34:17,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:17,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510065484] [2025-02-05 16:34:17,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510065484] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:17,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:17,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:34:17,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715116306] [2025-02-05 16:34:17,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:17,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:34:17,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:17,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:34:17,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:34:17,096 INFO L87 Difference]: Start difference. First operand 63386 states and 88518 transitions. Second operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:17,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:17,915 INFO L93 Difference]: Finished difference Result 108703 states and 151106 transitions. [2025-02-05 16:34:17,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:34:17,915 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-02-05 16:34:17,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:18,024 INFO L225 Difference]: With dead ends: 108703 [2025-02-05 16:34:18,024 INFO L226 Difference]: Without dead ends: 93116 [2025-02-05 16:34:18,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2025-02-05 16:34:18,061 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 1350 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1350 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:18,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1350 Valid, 744 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:34:18,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93116 states. [2025-02-05 16:34:18,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93116 to 63093. [2025-02-05 16:34:18,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63093 states, 63092 states have (on average 1.3964052494769543) internal successors, (88102), 63092 states have internal predecessors, (88102), 0 states have call successors, (0), 0 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:34:18,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63093 states to 63093 states and 88102 transitions. [2025-02-05 16:34:18,974 INFO L78 Accepts]: Start accepts. Automaton has 63093 states and 88102 transitions. Word has length 77 [2025-02-05 16:34:18,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:18,975 INFO L471 AbstractCegarLoop]: Abstraction has 63093 states and 88102 transitions. [2025-02-05 16:34:18,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:18,975 INFO L276 IsEmpty]: Start isEmpty. Operand 63093 states and 88102 transitions. [2025-02-05 16:34:18,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:34:18,984 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:18,984 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:18,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:34:18,984 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:18,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:18,984 INFO L85 PathProgramCache]: Analyzing trace with hash -563846519, now seen corresponding path program 1 times [2025-02-05 16:34:18,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:18,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711704361] [2025-02-05 16:34:18,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:18,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:18,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:34:19,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:34:19,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:19,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:19,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:34:19,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:19,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711704361] [2025-02-05 16:34:19,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711704361] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:19,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:19,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:34:19,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647329467] [2025-02-05 16:34:19,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:19,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:34:19,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:19,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:34:19,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:34:19,182 INFO L87 Difference]: Start difference. First operand 63093 states and 88102 transitions. Second operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:20,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:20,094 INFO L93 Difference]: Finished difference Result 151389 states and 210597 transitions. [2025-02-05 16:34:20,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:34:20,095 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-02-05 16:34:20,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:20,215 INFO L225 Difference]: With dead ends: 151389 [2025-02-05 16:34:20,215 INFO L226 Difference]: Without dead ends: 90083 [2025-02-05 16:34:20,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:34:20,262 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 1015 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:20,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 898 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:34:20,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90083 states. [2025-02-05 16:34:21,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90083 to 62789. [2025-02-05 16:34:21,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62789 states, 62788 states have (on average 1.3961107217939734) internal successors, (87659), 62788 states have internal predecessors, (87659), 0 states have call successors, (0), 0 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:34:21,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62789 states to 62789 states and 87659 transitions. [2025-02-05 16:34:21,320 INFO L78 Accepts]: Start accepts. Automaton has 62789 states and 87659 transitions. Word has length 77 [2025-02-05 16:34:21,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:21,321 INFO L471 AbstractCegarLoop]: Abstraction has 62789 states and 87659 transitions. [2025-02-05 16:34:21,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:21,321 INFO L276 IsEmpty]: Start isEmpty. Operand 62789 states and 87659 transitions. [2025-02-05 16:34:21,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:34:21,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:21,330 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:21,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:34:21,331 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:21,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:21,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1872726423, now seen corresponding path program 1 times [2025-02-05 16:34:21,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:21,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363939847] [2025-02-05 16:34:21,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:21,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:21,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:34:21,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:34:21,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:21,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:21,765 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:34:21,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:21,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363939847] [2025-02-05 16:34:21,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363939847] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:21,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:21,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:34:21,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255299645] [2025-02-05 16:34:21,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:21,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:34:21,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:21,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:34:21,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:34:21,767 INFO L87 Difference]: Start difference. First operand 62789 states and 87659 transitions. Second operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:22,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:22,675 INFO L93 Difference]: Finished difference Result 158840 states and 221430 transitions. [2025-02-05 16:34:22,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:34:22,676 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-02-05 16:34:22,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:23,094 INFO L225 Difference]: With dead ends: 158840 [2025-02-05 16:34:23,094 INFO L226 Difference]: Without dead ends: 103406 [2025-02-05 16:34:23,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:34:23,123 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 650 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:23,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 870 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:34:23,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103406 states. [2025-02-05 16:34:24,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103406 to 62650. [2025-02-05 16:34:24,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62650 states, 62649 states have (on average 1.3954891538572045) internal successors, (87426), 62649 states have internal predecessors, (87426), 0 states have call successors, (0), 0 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:34:24,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62650 states to 62650 states and 87426 transitions. [2025-02-05 16:34:24,177 INFO L78 Accepts]: Start accepts. Automaton has 62650 states and 87426 transitions. Word has length 77 [2025-02-05 16:34:24,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:24,177 INFO L471 AbstractCegarLoop]: Abstraction has 62650 states and 87426 transitions. [2025-02-05 16:34:24,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:24,177 INFO L276 IsEmpty]: Start isEmpty. Operand 62650 states and 87426 transitions. [2025-02-05 16:34:24,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:34:24,183 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:24,183 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:34:24,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:34:24,183 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:24,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:24,184 INFO L85 PathProgramCache]: Analyzing trace with hash 873331243, now seen corresponding path program 1 times [2025-02-05 16:34:24,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:24,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423392278] [2025-02-05 16:34:24,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:24,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:24,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:34:24,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:34:24,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:24,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:24,359 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:34:24,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:24,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423392278] [2025-02-05 16:34:24,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423392278] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:24,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:24,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:34:24,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817139450] [2025-02-05 16:34:24,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:24,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:34:24,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:24,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:34:24,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:34:24,361 INFO L87 Difference]: Start difference. First operand 62650 states and 87426 transitions. Second operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:25,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:25,011 INFO L93 Difference]: Finished difference Result 134303 states and 187267 transitions. [2025-02-05 16:34:25,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:34:25,012 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-02-05 16:34:25,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:25,121 INFO L225 Difference]: With dead ends: 134303 [2025-02-05 16:34:25,121 INFO L226 Difference]: Without dead ends: 94372 [2025-02-05 16:34:25,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:34:25,168 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 674 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:25,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 844 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:34:25,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94372 states. [2025-02-05 16:34:25,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94372 to 62610. [2025-02-05 16:34:26,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62610 states, 62609 states have (on average 1.3944959989777828) internal successors, (87308), 62609 states have internal predecessors, (87308), 0 states have call successors, (0), 0 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:34:26,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62610 states to 62610 states and 87308 transitions. [2025-02-05 16:34:26,100 INFO L78 Accepts]: Start accepts. Automaton has 62610 states and 87308 transitions. Word has length 77 [2025-02-05 16:34:26,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:26,100 INFO L471 AbstractCegarLoop]: Abstraction has 62610 states and 87308 transitions. [2025-02-05 16:34:26,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:26,101 INFO L276 IsEmpty]: Start isEmpty. Operand 62610 states and 87308 transitions. [2025-02-05 16:34:26,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 16:34:26,105 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:26,105 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] [2025-02-05 16:34:26,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:34:26,106 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:26,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:26,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1541639458, now seen corresponding path program 1 times [2025-02-05 16:34:26,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:26,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816249099] [2025-02-05 16:34:26,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:26,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:26,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 16:34:26,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 16:34:26,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:26,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:26,953 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:34:26,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:26,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816249099] [2025-02-05 16:34:26,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816249099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:26,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:26,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:34:26,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109795615] [2025-02-05 16:34:26,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:26,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:34:26,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:26,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:34:26,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:34:26,954 INFO L87 Difference]: Start difference. First operand 62610 states and 87308 transitions. Second operand has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 0 states have call successors, (0), 0 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:34:27,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:27,963 INFO L93 Difference]: Finished difference Result 135987 states and 189771 transitions. [2025-02-05 16:34:27,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:34:27,964 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-02-05 16:34:27,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:28,159 INFO L225 Difference]: With dead ends: 135987 [2025-02-05 16:34:28,160 INFO L226 Difference]: Without dead ends: 118202 [2025-02-05 16:34:28,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:34:28,214 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 1324 mSDsluCounter, 2078 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1324 SdHoareTripleChecker+Valid, 2338 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:28,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1324 Valid, 2338 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:34:28,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118202 states. [2025-02-05 16:34:29,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118202 to 62560. [2025-02-05 16:34:29,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62560 states, 62559 states have (on average 1.39457152448089) internal successors, (87243), 62559 states have internal predecessors, (87243), 0 states have call successors, (0), 0 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:34:29,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62560 states to 62560 states and 87243 transitions. [2025-02-05 16:34:29,381 INFO L78 Accepts]: Start accepts. Automaton has 62560 states and 87243 transitions. Word has length 78 [2025-02-05 16:34:29,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:29,381 INFO L471 AbstractCegarLoop]: Abstraction has 62560 states and 87243 transitions. [2025-02-05 16:34:29,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 13 states have internal predecessors, (78), 0 states have call successors, (0), 0 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:34:29,381 INFO L276 IsEmpty]: Start isEmpty. Operand 62560 states and 87243 transitions. [2025-02-05 16:34:29,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 16:34:29,386 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:29,386 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] [2025-02-05 16:34:29,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 16:34:29,386 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:29,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:29,386 INFO L85 PathProgramCache]: Analyzing trace with hash -408550813, now seen corresponding path program 1 times [2025-02-05 16:34:29,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:29,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705388635] [2025-02-05 16:34:29,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:29,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:29,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 16:34:29,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 16:34:29,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:29,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:29,767 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:34:29,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:29,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705388635] [2025-02-05 16:34:29,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705388635] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:29,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:29,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 16:34:29,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787736527] [2025-02-05 16:34:29,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:29,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:34:29,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:29,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:34:29,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:34:29,768 INFO L87 Difference]: Start difference. First operand 62560 states and 87243 transitions. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 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:34:30,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:30,583 INFO L93 Difference]: Finished difference Result 110943 states and 154324 transitions. [2025-02-05 16:34:30,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:34:30,583 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-02-05 16:34:30,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:30,732 INFO L225 Difference]: With dead ends: 110943 [2025-02-05 16:34:30,732 INFO L226 Difference]: Without dead ends: 104673 [2025-02-05 16:34:30,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:34:30,763 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 1339 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1339 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:30,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1339 Valid, 1307 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:34:30,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104673 states. [2025-02-05 16:34:31,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104673 to 61866. [2025-02-05 16:34:31,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61866 states, 61865 states have (on average 1.3950537460599692) internal successors, (86305), 61865 states have internal predecessors, (86305), 0 states have call successors, (0), 0 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:34:31,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61866 states to 61866 states and 86305 transitions. [2025-02-05 16:34:31,843 INFO L78 Accepts]: Start accepts. Automaton has 61866 states and 86305 transitions. Word has length 78 [2025-02-05 16:34:31,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:31,843 INFO L471 AbstractCegarLoop]: Abstraction has 61866 states and 86305 transitions. [2025-02-05 16:34:31,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 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:34:31,843 INFO L276 IsEmpty]: Start isEmpty. Operand 61866 states and 86305 transitions. [2025-02-05 16:34:31,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 16:34:31,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:31,847 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] [2025-02-05 16:34:31,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 16:34:31,849 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:31,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:31,850 INFO L85 PathProgramCache]: Analyzing trace with hash -248041127, now seen corresponding path program 1 times [2025-02-05 16:34:31,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:31,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594784923] [2025-02-05 16:34:31,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:31,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:31,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 16:34:31,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 16:34:31,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:31,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:31,891 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:34:31,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:31,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594784923] [2025-02-05 16:34:31,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594784923] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:31,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:31,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:31,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595119134] [2025-02-05 16:34:31,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:31,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:31,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:31,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:31,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:31,892 INFO L87 Difference]: Start difference. First operand 61866 states and 86305 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:32,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:32,193 INFO L93 Difference]: Finished difference Result 138073 states and 192748 transitions. [2025-02-05 16:34:32,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:32,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-02-05 16:34:32,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:32,318 INFO L225 Difference]: With dead ends: 138073 [2025-02-05 16:34:32,319 INFO L226 Difference]: Without dead ends: 98233 [2025-02-05 16:34:32,371 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:34:32,372 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 195 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:32,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 375 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:32,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98233 states. [2025-02-05 16:34:33,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98233 to 97869. [2025-02-05 16:34:33,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97869 states, 97868 states have (on average 1.3975456737646625) internal successors, (136775), 97868 states have internal predecessors, (136775), 0 states have call successors, (0), 0 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:34:33,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97869 states to 97869 states and 136775 transitions. [2025-02-05 16:34:33,611 INFO L78 Accepts]: Start accepts. Automaton has 97869 states and 136775 transitions. Word has length 79 [2025-02-05 16:34:33,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:33,611 INFO L471 AbstractCegarLoop]: Abstraction has 97869 states and 136775 transitions. [2025-02-05 16:34:33,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:33,611 INFO L276 IsEmpty]: Start isEmpty. Operand 97869 states and 136775 transitions. [2025-02-05 16:34:33,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 16:34:33,616 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:33,616 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] [2025-02-05 16:34:33,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 16:34:33,616 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:33,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:33,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1173505979, now seen corresponding path program 1 times [2025-02-05 16:34:33,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:33,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326615722] [2025-02-05 16:34:33,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:33,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:33,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 16:34:33,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 16:34:33,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:33,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:33,664 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:34:33,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:33,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326615722] [2025-02-05 16:34:33,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326615722] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:33,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:33,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:33,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664422066] [2025-02-05 16:34:33,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:33,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:33,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:33,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:33,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:33,665 INFO L87 Difference]: Start difference. First operand 97869 states and 136775 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:34,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:34,645 INFO L93 Difference]: Finished difference Result 201414 states and 281536 transitions. [2025-02-05 16:34:34,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:34,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-02-05 16:34:34,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:34,792 INFO L225 Difference]: With dead ends: 201414 [2025-02-05 16:34:34,792 INFO L226 Difference]: Without dead ends: 136680 [2025-02-05 16:34:34,820 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:34:34,821 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 177 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:34,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 361 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:34,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136680 states. [2025-02-05 16:34:35,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136680 to 90927. [2025-02-05 16:34:35,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90927 states, 90926 states have (on average 1.3976970283527264) internal successors, (127087), 90926 states have internal predecessors, (127087), 0 states have call successors, (0), 0 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:34:35,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90927 states to 90927 states and 127087 transitions. [2025-02-05 16:34:36,000 INFO L78 Accepts]: Start accepts. Automaton has 90927 states and 127087 transitions. Word has length 79 [2025-02-05 16:34:36,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:36,000 INFO L471 AbstractCegarLoop]: Abstraction has 90927 states and 127087 transitions. [2025-02-05 16:34:36,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:34:36,003 INFO L276 IsEmpty]: Start isEmpty. Operand 90927 states and 127087 transitions. [2025-02-05 16:34:36,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 16:34:36,012 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:36,012 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] [2025-02-05 16:34:36,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 16:34:36,012 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:36,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:36,013 INFO L85 PathProgramCache]: Analyzing trace with hash 2059735434, now seen corresponding path program 1 times [2025-02-05 16:34:36,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:36,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065275633] [2025-02-05 16:34:36,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:36,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:36,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 16:34:36,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 16:34:36,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:36,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:36,069 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:34:36,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:36,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065275633] [2025-02-05 16:34:36,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065275633] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:36,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:36,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:36,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998417995] [2025-02-05 16:34:36,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:36,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:36,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:36,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:36,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:36,071 INFO L87 Difference]: Start difference. First operand 90927 states and 127087 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 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:34:36,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:36,352 INFO L93 Difference]: Finished difference Result 127867 states and 178142 transitions. [2025-02-05 16:34:36,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:36,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-02-05 16:34:36,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:36,459 INFO L225 Difference]: With dead ends: 127867 [2025-02-05 16:34:36,459 INFO L226 Difference]: Without dead ends: 85307 [2025-02-05 16:34:36,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:36,507 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 159 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:36,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 599 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:36,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85307 states. [2025-02-05 16:34:37,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85307 to 85305. [2025-02-05 16:34:37,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85305 states, 85304 states have (on average 1.380345587545719) internal successors, (117749), 85304 states have internal predecessors, (117749), 0 states have call successors, (0), 0 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:34:37,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85305 states to 85305 states and 117749 transitions. [2025-02-05 16:34:37,511 INFO L78 Accepts]: Start accepts. Automaton has 85305 states and 117749 transitions. Word has length 81 [2025-02-05 16:34:37,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:37,511 INFO L471 AbstractCegarLoop]: Abstraction has 85305 states and 117749 transitions. [2025-02-05 16:34:37,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 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:34:37,511 INFO L276 IsEmpty]: Start isEmpty. Operand 85305 states and 117749 transitions. [2025-02-05 16:34:37,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 16:34:37,516 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:37,516 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] [2025-02-05 16:34:37,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 16:34:37,517 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:37,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:37,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1743003449, now seen corresponding path program 1 times [2025-02-05 16:34:37,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:37,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824427229] [2025-02-05 16:34:37,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:37,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:37,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 16:34:37,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 16:34:37,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:37,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:37,553 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:34:37,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:37,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824427229] [2025-02-05 16:34:37,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824427229] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:37,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:37,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:37,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153942022] [2025-02-05 16:34:37,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:37,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:37,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:37,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:37,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:37,555 INFO L87 Difference]: Start difference. First operand 85305 states and 117749 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 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:34:37,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:37,856 INFO L93 Difference]: Finished difference Result 130778 states and 180782 transitions. [2025-02-05 16:34:37,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:37,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-02-05 16:34:37,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:37,958 INFO L225 Difference]: With dead ends: 130778 [2025-02-05 16:34:37,958 INFO L226 Difference]: Without dead ends: 93494 [2025-02-05 16:34:38,007 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:34:38,007 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 181 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:38,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 425 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:38,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93494 states. [2025-02-05 16:34:39,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93494 to 83558. [2025-02-05 16:34:39,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83558 states, 83557 states have (on average 1.378807281257106) internal successors, (115209), 83557 states have internal predecessors, (115209), 0 states have call successors, (0), 0 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:34:39,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83558 states to 83558 states and 115209 transitions. [2025-02-05 16:34:39,462 INFO L78 Accepts]: Start accepts. Automaton has 83558 states and 115209 transitions. Word has length 82 [2025-02-05 16:34:39,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:39,464 INFO L471 AbstractCegarLoop]: Abstraction has 83558 states and 115209 transitions. [2025-02-05 16:34:39,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 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:34:39,465 INFO L276 IsEmpty]: Start isEmpty. Operand 83558 states and 115209 transitions. [2025-02-05 16:34:39,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 16:34:39,471 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:39,471 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] [2025-02-05 16:34:39,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 16:34:39,471 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:39,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:39,471 INFO L85 PathProgramCache]: Analyzing trace with hash -383234370, now seen corresponding path program 1 times [2025-02-05 16:34:39,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:39,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81980816] [2025-02-05 16:34:39,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:39,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:39,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 16:34:39,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 16:34:39,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:39,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:39,545 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:34:39,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:39,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81980816] [2025-02-05 16:34:39,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81980816] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:39,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:39,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:39,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216201965] [2025-02-05 16:34:39,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:39,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:39,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:39,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:39,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:39,546 INFO L87 Difference]: Start difference. First operand 83558 states and 115209 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 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:34:40,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:40,200 INFO L93 Difference]: Finished difference Result 106883 states and 146986 transitions. [2025-02-05 16:34:40,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:40,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-02-05 16:34:40,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:40,277 INFO L225 Difference]: With dead ends: 106883 [2025-02-05 16:34:40,277 INFO L226 Difference]: Without dead ends: 74031 [2025-02-05 16:34:40,296 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:34:40,297 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 140 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:40,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 553 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:40,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74031 states. [2025-02-05 16:34:40,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74031 to 74029. [2025-02-05 16:34:40,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74029 states, 74028 states have (on average 1.3654563138272005) internal successors, (101082), 74028 states have internal predecessors, (101082), 0 states have call successors, (0), 0 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:34:40,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74029 states to 74029 states and 101082 transitions. [2025-02-05 16:34:40,964 INFO L78 Accepts]: Start accepts. Automaton has 74029 states and 101082 transitions. Word has length 82 [2025-02-05 16:34:40,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:34:40,965 INFO L471 AbstractCegarLoop]: Abstraction has 74029 states and 101082 transitions. [2025-02-05 16:34:40,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 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:34:40,965 INFO L276 IsEmpty]: Start isEmpty. Operand 74029 states and 101082 transitions. [2025-02-05 16:34:40,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 16:34:40,970 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:34:40,970 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:40,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 16:34:40,970 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:34:40,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:34:40,971 INFO L85 PathProgramCache]: Analyzing trace with hash 965271617, now seen corresponding path program 1 times [2025-02-05 16:34:40,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:34:40,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541738468] [2025-02-05 16:34:40,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:34:40,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:34:40,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 16:34:40,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 16:34:40,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:34:40,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:34:41,003 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:34:41,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:34:41,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541738468] [2025-02-05 16:34:41,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541738468] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:34:41,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:34:41,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:34:41,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566402773] [2025-02-05 16:34:41,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:34:41,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:34:41,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:34:41,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:34:41,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:41,004 INFO L87 Difference]: Start difference. First operand 74029 states and 101082 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 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:34:41,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:34:41,507 INFO L93 Difference]: Finished difference Result 146116 states and 199715 transitions. [2025-02-05 16:34:41,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:34:41,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-02-05 16:34:41,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:34:41,651 INFO L225 Difference]: With dead ends: 146116 [2025-02-05 16:34:41,651 INFO L226 Difference]: Without dead ends: 101734 [2025-02-05 16:34:41,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:34:41,695 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 174 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:34:41,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 360 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:34:41,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101734 states. [2025-02-05 16:34:42,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101734 to 72433. [2025-02-05 16:34:42,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72433 states, 72432 states have (on average 1.3633614976805832) internal successors, (98751), 72432 states have internal predecessors, (98751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)