./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d09ea01cef1d93b0c86c8a3dadfd601718ca81915e873154848504beefeee43f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:37:48,655 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:37:48,702 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:37:48,705 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:37:48,706 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:37:48,728 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:37:48,728 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:37:48,729 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:37:48,729 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:37:48,729 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:37:48,729 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:37:48,730 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:37:48,730 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:37:48,730 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:37:48,730 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:37:48,730 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:37:48,731 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:37:48,731 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:37:48,732 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:37:48,732 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:37:48,732 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:37:48,732 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:37:48,732 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:37:48,732 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:37:48,732 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:37:48,732 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:37:48,732 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:37:48,732 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:37:48,732 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:37:48,732 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:37:48,733 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:37:48,733 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:37:48,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:37:48,733 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:37:48,733 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:37:48,733 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:37:48,733 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:37:48,733 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:37:48,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:37:48,733 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:37:48,733 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:37:48,733 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:37:48,733 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:37:48,733 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d09ea01cef1d93b0c86c8a3dadfd601718ca81915e873154848504beefeee43f [2025-03-16 19:37:48,944 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:37:48,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:37:48,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:37:48,956 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:37:48,957 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:37:48,957 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-16 19:37:50,064 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4a345dd3/761bf2eec2fc4ca5add2b698ebab1d4b/FLAG66c0b6ec0 [2025-03-16 19:37:50,328 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:37:50,329 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-16 19:37:50,346 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4a345dd3/761bf2eec2fc4ca5add2b698ebab1d4b/FLAG66c0b6ec0 [2025-03-16 19:37:50,361 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4a345dd3/761bf2eec2fc4ca5add2b698ebab1d4b [2025-03-16 19:37:50,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:37:50,365 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:37:50,366 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:37:50,367 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:37:50,369 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:37:50,370 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:37:50" (1/1) ... [2025-03-16 19:37:50,371 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cd3b52d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:37:50, skipping insertion in model container [2025-03-16 19:37:50,372 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:37:50" (1/1) ... [2025-03-16 19:37:50,408 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:37:50,584 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[11680,11693] [2025-03-16 19:37:50,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:37:50,635 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:37:50,702 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[11680,11693] [2025-03-16 19:37:50,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:37:50,746 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:37:50,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:37:50 WrapperNode [2025-03-16 19:37:50,746 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:37:50,747 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:37:50,747 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:37:50,747 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:37:50,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:37:50" (1/1) ... [2025-03-16 19:37:50,765 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:37:50" (1/1) ... [2025-03-16 19:37:50,815 INFO L138 Inliner]: procedures = 28, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1033 [2025-03-16 19:37:50,819 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:37:50,820 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:37:50,820 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:37:50,820 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:37:50,826 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:37:50" (1/1) ... [2025-03-16 19:37:50,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:37:50" (1/1) ... [2025-03-16 19:37:50,832 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:37:50" (1/1) ... [2025-03-16 19:37:50,855 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 19:37:50,859 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:37:50" (1/1) ... [2025-03-16 19:37:50,859 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:37:50" (1/1) ... [2025-03-16 19:37:50,870 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:37:50" (1/1) ... [2025-03-16 19:37:50,874 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:37:50" (1/1) ... [2025-03-16 19:37:50,880 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:37:50" (1/1) ... [2025-03-16 19:37:50,882 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:37:50" (1/1) ... [2025-03-16 19:37:50,889 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:37:50,889 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:37:50,889 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:37:50,889 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:37:50,890 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:37:50" (1/1) ... [2025-03-16 19:37:50,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:37:50,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:37:50,924 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:37:50,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:37:50,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:37:50,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:37:50,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:37:50,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:37:51,075 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:37:51,076 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:37:51,815 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L766: havoc main_~node7____CPAchecker_TMP_0~1#1;havoc main_~node7__m7~2#1; [2025-03-16 19:37:51,816 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L700: havoc main_~node5__m5~2#1; [2025-03-16 19:37:51,816 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L635: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-16 19:37:51,816 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L901: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-16 19:37:51,816 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L670: havoc main_~node3__m3~2#1; [2025-03-16 19:37:51,816 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L577: havoc main_~node8__m8~1#1;havoc main_~node7__m7~1#1;havoc main_~node6__m6~1#1;havoc main_~node5__m5~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_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node8____CPAchecker_TMP_0~0#1;havoc main_~node8__m8~0#1;havoc main_~node7____CPAchecker_TMP_0~0#1;havoc main_~node7__m7~0#1;havoc main_~node6____CPAchecker_TMP_0~0#1;havoc main_~node6__m6~0#1;havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-16 19:37:51,816 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1042: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-16 19:37:51,817 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L811: havoc main_~node6____CPAchecker_TMP_0~1#1; [2025-03-16 19:37:51,817 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L946: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-16 19:37:51,817 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L715: havoc main_~node6__m6~2#1; [2025-03-16 19:37:51,817 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L685: havoc main_~node4__m4~2#1; [2025-03-16 19:37:51,817 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L655: havoc main_~node2__m2~2#1; [2025-03-16 19:37:51,817 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L856: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-16 19:37:51,817 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1123: havoc main_~node8____CPAchecker_TMP_0~1#1; [2025-03-16 19:37:51,817 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L991: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-16 19:37:51,869 INFO L? ?]: Removed 115 outVars from TransFormulas that were not future-live. [2025-03-16 19:37:51,870 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:37:51,884 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:37:51,885 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:37:51,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:37:51 BoogieIcfgContainer [2025-03-16 19:37:51,886 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:37:51,887 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:37:51,887 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:37:51,890 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:37:51,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:37:50" (1/3) ... [2025-03-16 19:37:51,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70010b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:37:51, skipping insertion in model container [2025-03-16 19:37:51,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:37:50" (2/3) ... [2025-03-16 19:37:51,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70010b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:37:51, skipping insertion in model container [2025-03-16 19:37:51,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:37:51" (3/3) ... [2025-03-16 19:37:51,892 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-16 19:37:51,904 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:37:51,906 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 230 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 19:37:51,950 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:37:51,957 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;@4f39502f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:37:51,957 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:37:51,960 INFO L276 IsEmpty]: Start isEmpty. Operand has 230 states, 228 states have (on average 1.7719298245614035) internal successors, (404), 229 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:51,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-16 19:37:51,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:51,966 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:51,967 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:51,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:51,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1404924464, now seen corresponding path program 1 times [2025-03-16 19:37:51,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:51,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064785075] [2025-03-16 19:37:51,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:51,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:52,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-16 19:37:52,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-16 19:37:52,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:52,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:52,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-03-16 19:37:52,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:52,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064785075] [2025-03-16 19:37:52,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064785075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:52,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:52,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:37:52,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934158292] [2025-03-16 19:37:52,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:52,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:37:52,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:52,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:37:52,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:37:52,795 INFO L87 Difference]: Start difference. First operand has 230 states, 228 states have (on average 1.7719298245614035) internal successors, (404), 229 states have internal predecessors, (404), 0 states have call successors, (0), 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 10 states, 10 states have (on average 12.3) internal successors, (123), 10 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:53,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:53,646 INFO L93 Difference]: Finished difference Result 1825 states and 2954 transitions. [2025-03-16 19:37:53,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:37:53,648 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2025-03-16 19:37:53,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:53,669 INFO L225 Difference]: With dead ends: 1825 [2025-03-16 19:37:53,670 INFO L226 Difference]: Without dead ends: 1704 [2025-03-16 19:37:53,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:37:53,675 INFO L435 NwaCegarLoop]: 1355 mSDtfsCounter, 3200 mSDsluCounter, 9979 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3200 SdHoareTripleChecker+Valid, 11334 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:53,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3200 Valid, 11334 Invalid, 768 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:37:53,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states. [2025-03-16 19:37:53,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 347. [2025-03-16 19:37:53,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 1.4479768786127167) internal successors, (501), 346 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:53,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 501 transitions. [2025-03-16 19:37:53,744 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 501 transitions. Word has length 123 [2025-03-16 19:37:53,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:53,746 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 501 transitions. [2025-03-16 19:37:53,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:53,746 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 501 transitions. [2025-03-16 19:37:53,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-16 19:37:53,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:53,748 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:53,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:37:53,749 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:53,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:53,750 INFO L85 PathProgramCache]: Analyzing trace with hash -581597492, now seen corresponding path program 1 times [2025-03-16 19:37:53,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:53,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408898917] [2025-03-16 19:37:53,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:53,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:53,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-16 19:37:53,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-16 19:37:53,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:53,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:54,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:54,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:54,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408898917] [2025-03-16 19:37:54,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408898917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:54,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:54,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:37:54,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719248918] [2025-03-16 19:37:54,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:54,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:37:54,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:54,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:37:54,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:37:54,106 INFO L87 Difference]: Start difference. First operand 347 states and 501 transitions. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:54,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:54,500 INFO L93 Difference]: Finished difference Result 1959 states and 3066 transitions. [2025-03-16 19:37:54,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 19:37:54,500 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2025-03-16 19:37:54,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:54,506 INFO L225 Difference]: With dead ends: 1959 [2025-03-16 19:37:54,506 INFO L226 Difference]: Without dead ends: 1779 [2025-03-16 19:37:54,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:37:54,507 INFO L435 NwaCegarLoop]: 1317 mSDtfsCounter, 2287 mSDsluCounter, 4769 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2287 SdHoareTripleChecker+Valid, 6086 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:54,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2287 Valid, 6086 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:37:54,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2025-03-16 19:37:54,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 551. [2025-03-16 19:37:54,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 550 states have (on average 1.5036363636363637) internal successors, (827), 550 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:54,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 827 transitions. [2025-03-16 19:37:54,537 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 827 transitions. Word has length 125 [2025-03-16 19:37:54,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:54,538 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 827 transitions. [2025-03-16 19:37:54,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:54,538 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 827 transitions. [2025-03-16 19:37:54,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-16 19:37:54,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:54,540 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:54,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:37:54,540 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:54,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:54,541 INFO L85 PathProgramCache]: Analyzing trace with hash 935372756, now seen corresponding path program 1 times [2025-03-16 19:37:54,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:54,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35828737] [2025-03-16 19:37:54,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:54,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:54,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-16 19:37:54,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-16 19:37:54,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:54,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:54,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:54,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:54,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35828737] [2025-03-16 19:37:54,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35828737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:54,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:54,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:37:54,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978708786] [2025-03-16 19:37:54,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:54,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:37:54,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:54,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:37:54,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:37:54,790 INFO L87 Difference]: Start difference. First operand 551 states and 827 transitions. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:55,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:55,147 INFO L93 Difference]: Finished difference Result 2163 states and 3392 transitions. [2025-03-16 19:37:55,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 19:37:55,148 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2025-03-16 19:37:55,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:55,154 INFO L225 Difference]: With dead ends: 2163 [2025-03-16 19:37:55,154 INFO L226 Difference]: Without dead ends: 1983 [2025-03-16 19:37:55,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:37:55,156 INFO L435 NwaCegarLoop]: 1191 mSDtfsCounter, 2280 mSDsluCounter, 4139 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2280 SdHoareTripleChecker+Valid, 5330 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:55,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2280 Valid, 5330 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:37:55,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2025-03-16 19:37:55,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 844. [2025-03-16 19:37:55,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 843 states have (on average 1.5361803084223014) internal successors, (1295), 843 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:55,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1295 transitions. [2025-03-16 19:37:55,188 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1295 transitions. Word has length 125 [2025-03-16 19:37:55,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:55,188 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 1295 transitions. [2025-03-16 19:37:55,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:55,188 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1295 transitions. [2025-03-16 19:37:55,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-16 19:37:55,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:55,189 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:55,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:37:55,189 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:55,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:55,191 INFO L85 PathProgramCache]: Analyzing trace with hash -43490356, now seen corresponding path program 1 times [2025-03-16 19:37:55,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:55,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191040031] [2025-03-16 19:37:55,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:55,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:55,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-16 19:37:55,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-16 19:37:55,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:55,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:55,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:55,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:55,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191040031] [2025-03-16 19:37:55,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191040031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:55,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:55,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:37:55,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183918874] [2025-03-16 19:37:55,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:55,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:37:55,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:55,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:37:55,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:37:55,439 INFO L87 Difference]: Start difference. First operand 844 states and 1295 transitions. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:55,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:55,838 INFO L93 Difference]: Finished difference Result 2362 states and 3710 transitions. [2025-03-16 19:37:55,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 19:37:55,839 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2025-03-16 19:37:55,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:55,845 INFO L225 Difference]: With dead ends: 2362 [2025-03-16 19:37:55,845 INFO L226 Difference]: Without dead ends: 2182 [2025-03-16 19:37:55,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:37:55,847 INFO L435 NwaCegarLoop]: 1065 mSDtfsCounter, 2400 mSDsluCounter, 4311 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2400 SdHoareTripleChecker+Valid, 5376 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:55,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2400 Valid, 5376 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:37:55,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2025-03-16 19:37:55,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 1043. [2025-03-16 19:37:55,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1043 states, 1042 states have (on average 1.5479846449136276) internal successors, (1613), 1042 states have internal predecessors, (1613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:55,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1613 transitions. [2025-03-16 19:37:55,879 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1613 transitions. Word has length 125 [2025-03-16 19:37:55,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:55,879 INFO L471 AbstractCegarLoop]: Abstraction has 1043 states and 1613 transitions. [2025-03-16 19:37:55,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:55,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1613 transitions. [2025-03-16 19:37:55,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-16 19:37:55,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:55,882 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:55,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:37:55,882 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:55,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:55,882 INFO L85 PathProgramCache]: Analyzing trace with hash -891098412, now seen corresponding path program 1 times [2025-03-16 19:37:55,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:55,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570345841] [2025-03-16 19:37:55,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:55,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:55,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-16 19:37:55,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-16 19:37:55,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:55,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:56,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:56,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:56,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570345841] [2025-03-16 19:37:56,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570345841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:56,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:56,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:37:56,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416902347] [2025-03-16 19:37:56,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:56,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:37:56,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:56,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:37:56,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:37:56,125 INFO L87 Difference]: Start difference. First operand 1043 states and 1613 transitions. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:56,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:56,453 INFO L93 Difference]: Finished difference Result 2556 states and 4020 transitions. [2025-03-16 19:37:56,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 19:37:56,453 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2025-03-16 19:37:56,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:56,460 INFO L225 Difference]: With dead ends: 2556 [2025-03-16 19:37:56,460 INFO L226 Difference]: Without dead ends: 2376 [2025-03-16 19:37:56,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:37:56,462 INFO L435 NwaCegarLoop]: 939 mSDtfsCounter, 2523 mSDsluCounter, 3548 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2523 SdHoareTripleChecker+Valid, 4487 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:56,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2523 Valid, 4487 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:37:56,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2025-03-16 19:37:56,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 1237. [2025-03-16 19:37:56,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1236 states have (on average 1.5558252427184467) internal successors, (1923), 1236 states have internal predecessors, (1923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:56,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1923 transitions. [2025-03-16 19:37:56,490 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1923 transitions. Word has length 125 [2025-03-16 19:37:56,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:56,491 INFO L471 AbstractCegarLoop]: Abstraction has 1237 states and 1923 transitions. [2025-03-16 19:37:56,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:56,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1923 transitions. [2025-03-16 19:37:56,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-16 19:37:56,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:56,492 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:56,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:37:56,492 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:56,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:56,493 INFO L85 PathProgramCache]: Analyzing trace with hash -400228148, now seen corresponding path program 1 times [2025-03-16 19:37:56,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:56,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758472310] [2025-03-16 19:37:56,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:56,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:56,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-16 19:37:56,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-16 19:37:56,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:56,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:56,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:56,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:56,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758472310] [2025-03-16 19:37:56,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758472310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:56,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:56,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:37:56,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382833908] [2025-03-16 19:37:56,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:56,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:37:56,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:56,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:37:56,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:37:56,705 INFO L87 Difference]: Start difference. First operand 1237 states and 1923 transitions. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:57,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:57,022 INFO L93 Difference]: Finished difference Result 2745 states and 4322 transitions. [2025-03-16 19:37:57,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 19:37:57,022 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2025-03-16 19:37:57,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:57,030 INFO L225 Difference]: With dead ends: 2745 [2025-03-16 19:37:57,030 INFO L226 Difference]: Without dead ends: 2565 [2025-03-16 19:37:57,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:37:57,032 INFO L435 NwaCegarLoop]: 813 mSDtfsCounter, 2641 mSDsluCounter, 3937 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2641 SdHoareTripleChecker+Valid, 4750 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:57,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2641 Valid, 4750 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:37:57,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2025-03-16 19:37:57,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1426. [2025-03-16 19:37:57,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1425 states have (on average 1.5614035087719298) internal successors, (2225), 1425 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:57,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2225 transitions. [2025-03-16 19:37:57,068 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 2225 transitions. Word has length 125 [2025-03-16 19:37:57,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:57,068 INFO L471 AbstractCegarLoop]: Abstraction has 1426 states and 2225 transitions. [2025-03-16 19:37:57,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:57,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 2225 transitions. [2025-03-16 19:37:57,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-16 19:37:57,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:57,070 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:57,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:37:57,070 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:57,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:57,070 INFO L85 PathProgramCache]: Analyzing trace with hash -374116908, now seen corresponding path program 1 times [2025-03-16 19:37:57,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:57,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407199481] [2025-03-16 19:37:57,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:57,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:57,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-16 19:37:57,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-16 19:37:57,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:57,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:57,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:57,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:57,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407199481] [2025-03-16 19:37:57,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407199481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:57,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:57,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:37:57,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343641009] [2025-03-16 19:37:57,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:57,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:37:57,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:57,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:37:57,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:37:57,296 INFO L87 Difference]: Start difference. First operand 1426 states and 2225 transitions. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:57,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:57,572 INFO L93 Difference]: Finished difference Result 2929 states and 4616 transitions. [2025-03-16 19:37:57,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 19:37:57,573 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2025-03-16 19:37:57,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:57,580 INFO L225 Difference]: With dead ends: 2929 [2025-03-16 19:37:57,580 INFO L226 Difference]: Without dead ends: 2749 [2025-03-16 19:37:57,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:37:57,583 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 2762 mSDsluCounter, 3829 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2762 SdHoareTripleChecker+Valid, 4516 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:57,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2762 Valid, 4516 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:37:57,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2749 states. [2025-03-16 19:37:57,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2749 to 1610. [2025-03-16 19:37:57,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1609 states have (on average 1.5655686761963952) internal successors, (2519), 1609 states have internal predecessors, (2519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:57,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2519 transitions. [2025-03-16 19:37:57,618 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2519 transitions. Word has length 125 [2025-03-16 19:37:57,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:57,618 INFO L471 AbstractCegarLoop]: Abstraction has 1610 states and 2519 transitions. [2025-03-16 19:37:57,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:57,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2519 transitions. [2025-03-16 19:37:57,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-16 19:37:57,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:57,623 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:57,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:37:57,623 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:57,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:57,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1339776460, now seen corresponding path program 1 times [2025-03-16 19:37:57,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:57,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199863336] [2025-03-16 19:37:57,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:57,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:57,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-16 19:37:57,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-16 19:37:57,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:57,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:57,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:57,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:57,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199863336] [2025-03-16 19:37:57,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199863336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:57,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:57,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:37:57,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96411130] [2025-03-16 19:37:57,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:57,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:37:57,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:57,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:37:57,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:37:57,828 INFO L87 Difference]: Start difference. First operand 1610 states and 2519 transitions. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:58,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:58,081 INFO L93 Difference]: Finished difference Result 3108 states and 4902 transitions. [2025-03-16 19:37:58,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 19:37:58,082 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2025-03-16 19:37:58,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:58,093 INFO L225 Difference]: With dead ends: 3108 [2025-03-16 19:37:58,093 INFO L226 Difference]: Without dead ends: 2928 [2025-03-16 19:37:58,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:37:58,094 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 2880 mSDsluCounter, 4289 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2880 SdHoareTripleChecker+Valid, 4850 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:58,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2880 Valid, 4850 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:37:58,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2025-03-16 19:37:58,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1789. [2025-03-16 19:37:58,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1789 states, 1788 states have (on average 1.5687919463087248) internal successors, (2805), 1788 states have internal predecessors, (2805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:58,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 2805 transitions. [2025-03-16 19:37:58,124 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 2805 transitions. Word has length 125 [2025-03-16 19:37:58,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:58,125 INFO L471 AbstractCegarLoop]: Abstraction has 1789 states and 2805 transitions. [2025-03-16 19:37:58,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:58,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2805 transitions. [2025-03-16 19:37:58,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-16 19:37:58,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:58,126 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:58,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:37:58,126 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:58,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:58,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1547620716, now seen corresponding path program 1 times [2025-03-16 19:37:58,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:58,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745066384] [2025-03-16 19:37:58,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:58,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:58,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-16 19:37:58,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-16 19:37:58,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:58,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:58,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:58,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:58,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745066384] [2025-03-16 19:37:58,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745066384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:58,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:58,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:37:58,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944814067] [2025-03-16 19:37:58,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:58,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:37:58,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:58,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:37:58,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:37:58,321 INFO L87 Difference]: Start difference. First operand 1789 states and 2805 transitions. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:58,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:58,575 INFO L93 Difference]: Finished difference Result 3286 states and 5187 transitions. [2025-03-16 19:37:58,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 19:37:58,576 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2025-03-16 19:37:58,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:58,583 INFO L225 Difference]: With dead ends: 3286 [2025-03-16 19:37:58,584 INFO L226 Difference]: Without dead ends: 3106 [2025-03-16 19:37:58,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:37:58,587 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 2989 mSDsluCounter, 4955 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2989 SdHoareTripleChecker+Valid, 5398 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:58,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2989 Valid, 5398 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:37:58,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2025-03-16 19:37:58,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 1967. [2025-03-16 19:37:58,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1967 states, 1966 states have (on average 1.5717192268565616) internal successors, (3090), 1966 states have internal predecessors, (3090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:58,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3090 transitions. [2025-03-16 19:37:58,629 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3090 transitions. Word has length 125 [2025-03-16 19:37:58,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:58,629 INFO L471 AbstractCegarLoop]: Abstraction has 1967 states and 3090 transitions. [2025-03-16 19:37:58,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:58,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3090 transitions. [2025-03-16 19:37:58,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-16 19:37:58,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:58,630 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:58,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:37:58,631 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:58,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:58,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1473624455, now seen corresponding path program 1 times [2025-03-16 19:37:58,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:58,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394714574] [2025-03-16 19:37:58,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:58,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:58,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-16 19:37:58,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-16 19:37:58,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:58,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:58,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:58,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:58,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394714574] [2025-03-16 19:37:58,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394714574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:58,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:58,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:37:58,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372938441] [2025-03-16 19:37:58,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:58,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:37:58,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:58,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:37:58,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:37:58,718 INFO L87 Difference]: Start difference. First operand 1967 states and 3090 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:58,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:58,746 INFO L93 Difference]: Finished difference Result 5230 states and 8291 transitions. [2025-03-16 19:37:58,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:37:58,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2025-03-16 19:37:58,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:58,755 INFO L225 Difference]: With dead ends: 5230 [2025-03-16 19:37:58,755 INFO L226 Difference]: Without dead ends: 3537 [2025-03-16 19:37:58,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:37:58,758 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 131 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:58,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 732 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:37:58,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3537 states. [2025-03-16 19:37:58,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3537 to 3497. [2025-03-16 19:37:58,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3497 states, 3496 states have (on average 1.5692219679633868) internal successors, (5486), 3496 states have internal predecessors, (5486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:58,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3497 states to 3497 states and 5486 transitions. [2025-03-16 19:37:58,808 INFO L78 Accepts]: Start accepts. Automaton has 3497 states and 5486 transitions. Word has length 125 [2025-03-16 19:37:58,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:58,808 INFO L471 AbstractCegarLoop]: Abstraction has 3497 states and 5486 transitions. [2025-03-16 19:37:58,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:58,808 INFO L276 IsEmpty]: Start isEmpty. Operand 3497 states and 5486 transitions. [2025-03-16 19:37:58,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-16 19:37:58,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:58,809 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:58,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:37:58,810 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:58,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:58,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1472462606, now seen corresponding path program 1 times [2025-03-16 19:37:58,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:58,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854590116] [2025-03-16 19:37:58,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:58,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:58,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-16 19:37:58,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-16 19:37:58,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:58,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:59,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:59,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:59,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854590116] [2025-03-16 19:37:59,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854590116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:59,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:59,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:37:59,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512420443] [2025-03-16 19:37:59,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:59,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:37:59,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:59,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:37:59,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:37:59,215 INFO L87 Difference]: Start difference. First operand 3497 states and 5486 transitions. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:59,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:59,573 INFO L93 Difference]: Finished difference Result 6722 states and 10592 transitions. [2025-03-16 19:37:59,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 19:37:59,574 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2025-03-16 19:37:59,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:59,583 INFO L225 Difference]: With dead ends: 6722 [2025-03-16 19:37:59,586 INFO L226 Difference]: Without dead ends: 3499 [2025-03-16 19:37:59,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-03-16 19:37:59,591 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 426 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 1589 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:59,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 1589 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:37:59,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3499 states. [2025-03-16 19:37:59,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3499 to 3497. [2025-03-16 19:37:59,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3497 states, 3496 states have (on average 1.5663615560640731) internal successors, (5476), 3496 states have internal predecessors, (5476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:59,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3497 states to 3497 states and 5476 transitions. [2025-03-16 19:37:59,644 INFO L78 Accepts]: Start accepts. Automaton has 3497 states and 5476 transitions. Word has length 125 [2025-03-16 19:37:59,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:59,645 INFO L471 AbstractCegarLoop]: Abstraction has 3497 states and 5476 transitions. [2025-03-16 19:37:59,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:59,645 INFO L276 IsEmpty]: Start isEmpty. Operand 3497 states and 5476 transitions. [2025-03-16 19:37:59,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-16 19:37:59,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:59,646 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:59,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:37:59,647 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:59,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:59,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1567056112, now seen corresponding path program 1 times [2025-03-16 19:37:59,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:59,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722185357] [2025-03-16 19:37:59,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:59,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:59,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-16 19:37:59,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-16 19:37:59,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:59,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:59,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:59,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:59,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722185357] [2025-03-16 19:37:59,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722185357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:59,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:59,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:37:59,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206031739] [2025-03-16 19:37:59,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:59,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:37:59,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:59,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:37:59,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:37:59,760 INFO L87 Difference]: Start difference. First operand 3497 states and 5476 transitions. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:59,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:59,902 INFO L93 Difference]: Finished difference Result 6904 states and 10855 transitions. [2025-03-16 19:37:59,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:37:59,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2025-03-16 19:37:59,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:59,908 INFO L225 Difference]: With dead ends: 6904 [2025-03-16 19:37:59,908 INFO L226 Difference]: Without dead ends: 3497 [2025-03-16 19:37:59,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:37:59,912 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 786 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:59,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 220 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:37:59,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3497 states. [2025-03-16 19:37:59,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3497 to 3497. [2025-03-16 19:37:59,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3497 states, 3496 states have (on average 1.5552059496567505) internal successors, (5437), 3496 states have internal predecessors, (5437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:59,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3497 states to 3497 states and 5437 transitions. [2025-03-16 19:37:59,953 INFO L78 Accepts]: Start accepts. Automaton has 3497 states and 5437 transitions. Word has length 126 [2025-03-16 19:37:59,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:59,954 INFO L471 AbstractCegarLoop]: Abstraction has 3497 states and 5437 transitions. [2025-03-16 19:37:59,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:59,954 INFO L276 IsEmpty]: Start isEmpty. Operand 3497 states and 5437 transitions. [2025-03-16 19:37:59,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-16 19:37:59,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:59,955 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:59,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:37:59,955 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:37:59,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:59,956 INFO L85 PathProgramCache]: Analyzing trace with hash -256080034, now seen corresponding path program 1 times [2025-03-16 19:37:59,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:59,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740492385] [2025-03-16 19:37:59,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:59,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:59,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-16 19:37:59,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-16 19:37:59,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:59,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:00,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:00,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:00,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740492385] [2025-03-16 19:38:00,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740492385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:00,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:00,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:38:00,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539336858] [2025-03-16 19:38:00,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:00,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:38:00,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:00,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:38:00,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:38:00,071 INFO L87 Difference]: Start difference. First operand 3497 states and 5437 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:00,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:00,287 INFO L93 Difference]: Finished difference Result 10284 states and 16072 transitions. [2025-03-16 19:38:00,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:38:00,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2025-03-16 19:38:00,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:00,298 INFO L225 Difference]: With dead ends: 10284 [2025-03-16 19:38:00,298 INFO L226 Difference]: Without dead ends: 6853 [2025-03-16 19:38:00,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:38:00,304 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 1230 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1230 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:00,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1230 Valid, 273 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:38:00,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6853 states. [2025-03-16 19:38:00,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6853 to 6851. [2025-03-16 19:38:00,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6851 states, 6850 states have (on average 1.5564963503649636) internal successors, (10662), 6850 states have internal predecessors, (10662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:00,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6851 states to 6851 states and 10662 transitions. [2025-03-16 19:38:00,390 INFO L78 Accepts]: Start accepts. Automaton has 6851 states and 10662 transitions. Word has length 127 [2025-03-16 19:38:00,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:00,390 INFO L471 AbstractCegarLoop]: Abstraction has 6851 states and 10662 transitions. [2025-03-16 19:38:00,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:00,390 INFO L276 IsEmpty]: Start isEmpty. Operand 6851 states and 10662 transitions. [2025-03-16 19:38:00,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-16 19:38:00,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:00,392 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:00,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:38:00,392 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:00,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:00,393 INFO L85 PathProgramCache]: Analyzing trace with hash -168159440, now seen corresponding path program 1 times [2025-03-16 19:38:00,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:00,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241639277] [2025-03-16 19:38:00,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:00,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:00,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 19:38:00,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 19:38:00,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:00,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:00,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:00,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:00,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241639277] [2025-03-16 19:38:00,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241639277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:00,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:00,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:38:00,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329566039] [2025-03-16 19:38:00,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:00,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:38:00,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:00,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:38:00,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:38:00,492 INFO L87 Difference]: Start difference. First operand 6851 states and 10662 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:00,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:00,640 INFO L93 Difference]: Finished difference Result 13624 states and 21243 transitions. [2025-03-16 19:38:00,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:38:00,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2025-03-16 19:38:00,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:00,652 INFO L225 Difference]: With dead ends: 13624 [2025-03-16 19:38:00,652 INFO L226 Difference]: Without dead ends: 6851 [2025-03-16 19:38:00,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:38:00,660 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 809 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:00,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 196 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:38:00,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6851 states. [2025-03-16 19:38:00,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6851 to 6851. [2025-03-16 19:38:00,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6851 states, 6850 states have (on average 1.5452554744525548) internal successors, (10585), 6850 states have internal predecessors, (10585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:00,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6851 states to 6851 states and 10585 transitions. [2025-03-16 19:38:00,759 INFO L78 Accepts]: Start accepts. Automaton has 6851 states and 10585 transitions. Word has length 128 [2025-03-16 19:38:00,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:00,760 INFO L471 AbstractCegarLoop]: Abstraction has 6851 states and 10585 transitions. [2025-03-16 19:38:00,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:00,760 INFO L276 IsEmpty]: Start isEmpty. Operand 6851 states and 10585 transitions. [2025-03-16 19:38:00,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-16 19:38:00,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:00,761 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:00,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:38:00,761 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:00,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:00,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1861413186, now seen corresponding path program 1 times [2025-03-16 19:38:00,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:00,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61099762] [2025-03-16 19:38:00,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:00,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:00,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 19:38:00,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 19:38:00,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:00,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:00,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:00,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:00,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61099762] [2025-03-16 19:38:00,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61099762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:00,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:00,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:38:00,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118378175] [2025-03-16 19:38:00,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:00,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:38:00,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:00,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:38:00,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:38:00,853 INFO L87 Difference]: Start difference. First operand 6851 states and 10585 transitions. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:00,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:00,997 INFO L93 Difference]: Finished difference Result 13620 states and 21085 transitions. [2025-03-16 19:38:00,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:38:00,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2025-03-16 19:38:00,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:01,008 INFO L225 Difference]: With dead ends: 13620 [2025-03-16 19:38:01,008 INFO L226 Difference]: Without dead ends: 6851 [2025-03-16 19:38:01,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:38:01,016 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 791 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:01,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 204 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:38:01,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6851 states. [2025-03-16 19:38:01,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6851 to 6851. [2025-03-16 19:38:01,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6851 states, 6850 states have (on average 1.5340145985401459) internal successors, (10508), 6850 states have internal predecessors, (10508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:01,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6851 states to 6851 states and 10508 transitions. [2025-03-16 19:38:01,096 INFO L78 Accepts]: Start accepts. Automaton has 6851 states and 10508 transitions. Word has length 129 [2025-03-16 19:38:01,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:01,096 INFO L471 AbstractCegarLoop]: Abstraction has 6851 states and 10508 transitions. [2025-03-16 19:38:01,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:01,097 INFO L276 IsEmpty]: Start isEmpty. Operand 6851 states and 10508 transitions. [2025-03-16 19:38:01,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-16 19:38:01,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:01,098 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:01,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:38:01,099 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:01,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:01,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1297184460, now seen corresponding path program 1 times [2025-03-16 19:38:01,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:01,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416821903] [2025-03-16 19:38:01,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:01,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:01,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-16 19:38:01,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-16 19:38:01,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:01,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:01,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:01,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:01,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416821903] [2025-03-16 19:38:01,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416821903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:01,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:01,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:38:01,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921005002] [2025-03-16 19:38:01,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:01,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:38:01,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:01,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:38:01,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:38:01,234 INFO L87 Difference]: Start difference. First operand 6851 states and 10508 transitions. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:01,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:01,385 INFO L93 Difference]: Finished difference Result 13632 states and 20945 transitions. [2025-03-16 19:38:01,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:38:01,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2025-03-16 19:38:01,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:01,398 INFO L225 Difference]: With dead ends: 13632 [2025-03-16 19:38:01,398 INFO L226 Difference]: Without dead ends: 6851 [2025-03-16 19:38:01,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:38:01,408 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 819 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:01,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 180 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:38:01,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6851 states. [2025-03-16 19:38:01,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6851 to 6851. [2025-03-16 19:38:01,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6851 states, 6850 states have (on average 1.5227737226277371) internal successors, (10431), 6850 states have internal predecessors, (10431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:01,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6851 states to 6851 states and 10431 transitions. [2025-03-16 19:38:01,519 INFO L78 Accepts]: Start accepts. Automaton has 6851 states and 10431 transitions. Word has length 130 [2025-03-16 19:38:01,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:01,519 INFO L471 AbstractCegarLoop]: Abstraction has 6851 states and 10431 transitions. [2025-03-16 19:38:01,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:01,520 INFO L276 IsEmpty]: Start isEmpty. Operand 6851 states and 10431 transitions. [2025-03-16 19:38:01,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-16 19:38:01,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:01,522 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:01,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:38:01,522 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:01,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:01,523 INFO L85 PathProgramCache]: Analyzing trace with hash 931868382, now seen corresponding path program 1 times [2025-03-16 19:38:01,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:01,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995908178] [2025-03-16 19:38:01,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:01,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:01,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-16 19:38:01,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-16 19:38:01,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:01,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:01,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:01,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:01,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995908178] [2025-03-16 19:38:01,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995908178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:01,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:01,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:38:01,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970665212] [2025-03-16 19:38:01,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:01,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:38:01,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:01,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:38:01,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:38:01,626 INFO L87 Difference]: Start difference. First operand 6851 states and 10431 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:01,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:01,774 INFO L93 Difference]: Finished difference Result 13628 states and 20787 transitions. [2025-03-16 19:38:01,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:38:01,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2025-03-16 19:38:01,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:01,785 INFO L225 Difference]: With dead ends: 13628 [2025-03-16 19:38:01,785 INFO L226 Difference]: Without dead ends: 6851 [2025-03-16 19:38:01,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:38:01,793 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 801 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:01,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 188 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:38:01,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6851 states. [2025-03-16 19:38:01,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6851 to 6851. [2025-03-16 19:38:01,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6851 states, 6850 states have (on average 1.5115328467153284) internal successors, (10354), 6850 states have internal predecessors, (10354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:01,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6851 states to 6851 states and 10354 transitions. [2025-03-16 19:38:01,889 INFO L78 Accepts]: Start accepts. Automaton has 6851 states and 10354 transitions. Word has length 131 [2025-03-16 19:38:01,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:01,889 INFO L471 AbstractCegarLoop]: Abstraction has 6851 states and 10354 transitions. [2025-03-16 19:38:01,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:01,890 INFO L276 IsEmpty]: Start isEmpty. Operand 6851 states and 10354 transitions. [2025-03-16 19:38:01,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 19:38:01,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:01,892 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:01,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:38:01,892 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:01,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:01,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1223719528, now seen corresponding path program 1 times [2025-03-16 19:38:01,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:01,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908509970] [2025-03-16 19:38:01,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:01,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:01,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 19:38:01,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 19:38:01,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:01,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:01,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:01,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:01,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908509970] [2025-03-16 19:38:01,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908509970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:01,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:01,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:38:01,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893579768] [2025-03-16 19:38:01,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:01,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:38:01,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:01,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:38:01,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:38:01,990 INFO L87 Difference]: Start difference. First operand 6851 states and 10354 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:02,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:02,123 INFO L93 Difference]: Finished difference Result 13616 states and 20621 transitions. [2025-03-16 19:38:02,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:38:02,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2025-03-16 19:38:02,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:02,132 INFO L225 Difference]: With dead ends: 13616 [2025-03-16 19:38:02,132 INFO L226 Difference]: Without dead ends: 6851 [2025-03-16 19:38:02,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:38:02,139 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 759 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:02,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 212 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:38:02,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6851 states. [2025-03-16 19:38:02,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6851 to 6851. [2025-03-16 19:38:02,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6851 states, 6850 states have (on average 1.5002919708029196) internal successors, (10277), 6850 states have internal predecessors, (10277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:02,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6851 states to 6851 states and 10277 transitions. [2025-03-16 19:38:02,208 INFO L78 Accepts]: Start accepts. Automaton has 6851 states and 10277 transitions. Word has length 132 [2025-03-16 19:38:02,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:02,208 INFO L471 AbstractCegarLoop]: Abstraction has 6851 states and 10277 transitions. [2025-03-16 19:38:02,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:02,208 INFO L276 IsEmpty]: Start isEmpty. Operand 6851 states and 10277 transitions. [2025-03-16 19:38:02,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-16 19:38:02,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:02,210 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:02,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:38:02,210 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:02,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:02,211 INFO L85 PathProgramCache]: Analyzing trace with hash 2014399114, now seen corresponding path program 1 times [2025-03-16 19:38:02,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:02,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142153295] [2025-03-16 19:38:02,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:02,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:02,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-16 19:38:02,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-16 19:38:02,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:02,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:02,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:02,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:02,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142153295] [2025-03-16 19:38:02,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142153295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:02,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:02,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:38:02,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493978235] [2025-03-16 19:38:02,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:02,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:38:02,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:02,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:38:02,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:38:02,313 INFO L87 Difference]: Start difference. First operand 6851 states and 10277 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:02,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:02,465 INFO L93 Difference]: Finished difference Result 13608 states and 20459 transitions. [2025-03-16 19:38:02,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:38:02,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2025-03-16 19:38:02,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:02,473 INFO L225 Difference]: With dead ends: 13608 [2025-03-16 19:38:02,473 INFO L226 Difference]: Without dead ends: 6851 [2025-03-16 19:38:02,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:38:02,477 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 730 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:02,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 232 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:38:02,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6851 states. [2025-03-16 19:38:02,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6851 to 6851. [2025-03-16 19:38:02,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6851 states, 6850 states have (on average 1.489051094890511) internal successors, (10200), 6850 states have internal predecessors, (10200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:02,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6851 states to 6851 states and 10200 transitions. [2025-03-16 19:38:02,538 INFO L78 Accepts]: Start accepts. Automaton has 6851 states and 10200 transitions. Word has length 133 [2025-03-16 19:38:02,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:02,538 INFO L471 AbstractCegarLoop]: Abstraction has 6851 states and 10200 transitions. [2025-03-16 19:38:02,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:02,538 INFO L276 IsEmpty]: Start isEmpty. Operand 6851 states and 10200 transitions. [2025-03-16 19:38:02,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-16 19:38:02,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:02,540 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:02,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:38:02,540 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:02,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:02,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1040928416, now seen corresponding path program 1 times [2025-03-16 19:38:02,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:02,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842747016] [2025-03-16 19:38:02,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:02,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:02,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-16 19:38:02,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-16 19:38:02,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:02,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:02,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:02,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:02,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842747016] [2025-03-16 19:38:02,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842747016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:02,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:02,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:38:02,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275043581] [2025-03-16 19:38:02,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:02,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:38:02,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:02,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:38:02,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:38:02,976 INFO L87 Difference]: Start difference. First operand 6851 states and 10200 transitions. Second operand has 12 states, 12 states have (on average 11.166666666666666) internal successors, (134), 11 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:03,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:03,580 INFO L93 Difference]: Finished difference Result 20281 states and 30196 transitions. [2025-03-16 19:38:03,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 19:38:03,580 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.166666666666666) internal successors, (134), 11 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2025-03-16 19:38:03,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:03,599 INFO L225 Difference]: With dead ends: 20281 [2025-03-16 19:38:03,599 INFO L226 Difference]: Without dead ends: 13657 [2025-03-16 19:38:03,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2025-03-16 19:38:03,610 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 1042 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:03,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1042 Valid, 891 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:38:03,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13657 states. [2025-03-16 19:38:03,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13657 to 6851. [2025-03-16 19:38:03,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6851 states, 6850 states have (on average 1.4877372262773723) internal successors, (10191), 6850 states have internal predecessors, (10191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:03,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6851 states to 6851 states and 10191 transitions. [2025-03-16 19:38:03,713 INFO L78 Accepts]: Start accepts. Automaton has 6851 states and 10191 transitions. Word has length 134 [2025-03-16 19:38:03,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:03,713 INFO L471 AbstractCegarLoop]: Abstraction has 6851 states and 10191 transitions. [2025-03-16 19:38:03,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.166666666666666) internal successors, (134), 11 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:03,713 INFO L276 IsEmpty]: Start isEmpty. Operand 6851 states and 10191 transitions. [2025-03-16 19:38:03,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-16 19:38:03,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:03,714 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:03,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:38:03,715 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:03,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:03,715 INFO L85 PathProgramCache]: Analyzing trace with hash 808997472, now seen corresponding path program 1 times [2025-03-16 19:38:03,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:03,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905453097] [2025-03-16 19:38:03,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:03,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:03,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-16 19:38:03,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-16 19:38:03,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:03,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:04,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:04,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:04,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905453097] [2025-03-16 19:38:04,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905453097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:04,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:04,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:38:04,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606697133] [2025-03-16 19:38:04,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:04,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:38:04,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:04,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:38:04,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:38:04,189 INFO L87 Difference]: Start difference. First operand 6851 states and 10191 transitions. Second operand has 13 states, 13 states have (on average 10.384615384615385) internal successors, (135), 12 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:04,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:04,878 INFO L93 Difference]: Finished difference Result 20429 states and 30263 transitions. [2025-03-16 19:38:04,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 19:38:04,878 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.384615384615385) internal successors, (135), 12 states have internal predecessors, (135), 0 states have call successors, (0), 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 135 [2025-03-16 19:38:04,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:04,897 INFO L225 Difference]: With dead ends: 20429 [2025-03-16 19:38:04,897 INFO L226 Difference]: Without dead ends: 13972 [2025-03-16 19:38:04,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:38:04,906 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 1526 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:04,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 992 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:38:04,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13972 states. [2025-03-16 19:38:05,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13972 to 7035. [2025-03-16 19:38:05,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7035 states, 7034 states have (on average 1.4864941711686097) internal successors, (10456), 7034 states have internal predecessors, (10456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:05,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7035 states to 7035 states and 10456 transitions. [2025-03-16 19:38:05,024 INFO L78 Accepts]: Start accepts. Automaton has 7035 states and 10456 transitions. Word has length 135 [2025-03-16 19:38:05,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:05,024 INFO L471 AbstractCegarLoop]: Abstraction has 7035 states and 10456 transitions. [2025-03-16 19:38:05,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.384615384615385) internal successors, (135), 12 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:05,025 INFO L276 IsEmpty]: Start isEmpty. Operand 7035 states and 10456 transitions. [2025-03-16 19:38:05,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-16 19:38:05,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:05,027 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:05,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:38:05,027 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:05,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:05,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1671474840, now seen corresponding path program 1 times [2025-03-16 19:38:05,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:05,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202974983] [2025-03-16 19:38:05,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:05,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:05,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-16 19:38:05,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-16 19:38:05,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:05,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:05,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:05,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:05,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202974983] [2025-03-16 19:38:05,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202974983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:05,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:05,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:38:05,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358101606] [2025-03-16 19:38:05,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:05,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:38:05,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:05,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:38:05,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:38:05,305 INFO L87 Difference]: Start difference. First operand 7035 states and 10456 transitions. Second operand has 8 states, 8 states have (on average 16.875) internal successors, (135), 7 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:05,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:05,717 INFO L93 Difference]: Finished difference Result 20134 states and 30010 transitions. [2025-03-16 19:38:05,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:38:05,718 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.875) internal successors, (135), 7 states have internal predecessors, (135), 0 states have call successors, (0), 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 135 [2025-03-16 19:38:05,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:05,738 INFO L225 Difference]: With dead ends: 20134 [2025-03-16 19:38:05,738 INFO L226 Difference]: Without dead ends: 13479 [2025-03-16 19:38:05,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:38:05,748 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 1062 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:05,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 742 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:38:05,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13479 states. [2025-03-16 19:38:05,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13479 to 7035. [2025-03-16 19:38:05,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7035 states, 7034 states have (on average 1.486352004549332) internal successors, (10455), 7034 states have internal predecessors, (10455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:05,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7035 states to 7035 states and 10455 transitions. [2025-03-16 19:38:05,850 INFO L78 Accepts]: Start accepts. Automaton has 7035 states and 10455 transitions. Word has length 135 [2025-03-16 19:38:05,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:05,850 INFO L471 AbstractCegarLoop]: Abstraction has 7035 states and 10455 transitions. [2025-03-16 19:38:05,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.875) internal successors, (135), 7 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:05,850 INFO L276 IsEmpty]: Start isEmpty. Operand 7035 states and 10455 transitions. [2025-03-16 19:38:05,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-16 19:38:05,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:05,852 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:05,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:38:05,852 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:05,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:05,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1831876454, now seen corresponding path program 1 times [2025-03-16 19:38:05,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:05,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404787277] [2025-03-16 19:38:05,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:05,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:05,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-16 19:38:05,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-16 19:38:05,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:05,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:06,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:06,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:06,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404787277] [2025-03-16 19:38:06,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404787277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:06,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:06,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:38:06,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887236297] [2025-03-16 19:38:06,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:06,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:38:06,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:06,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:38:06,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:38:06,090 INFO L87 Difference]: Start difference. First operand 7035 states and 10455 transitions. Second operand has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 8 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:06,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:06,560 INFO L93 Difference]: Finished difference Result 20576 states and 30589 transitions. [2025-03-16 19:38:06,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:38:06,561 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 8 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2025-03-16 19:38:06,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:06,576 INFO L225 Difference]: With dead ends: 20576 [2025-03-16 19:38:06,577 INFO L226 Difference]: Without dead ends: 13919 [2025-03-16 19:38:06,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:38:06,584 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 1134 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1134 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:06,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1134 Valid, 915 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:38:06,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13919 states. [2025-03-16 19:38:06,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13919 to 7035. [2025-03-16 19:38:06,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7035 states, 7034 states have (on average 1.483508672163776) internal successors, (10435), 7034 states have internal predecessors, (10435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:06,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7035 states to 7035 states and 10435 transitions. [2025-03-16 19:38:06,676 INFO L78 Accepts]: Start accepts. Automaton has 7035 states and 10435 transitions. Word has length 136 [2025-03-16 19:38:06,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:06,676 INFO L471 AbstractCegarLoop]: Abstraction has 7035 states and 10435 transitions. [2025-03-16 19:38:06,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 8 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:06,676 INFO L276 IsEmpty]: Start isEmpty. Operand 7035 states and 10435 transitions. [2025-03-16 19:38:06,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-16 19:38:06,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:06,678 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:06,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:38:06,678 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:06,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:06,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1251863496, now seen corresponding path program 1 times [2025-03-16 19:38:06,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:06,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898015816] [2025-03-16 19:38:06,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:06,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:06,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-16 19:38:06,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-16 19:38:06,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:06,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:06,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:06,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:06,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898015816] [2025-03-16 19:38:06,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898015816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:06,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:06,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:38:06,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679382372] [2025-03-16 19:38:06,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:06,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:38:06,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:06,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:38:06,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:38:06,892 INFO L87 Difference]: Start difference. First operand 7035 states and 10435 transitions. Second operand has 9 states, 9 states have (on average 15.222222222222221) internal successors, (137), 8 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:07,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:07,331 INFO L93 Difference]: Finished difference Result 20346 states and 30192 transitions. [2025-03-16 19:38:07,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:38:07,331 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.222222222222221) internal successors, (137), 8 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-03-16 19:38:07,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:07,350 INFO L225 Difference]: With dead ends: 20346 [2025-03-16 19:38:07,351 INFO L226 Difference]: Without dead ends: 13902 [2025-03-16 19:38:07,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:38:07,359 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 1218 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1218 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:07,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1218 Valid, 797 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:38:07,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13902 states. [2025-03-16 19:38:07,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13902 to 7086. [2025-03-16 19:38:07,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7086 states, 7085 states have (on average 1.4824276640790401) internal successors, (10503), 7085 states have internal predecessors, (10503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:07,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7086 states to 7086 states and 10503 transitions. [2025-03-16 19:38:07,460 INFO L78 Accepts]: Start accepts. Automaton has 7086 states and 10503 transitions. Word has length 137 [2025-03-16 19:38:07,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:07,460 INFO L471 AbstractCegarLoop]: Abstraction has 7086 states and 10503 transitions. [2025-03-16 19:38:07,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.222222222222221) internal successors, (137), 8 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:07,460 INFO L276 IsEmpty]: Start isEmpty. Operand 7086 states and 10503 transitions. [2025-03-16 19:38:07,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-16 19:38:07,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:07,462 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:07,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:38:07,462 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:07,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:07,463 INFO L85 PathProgramCache]: Analyzing trace with hash -670419753, now seen corresponding path program 1 times [2025-03-16 19:38:07,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:07,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777443087] [2025-03-16 19:38:07,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:07,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:07,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-16 19:38:07,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-16 19:38:07,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:07,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:07,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:07,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:07,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777443087] [2025-03-16 19:38:07,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777443087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:07,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:07,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:38:07,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645564653] [2025-03-16 19:38:07,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:07,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:38:07,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:07,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:38:07,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:38:07,677 INFO L87 Difference]: Start difference. First operand 7086 states and 10503 transitions. Second operand has 9 states, 9 states have (on average 15.333333333333334) internal successors, (138), 8 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:08,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:08,208 INFO L93 Difference]: Finished difference Result 20774 states and 30829 transitions. [2025-03-16 19:38:08,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:38:08,208 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.333333333333334) internal successors, (138), 8 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2025-03-16 19:38:08,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:08,223 INFO L225 Difference]: With dead ends: 20774 [2025-03-16 19:38:08,223 INFO L226 Difference]: Without dead ends: 13952 [2025-03-16 19:38:08,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:38:08,229 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 673 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:08,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 1176 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:38:08,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13952 states. [2025-03-16 19:38:08,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13952 to 7086. [2025-03-16 19:38:08,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7086 states, 7085 states have (on average 1.4811573747353564) internal successors, (10494), 7085 states have internal predecessors, (10494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:08,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7086 states to 7086 states and 10494 transitions. [2025-03-16 19:38:08,377 INFO L78 Accepts]: Start accepts. Automaton has 7086 states and 10494 transitions. Word has length 138 [2025-03-16 19:38:08,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:08,377 INFO L471 AbstractCegarLoop]: Abstraction has 7086 states and 10494 transitions. [2025-03-16 19:38:08,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.333333333333334) internal successors, (138), 8 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:08,377 INFO L276 IsEmpty]: Start isEmpty. Operand 7086 states and 10494 transitions. [2025-03-16 19:38:08,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-16 19:38:08,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:08,379 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:08,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 19:38:08,380 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:08,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:08,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1259614539, now seen corresponding path program 1 times [2025-03-16 19:38:08,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:08,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790449036] [2025-03-16 19:38:08,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:08,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:08,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-16 19:38:08,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-16 19:38:08,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:08,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:08,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:08,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:08,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790449036] [2025-03-16 19:38:08,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790449036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:08,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:08,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:38:08,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019947864] [2025-03-16 19:38:08,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:08,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:38:08,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:08,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:38:08,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:38:08,650 INFO L87 Difference]: Start difference. First operand 7086 states and 10494 transitions. Second operand has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 8 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:09,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:09,091 INFO L93 Difference]: Finished difference Result 20542 states and 30468 transitions. [2025-03-16 19:38:09,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:38:09,091 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 8 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-03-16 19:38:09,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:09,104 INFO L225 Difference]: With dead ends: 20542 [2025-03-16 19:38:09,105 INFO L226 Difference]: Without dead ends: 13940 [2025-03-16 19:38:09,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:38:09,112 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 1117 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:09,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1117 Valid, 906 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:38:09,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13940 states. [2025-03-16 19:38:09,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13940 to 7086. [2025-03-16 19:38:09,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7086 states, 7085 states have (on average 1.4777699364855328) internal successors, (10470), 7085 states have internal predecessors, (10470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:09,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7086 states to 7086 states and 10470 transitions. [2025-03-16 19:38:09,247 INFO L78 Accepts]: Start accepts. Automaton has 7086 states and 10470 transitions. Word has length 139 [2025-03-16 19:38:09,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:09,248 INFO L471 AbstractCegarLoop]: Abstraction has 7086 states and 10470 transitions. [2025-03-16 19:38:09,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.444444444444445) internal successors, (139), 8 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:09,248 INFO L276 IsEmpty]: Start isEmpty. Operand 7086 states and 10470 transitions. [2025-03-16 19:38:09,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-16 19:38:09,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:09,249 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:09,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 19:38:09,251 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:09,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:09,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1524858479, now seen corresponding path program 1 times [2025-03-16 19:38:09,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:09,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34097637] [2025-03-16 19:38:09,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:09,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:09,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-16 19:38:09,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-16 19:38:09,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:09,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:09,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:09,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:09,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34097637] [2025-03-16 19:38:09,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34097637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:09,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:09,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:38:09,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314869444] [2025-03-16 19:38:09,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:09,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:38:09,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:09,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:38:09,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:38:09,474 INFO L87 Difference]: Start difference. First operand 7086 states and 10470 transitions. Second operand has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 8 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:10,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:10,055 INFO L93 Difference]: Finished difference Result 20344 states and 30147 transitions. [2025-03-16 19:38:10,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:38:10,056 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 8 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2025-03-16 19:38:10,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:10,071 INFO L225 Difference]: With dead ends: 20344 [2025-03-16 19:38:10,071 INFO L226 Difference]: Without dead ends: 13840 [2025-03-16 19:38:10,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:38:10,079 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 609 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:10,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 1180 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:38:10,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13840 states. [2025-03-16 19:38:10,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13840 to 6902. [2025-03-16 19:38:10,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6902 states, 6901 states have (on average 1.4799304448630632) internal successors, (10213), 6901 states have internal predecessors, (10213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:10,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6902 states to 6902 states and 10213 transitions. [2025-03-16 19:38:10,165 INFO L78 Accepts]: Start accepts. Automaton has 6902 states and 10213 transitions. Word has length 140 [2025-03-16 19:38:10,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:10,165 INFO L471 AbstractCegarLoop]: Abstraction has 6902 states and 10213 transitions. [2025-03-16 19:38:10,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 8 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:10,165 INFO L276 IsEmpty]: Start isEmpty. Operand 6902 states and 10213 transitions. [2025-03-16 19:38:10,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-16 19:38:10,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:10,166 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:10,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 19:38:10,166 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:10,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:10,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1644471321, now seen corresponding path program 1 times [2025-03-16 19:38:10,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:10,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311661218] [2025-03-16 19:38:10,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:10,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:10,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-16 19:38:10,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-16 19:38:10,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:10,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:10,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-03-16 19:38:10,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:10,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311661218] [2025-03-16 19:38:10,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311661218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:10,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:10,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:38:10,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494053038] [2025-03-16 19:38:10,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:10,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:38:10,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:10,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:38:10,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:38:10,497 INFO L87 Difference]: Start difference. First operand 6902 states and 10213 transitions. Second operand has 11 states, 11 states have (on average 12.727272727272727) internal successors, (140), 10 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:11,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:11,376 INFO L93 Difference]: Finished difference Result 17256 states and 25525 transitions. [2025-03-16 19:38:11,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:38:11,376 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 12.727272727272727) internal successors, (140), 10 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2025-03-16 19:38:11,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:11,384 INFO L225 Difference]: With dead ends: 17256 [2025-03-16 19:38:11,384 INFO L226 Difference]: Without dead ends: 10542 [2025-03-16 19:38:11,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:38:11,390 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 1130 mSDsluCounter, 1666 mSDsCounter, 0 mSdLazyCounter, 1775 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1130 SdHoareTripleChecker+Valid, 2028 SdHoareTripleChecker+Invalid, 1784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:11,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1130 Valid, 2028 Invalid, 1784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1775 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:38:11,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10542 states. [2025-03-16 19:38:11,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10542 to 6902. [2025-03-16 19:38:11,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6902 states, 6901 states have (on average 1.4794957252572092) internal successors, (10210), 6901 states have internal predecessors, (10210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:11,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6902 states to 6902 states and 10210 transitions. [2025-03-16 19:38:11,458 INFO L78 Accepts]: Start accepts. Automaton has 6902 states and 10210 transitions. Word has length 140 [2025-03-16 19:38:11,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:11,458 INFO L471 AbstractCegarLoop]: Abstraction has 6902 states and 10210 transitions. [2025-03-16 19:38:11,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.727272727272727) internal successors, (140), 10 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:11,458 INFO L276 IsEmpty]: Start isEmpty. Operand 6902 states and 10210 transitions. [2025-03-16 19:38:11,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 19:38:11,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:11,459 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:11,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 19:38:11,460 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:11,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:11,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1502468893, now seen corresponding path program 1 times [2025-03-16 19:38:11,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:11,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563920221] [2025-03-16 19:38:11,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:11,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:11,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 19:38:11,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 19:38:11,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:11,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38: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-03-16 19:38:12,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:12,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563920221] [2025-03-16 19:38:12,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563920221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:12,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:12,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 19:38:12,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525187506] [2025-03-16 19:38:12,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:12,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 19:38:12,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:12,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 19:38:12,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:38:12,033 INFO L87 Difference]: Start difference. First operand 6902 states and 10210 transitions. Second operand has 14 states, 14 states have (on average 10.071428571428571) internal successors, (141), 13 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:12,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:12,807 INFO L93 Difference]: Finished difference Result 28249 states and 41990 transitions. [2025-03-16 19:38:12,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:38:12,809 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.071428571428571) internal successors, (141), 13 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2025-03-16 19:38:12,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:12,837 INFO L225 Difference]: With dead ends: 28249 [2025-03-16 19:38:12,837 INFO L226 Difference]: Without dead ends: 26815 [2025-03-16 19:38:12,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-03-16 19:38:12,847 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 1250 mSDsluCounter, 5233 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1250 SdHoareTripleChecker+Valid, 5937 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:12,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1250 Valid, 5937 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:38:12,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26815 states. [2025-03-16 19:38:13,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26815 to 6864. [2025-03-16 19:38:13,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6864 states, 6863 states have (on average 1.4787993588809558) internal successors, (10149), 6863 states have internal predecessors, (10149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:13,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6864 states to 6864 states and 10149 transitions. [2025-03-16 19:38:13,041 INFO L78 Accepts]: Start accepts. Automaton has 6864 states and 10149 transitions. Word has length 141 [2025-03-16 19:38:13,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:13,041 INFO L471 AbstractCegarLoop]: Abstraction has 6864 states and 10149 transitions. [2025-03-16 19:38:13,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.071428571428571) internal successors, (141), 13 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:13,041 INFO L276 IsEmpty]: Start isEmpty. Operand 6864 states and 10149 transitions. [2025-03-16 19:38:13,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 19:38:13,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:13,042 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:13,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 19:38:13,043 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:13,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:13,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1214528995, now seen corresponding path program 1 times [2025-03-16 19:38:13,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:13,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472877998] [2025-03-16 19:38:13,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:13,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:13,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 19:38:13,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 19:38:13,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:13,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:13,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:13,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:13,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472877998] [2025-03-16 19:38:13,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472877998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:13,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:13,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:38:13,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698100568] [2025-03-16 19:38:13,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:13,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:38:13,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:13,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:38:13,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:38:13,575 INFO L87 Difference]: Start difference. First operand 6864 states and 10149 transitions. Second operand has 13 states, 13 states have (on average 10.846153846153847) internal successors, (141), 12 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:14,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:14,087 INFO L93 Difference]: Finished difference Result 14891 states and 22103 transitions. [2025-03-16 19:38:14,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 19:38:14,088 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.846153846153847) internal successors, (141), 12 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2025-03-16 19:38:14,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:14,101 INFO L225 Difference]: With dead ends: 14891 [2025-03-16 19:38:14,102 INFO L226 Difference]: Without dead ends: 13477 [2025-03-16 19:38:14,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:38:14,106 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 1028 mSDsluCounter, 2377 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 2770 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:14,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1028 Valid, 2770 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:38:14,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13477 states. [2025-03-16 19:38:14,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13477 to 6836. [2025-03-16 19:38:14,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6836 states, 6835 states have (on average 1.4779809802487198) internal successors, (10102), 6835 states have internal predecessors, (10102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:14,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6836 states to 6836 states and 10102 transitions. [2025-03-16 19:38:14,208 INFO L78 Accepts]: Start accepts. Automaton has 6836 states and 10102 transitions. Word has length 141 [2025-03-16 19:38:14,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:14,208 INFO L471 AbstractCegarLoop]: Abstraction has 6836 states and 10102 transitions. [2025-03-16 19:38:14,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.846153846153847) internal successors, (141), 12 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:14,209 INFO L276 IsEmpty]: Start isEmpty. Operand 6836 states and 10102 transitions. [2025-03-16 19:38:14,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 19:38:14,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:14,209 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:14,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 19:38:14,210 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:14,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:14,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1211913992, now seen corresponding path program 1 times [2025-03-16 19:38:14,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:14,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81754530] [2025-03-16 19:38:14,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:14,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:14,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 19:38:14,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 19:38:14,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:14,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:14,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-03-16 19:38:14,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:14,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81754530] [2025-03-16 19:38:14,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81754530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:14,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:14,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:38:14,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959192936] [2025-03-16 19:38:14,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:14,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:38:14,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:14,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:38:14,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:38:14,666 INFO L87 Difference]: Start difference. First operand 6836 states and 10102 transitions. Second operand has 13 states, 13 states have (on average 10.846153846153847) internal successors, (141), 12 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:15,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:15,165 INFO L93 Difference]: Finished difference Result 14850 states and 22045 transitions. [2025-03-16 19:38:15,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 19:38:15,165 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.846153846153847) internal successors, (141), 12 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2025-03-16 19:38:15,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:15,179 INFO L225 Difference]: With dead ends: 14850 [2025-03-16 19:38:15,179 INFO L226 Difference]: Without dead ends: 13492 [2025-03-16 19:38:15,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:38:15,185 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 1503 mSDsluCounter, 1827 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 2097 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:15,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 2097 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:38:15,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13492 states. [2025-03-16 19:38:15,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13492 to 6862. [2025-03-16 19:38:15,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6862 states, 6861 states have (on average 1.4780644220959045) internal successors, (10141), 6861 states have internal predecessors, (10141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:15,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6862 states to 6862 states and 10141 transitions. [2025-03-16 19:38:15,278 INFO L78 Accepts]: Start accepts. Automaton has 6862 states and 10141 transitions. Word has length 141 [2025-03-16 19:38:15,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:15,278 INFO L471 AbstractCegarLoop]: Abstraction has 6862 states and 10141 transitions. [2025-03-16 19:38:15,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.846153846153847) internal successors, (141), 12 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:15,278 INFO L276 IsEmpty]: Start isEmpty. Operand 6862 states and 10141 transitions. [2025-03-16 19:38:15,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 19:38:15,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:15,279 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:15,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 19:38:15,279 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:15,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:15,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1632294627, now seen corresponding path program 1 times [2025-03-16 19:38:15,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:15,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535158188] [2025-03-16 19:38:15,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:15,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:15,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 19:38:15,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 19:38:15,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:15,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:15,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:15,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:15,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535158188] [2025-03-16 19:38:15,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535158188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:15,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:15,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:38:15,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634367364] [2025-03-16 19:38:15,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:15,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:38:15,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:15,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:38:15,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:38:15,704 INFO L87 Difference]: Start difference. First operand 6862 states and 10141 transitions. Second operand has 13 states, 13 states have (on average 10.846153846153847) internal successors, (141), 12 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:16,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:16,136 INFO L93 Difference]: Finished difference Result 14842 states and 22033 transitions. [2025-03-16 19:38:16,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 19:38:16,137 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.846153846153847) internal successors, (141), 12 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2025-03-16 19:38:16,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:16,151 INFO L225 Difference]: With dead ends: 14842 [2025-03-16 19:38:16,151 INFO L226 Difference]: Without dead ends: 13440 [2025-03-16 19:38:16,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:38:16,158 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 1212 mSDsluCounter, 2550 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 2935 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:16,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 2935 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:38:16,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13440 states. [2025-03-16 19:38:16,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13440 to 6840. [2025-03-16 19:38:16,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6840 states, 6839 states have (on average 1.4771165375054833) internal successors, (10102), 6839 states have internal predecessors, (10102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:16,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6840 states to 6840 states and 10102 transitions. [2025-03-16 19:38:16,246 INFO L78 Accepts]: Start accepts. Automaton has 6840 states and 10102 transitions. Word has length 141 [2025-03-16 19:38:16,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:16,246 INFO L471 AbstractCegarLoop]: Abstraction has 6840 states and 10102 transitions. [2025-03-16 19:38:16,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.846153846153847) internal successors, (141), 12 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:16,246 INFO L276 IsEmpty]: Start isEmpty. Operand 6840 states and 10102 transitions. [2025-03-16 19:38:16,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 19:38:16,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:16,247 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:16,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-16 19:38:16,247 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:16,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:16,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1164092837, now seen corresponding path program 1 times [2025-03-16 19:38:16,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:16,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604806412] [2025-03-16 19:38:16,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:16,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:16,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 19:38:16,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 19:38:16,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:16,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:16,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:16,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:16,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604806412] [2025-03-16 19:38:16,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604806412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:16,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:16,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:38:16,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275721313] [2025-03-16 19:38:16,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:16,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:38:16,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:16,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:38:16,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:38:16,690 INFO L87 Difference]: Start difference. First operand 6840 states and 10102 transitions. Second operand has 13 states, 13 states have (on average 10.846153846153847) internal successors, (141), 12 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:17,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:17,221 INFO L93 Difference]: Finished difference Result 14785 states and 21935 transitions. [2025-03-16 19:38:17,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 19:38:17,222 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.846153846153847) internal successors, (141), 12 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2025-03-16 19:38:17,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:17,236 INFO L225 Difference]: With dead ends: 14785 [2025-03-16 19:38:17,236 INFO L226 Difference]: Without dead ends: 13323 [2025-03-16 19:38:17,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:38:17,243 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 1277 mSDsluCounter, 2203 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 2497 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:17,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1277 Valid, 2497 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:38:17,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13323 states. [2025-03-16 19:38:17,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13323 to 6768. [2025-03-16 19:38:17,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6768 states, 6767 states have (on average 1.4784985961282695) internal successors, (10005), 6767 states have internal predecessors, (10005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:17,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6768 states to 6768 states and 10005 transitions. [2025-03-16 19:38:17,334 INFO L78 Accepts]: Start accepts. Automaton has 6768 states and 10005 transitions. Word has length 141 [2025-03-16 19:38:17,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:17,334 INFO L471 AbstractCegarLoop]: Abstraction has 6768 states and 10005 transitions. [2025-03-16 19:38:17,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.846153846153847) internal successors, (141), 12 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:17,334 INFO L276 IsEmpty]: Start isEmpty. Operand 6768 states and 10005 transitions. [2025-03-16 19:38:17,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 19:38:17,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:17,335 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:17,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-16 19:38:17,335 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:17,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:17,335 INFO L85 PathProgramCache]: Analyzing trace with hash -371929987, now seen corresponding path program 1 times [2025-03-16 19:38:17,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:17,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170384595] [2025-03-16 19:38:17,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:17,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:17,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 19:38:17,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 19:38:17,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:17,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:18,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:18,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:18,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170384595] [2025-03-16 19:38:18,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170384595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:18,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:18,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-16 19:38:18,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826702166] [2025-03-16 19:38:18,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:18,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-16 19:38:18,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:18,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-16 19:38:18,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:38:18,260 INFO L87 Difference]: Start difference. First operand 6768 states and 10005 transitions. Second operand has 19 states, 19 states have (on average 7.421052631578948) internal successors, (141), 18 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:19,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:19,372 INFO L93 Difference]: Finished difference Result 15451 states and 22920 transitions. [2025-03-16 19:38:19,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-16 19:38:19,373 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.421052631578948) internal successors, (141), 18 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2025-03-16 19:38:19,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:19,409 INFO L225 Difference]: With dead ends: 15451 [2025-03-16 19:38:19,409 INFO L226 Difference]: Without dead ends: 14009 [2025-03-16 19:38:19,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=288, Invalid=1118, Unknown=0, NotChecked=0, Total=1406 [2025-03-16 19:38:19,412 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 1368 mSDsluCounter, 5468 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1368 SdHoareTripleChecker+Valid, 6021 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:19,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1368 Valid, 6021 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:38:19,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14009 states. [2025-03-16 19:38:19,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14009 to 6768. [2025-03-16 19:38:19,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6768 states, 6767 states have (on average 1.4780552682133885) internal successors, (10002), 6767 states have internal predecessors, (10002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:19,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6768 states to 6768 states and 10002 transitions. [2025-03-16 19:38:19,508 INFO L78 Accepts]: Start accepts. Automaton has 6768 states and 10002 transitions. Word has length 141 [2025-03-16 19:38:19,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:19,508 INFO L471 AbstractCegarLoop]: Abstraction has 6768 states and 10002 transitions. [2025-03-16 19:38:19,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.421052631578948) internal successors, (141), 18 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:19,508 INFO L276 IsEmpty]: Start isEmpty. Operand 6768 states and 10002 transitions. [2025-03-16 19:38:19,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-16 19:38:19,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:19,509 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:19,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-16 19:38:19,509 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:19,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:19,510 INFO L85 PathProgramCache]: Analyzing trace with hash 682084181, now seen corresponding path program 1 times [2025-03-16 19:38:19,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:19,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838743253] [2025-03-16 19:38:19,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:19,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:19,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-16 19:38:19,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-16 19:38:19,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:19,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:19,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:19,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:19,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838743253] [2025-03-16 19:38:19,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838743253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:19,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:19,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:38:19,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847524891] [2025-03-16 19:38:19,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:19,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:38:19,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:19,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:38:19,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:38:19,995 INFO L87 Difference]: Start difference. First operand 6768 states and 10002 transitions. Second operand has 12 states, 12 states have (on average 11.75) internal successors, (141), 11 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:20,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:20,379 INFO L93 Difference]: Finished difference Result 14576 states and 21658 transitions. [2025-03-16 19:38:20,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:38:20,379 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.75) internal successors, (141), 11 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2025-03-16 19:38:20,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:20,393 INFO L225 Difference]: With dead ends: 14576 [2025-03-16 19:38:20,406 INFO L226 Difference]: Without dead ends: 13151 [2025-03-16 19:38:20,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2025-03-16 19:38:20,409 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 793 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 2051 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:20,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 2051 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:38:20,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13151 states. [2025-03-16 19:38:20,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13151 to 6707. [2025-03-16 19:38:20,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6707 states, 6706 states have (on average 1.4800178944229048) internal successors, (9925), 6706 states have internal predecessors, (9925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:20,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6707 states to 6707 states and 9925 transitions. [2025-03-16 19:38:20,476 INFO L78 Accepts]: Start accepts. Automaton has 6707 states and 9925 transitions. Word has length 141 [2025-03-16 19:38:20,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:20,477 INFO L471 AbstractCegarLoop]: Abstraction has 6707 states and 9925 transitions. [2025-03-16 19:38:20,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.75) internal successors, (141), 11 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:20,477 INFO L276 IsEmpty]: Start isEmpty. Operand 6707 states and 9925 transitions. [2025-03-16 19:38:20,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-16 19:38:20,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:20,477 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:20,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-16 19:38:20,477 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:20,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:20,478 INFO L85 PathProgramCache]: Analyzing trace with hash 729572635, now seen corresponding path program 1 times [2025-03-16 19:38:20,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:20,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565049975] [2025-03-16 19:38:20,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:20,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:20,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-16 19:38:20,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-16 19:38:20,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:20,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:20,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:20,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:20,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565049975] [2025-03-16 19:38:20,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565049975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:20,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:20,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:38:20,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379385680] [2025-03-16 19:38:20,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:20,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:38:20,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:20,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:38:20,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:38:20,613 INFO L87 Difference]: Start difference. First operand 6707 states and 9925 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:20,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:20,674 INFO L93 Difference]: Finished difference Result 15993 states and 23798 transitions. [2025-03-16 19:38:20,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:38:20,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2025-03-16 19:38:20,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:20,684 INFO L225 Difference]: With dead ends: 15993 [2025-03-16 19:38:20,685 INFO L226 Difference]: Without dead ends: 9549 [2025-03-16 19:38:20,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:38:20,692 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 134 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:20,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 678 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:20,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9549 states. [2025-03-16 19:38:20,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9549 to 9513. [2025-03-16 19:38:20,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9513 states, 9512 states have (on average 1.4779226240538268) internal successors, (14058), 9512 states have internal predecessors, (14058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:20,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9513 states to 9513 states and 14058 transitions. [2025-03-16 19:38:20,806 INFO L78 Accepts]: Start accepts. Automaton has 9513 states and 14058 transitions. Word has length 142 [2025-03-16 19:38:20,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:20,806 INFO L471 AbstractCegarLoop]: Abstraction has 9513 states and 14058 transitions. [2025-03-16 19:38:20,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:20,806 INFO L276 IsEmpty]: Start isEmpty. Operand 9513 states and 14058 transitions. [2025-03-16 19:38:20,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-16 19:38:20,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:20,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:20,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-16 19:38:20,807 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:20,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:20,807 INFO L85 PathProgramCache]: Analyzing trace with hash 761776706, now seen corresponding path program 1 times [2025-03-16 19:38:20,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:20,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412226215] [2025-03-16 19:38:20,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:20,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:20,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-16 19:38:20,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-16 19:38:20,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:20,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:20,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:20,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:20,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412226215] [2025-03-16 19:38:20,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412226215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:20,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:20,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:38:20,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226284321] [2025-03-16 19:38:20,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:20,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:38:20,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:20,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:38:20,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:38:20,969 INFO L87 Difference]: Start difference. First operand 9513 states and 14058 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:21,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:21,025 INFO L93 Difference]: Finished difference Result 9551 states and 14113 transitions. [2025-03-16 19:38:21,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:38:21,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2025-03-16 19:38:21,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:21,035 INFO L225 Difference]: With dead ends: 9551 [2025-03-16 19:38:21,035 INFO L226 Difference]: Without dead ends: 9549 [2025-03-16 19:38:21,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:38:21,038 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 0 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:21,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1109 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:21,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9549 states. [2025-03-16 19:38:21,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9549 to 9549. [2025-03-16 19:38:21,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9549 states, 9548 states have (on average 1.4721407624633431) internal successors, (14056), 9548 states have internal predecessors, (14056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:21,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9549 states to 9549 states and 14056 transitions. [2025-03-16 19:38:21,133 INFO L78 Accepts]: Start accepts. Automaton has 9549 states and 14056 transitions. Word has length 142 [2025-03-16 19:38:21,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:21,133 INFO L471 AbstractCegarLoop]: Abstraction has 9549 states and 14056 transitions. [2025-03-16 19:38:21,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:21,134 INFO L276 IsEmpty]: Start isEmpty. Operand 9549 states and 14056 transitions. [2025-03-16 19:38:21,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-16 19:38:21,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:21,134 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:21,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-16 19:38:21,134 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:21,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:21,135 INFO L85 PathProgramCache]: Analyzing trace with hash 572321005, now seen corresponding path program 1 times [2025-03-16 19:38:21,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:21,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876873493] [2025-03-16 19:38:21,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:21,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:21,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-16 19:38:21,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-16 19:38:21,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:21,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:24,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:24,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:24,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876873493] [2025-03-16 19:38:24,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876873493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:24,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:24,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2025-03-16 19:38:24,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254628620] [2025-03-16 19:38:24,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:24,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-16 19:38:24,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:24,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-16 19:38:24,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=2425, Unknown=0, NotChecked=0, Total=2550 [2025-03-16 19:38:24,910 INFO L87 Difference]: Start difference. First operand 9549 states and 14056 transitions. Second operand has 51 states, 51 states have (on average 2.784313725490196) internal successors, (142), 50 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:33,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:33,149 INFO L93 Difference]: Finished difference Result 20591 states and 30399 transitions. [2025-03-16 19:38:33,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-16 19:38:33,149 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.784313725490196) internal successors, (142), 50 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2025-03-16 19:38:33,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:33,166 INFO L225 Difference]: With dead ends: 20591 [2025-03-16 19:38:33,166 INFO L226 Difference]: Without dead ends: 18895 [2025-03-16 19:38:33,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1264 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1108, Invalid=8012, Unknown=0, NotChecked=0, Total=9120 [2025-03-16 19:38:33,174 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 1296 mSDsluCounter, 10056 mSDsCounter, 0 mSdLazyCounter, 7212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1296 SdHoareTripleChecker+Valid, 10365 SdHoareTripleChecker+Invalid, 7212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:33,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1296 Valid, 10365 Invalid, 7212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7212 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-16 19:38:33,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18895 states. [2025-03-16 19:38:33,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18895 to 9575. [2025-03-16 19:38:33,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9575 states, 9574 states have (on average 1.4715897221641947) internal successors, (14089), 9574 states have internal predecessors, (14089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:33,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9575 states to 9575 states and 14089 transitions. [2025-03-16 19:38:33,287 INFO L78 Accepts]: Start accepts. Automaton has 9575 states and 14089 transitions. Word has length 142 [2025-03-16 19:38:33,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:33,287 INFO L471 AbstractCegarLoop]: Abstraction has 9575 states and 14089 transitions. [2025-03-16 19:38:33,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.784313725490196) internal successors, (142), 50 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:33,288 INFO L276 IsEmpty]: Start isEmpty. Operand 9575 states and 14089 transitions. [2025-03-16 19:38:33,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-16 19:38:33,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:33,288 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:33,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-16 19:38:33,288 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:33,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:33,289 INFO L85 PathProgramCache]: Analyzing trace with hash -721329683, now seen corresponding path program 1 times [2025-03-16 19:38:33,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:33,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597108783] [2025-03-16 19:38:33,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:33,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:33,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-16 19:38:33,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-16 19:38:33,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:33,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:33,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:33,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:33,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597108783] [2025-03-16 19:38:33,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597108783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:33,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:33,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:38:33,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722883923] [2025-03-16 19:38:33,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:33,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:38:33,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:33,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:38:33,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:33,353 INFO L87 Difference]: Start difference. First operand 9575 states and 14089 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:33,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:33,404 INFO L93 Difference]: Finished difference Result 27707 states and 41039 transitions. [2025-03-16 19:38:33,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:38:33,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2025-03-16 19:38:33,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:33,423 INFO L225 Difference]: With dead ends: 27707 [2025-03-16 19:38:33,423 INFO L226 Difference]: Without dead ends: 18421 [2025-03-16 19:38:33,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:38:33,434 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 145 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:33,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 632 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:38:33,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18421 states. [2025-03-16 19:38:33,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18421 to 17979. [2025-03-16 19:38:33,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17979 states, 17978 states have (on average 1.4684058293469797) internal successors, (26399), 17978 states have internal predecessors, (26399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:33,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17979 states to 17979 states and 26399 transitions. [2025-03-16 19:38:33,617 INFO L78 Accepts]: Start accepts. Automaton has 17979 states and 26399 transitions. Word has length 142 [2025-03-16 19:38:33,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:33,617 INFO L471 AbstractCegarLoop]: Abstraction has 17979 states and 26399 transitions. [2025-03-16 19:38:33,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:33,617 INFO L276 IsEmpty]: Start isEmpty. Operand 17979 states and 26399 transitions. [2025-03-16 19:38:33,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-16 19:38:33,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:33,618 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:33,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-16 19:38:33,618 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:33,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:33,619 INFO L85 PathProgramCache]: Analyzing trace with hash 840162549, now seen corresponding path program 1 times [2025-03-16 19:38:33,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:33,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794837665] [2025-03-16 19:38:33,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:33,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:33,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-16 19:38:33,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-16 19:38:33,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:33,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:34,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:34,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:34,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794837665] [2025-03-16 19:38:34,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794837665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:34,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:34,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:38:34,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711669928] [2025-03-16 19:38:34,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:34,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:38:34,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:34,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:38:34,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:38:34,056 INFO L87 Difference]: Start difference. First operand 17979 states and 26399 transitions. Second operand has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 12 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:34,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:34,426 INFO L93 Difference]: Finished difference Result 21837 states and 32092 transitions. [2025-03-16 19:38:34,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:38:34,426 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 12 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2025-03-16 19:38:34,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:34,443 INFO L225 Difference]: With dead ends: 21837 [2025-03-16 19:38:34,443 INFO L226 Difference]: Without dead ends: 17905 [2025-03-16 19:38:34,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:38:34,450 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 638 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 1759 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:34,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 1759 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:38:34,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17905 states. [2025-03-16 19:38:34,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17905 to 17905. [2025-03-16 19:38:34,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17905 states, 17904 states have (on average 1.4694481680071492) internal successors, (26309), 17904 states have internal predecessors, (26309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:34,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17905 states to 17905 states and 26309 transitions. [2025-03-16 19:38:34,678 INFO L78 Accepts]: Start accepts. Automaton has 17905 states and 26309 transitions. Word has length 142 [2025-03-16 19:38:34,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:34,678 INFO L471 AbstractCegarLoop]: Abstraction has 17905 states and 26309 transitions. [2025-03-16 19:38:34,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 12 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:34,678 INFO L276 IsEmpty]: Start isEmpty. Operand 17905 states and 26309 transitions. [2025-03-16 19:38:34,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-16 19:38:34,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:34,679 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:34,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-16 19:38:34,679 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:34,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:34,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1079614513, now seen corresponding path program 1 times [2025-03-16 19:38:34,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:34,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215982510] [2025-03-16 19:38:34,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:34,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:34,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-16 19:38:34,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-16 19:38:34,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:34,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:35,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:35,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:35,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215982510] [2025-03-16 19:38:35,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215982510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:35,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:35,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 19:38:35,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926741094] [2025-03-16 19:38:35,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:35,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 19:38:35,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:35,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 19:38:35,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:38:35,177 INFO L87 Difference]: Start difference. First operand 17905 states and 26309 transitions. Second operand has 14 states, 14 states have (on average 10.214285714285714) internal successors, (143), 13 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:35,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:35,881 INFO L93 Difference]: Finished difference Result 74879 states and 110265 transitions. [2025-03-16 19:38:35,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:38:35,882 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.214285714285714) internal successors, (143), 13 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2025-03-16 19:38:35,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:35,962 INFO L225 Difference]: With dead ends: 74879 [2025-03-16 19:38:35,963 INFO L226 Difference]: Without dead ends: 71004 [2025-03-16 19:38:35,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-03-16 19:38:35,989 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 1162 mSDsluCounter, 4669 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1162 SdHoareTripleChecker+Valid, 5309 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:35,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1162 Valid, 5309 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:38:36,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71004 states. [2025-03-16 19:38:36,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71004 to 17867. [2025-03-16 19:38:36,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17867 states, 17866 states have (on average 1.4698869360797044) internal successors, (26261), 17866 states have internal predecessors, (26261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:36,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17867 states to 17867 states and 26261 transitions. [2025-03-16 19:38:36,399 INFO L78 Accepts]: Start accepts. Automaton has 17867 states and 26261 transitions. Word has length 143 [2025-03-16 19:38:36,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:36,399 INFO L471 AbstractCegarLoop]: Abstraction has 17867 states and 26261 transitions. [2025-03-16 19:38:36,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.214285714285714) internal successors, (143), 13 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:36,399 INFO L276 IsEmpty]: Start isEmpty. Operand 17867 states and 26261 transitions. [2025-03-16 19:38:36,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-16 19:38:36,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:36,402 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:36,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-16 19:38:36,402 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:36,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:36,402 INFO L85 PathProgramCache]: Analyzing trace with hash 343020951, now seen corresponding path program 1 times [2025-03-16 19:38:36,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:36,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354382353] [2025-03-16 19:38:36,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:36,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:36,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-16 19:38:36,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-16 19:38:36,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:36,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:36,502 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:36,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:36,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354382353] [2025-03-16 19:38:36,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354382353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:36,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:36,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:38:36,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490067978] [2025-03-16 19:38:36,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:36,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:38:36,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:36,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:38:36,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:38:36,503 INFO L87 Difference]: Start difference. First operand 17867 states and 26261 transitions. Second operand has 7 states, 7 states have (on average 26.0) internal successors, (182), 6 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:36,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:36,924 INFO L93 Difference]: Finished difference Result 61633 states and 91158 transitions. [2025-03-16 19:38:36,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:38:36,925 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.0) internal successors, (182), 6 states have internal predecessors, (182), 0 states have call successors, (0), 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 182 [2025-03-16 19:38:36,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:36,969 INFO L225 Difference]: With dead ends: 61633 [2025-03-16 19:38:36,969 INFO L226 Difference]: Without dead ends: 43943 [2025-03-16 19:38:36,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:38:36,978 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 1214 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:36,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1214 Valid, 725 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:38:36,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43943 states. [2025-03-16 19:38:37,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43943 to 26149. [2025-03-16 19:38:37,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26149 states, 26148 states have (on average 1.471087654887563) internal successors, (38466), 26148 states have internal predecessors, (38466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:37,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26149 states to 26149 states and 38466 transitions. [2025-03-16 19:38:37,286 INFO L78 Accepts]: Start accepts. Automaton has 26149 states and 38466 transitions. Word has length 182 [2025-03-16 19:38:37,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:37,286 INFO L471 AbstractCegarLoop]: Abstraction has 26149 states and 38466 transitions. [2025-03-16 19:38:37,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.0) internal successors, (182), 6 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:37,286 INFO L276 IsEmpty]: Start isEmpty. Operand 26149 states and 38466 transitions. [2025-03-16 19:38:37,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-16 19:38:37,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:37,288 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:37,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-16 19:38:37,289 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:37,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:37,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1430960937, now seen corresponding path program 1 times [2025-03-16 19:38:37,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:37,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001579615] [2025-03-16 19:38:37,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:37,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:37,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-16 19:38:37,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-16 19:38:37,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:37,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:37,396 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:37,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:37,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001579615] [2025-03-16 19:38:37,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001579615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:37,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:37,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:38:37,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290257224] [2025-03-16 19:38:37,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:37,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:38:37,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:37,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:38:37,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:38:37,399 INFO L87 Difference]: Start difference. First operand 26149 states and 38466 transitions. Second operand has 7 states, 7 states have (on average 26.0) internal successors, (182), 6 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:37,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:37,866 INFO L93 Difference]: Finished difference Result 111169 states and 164352 transitions. [2025-03-16 19:38:37,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:38:37,866 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.0) internal successors, (182), 6 states have internal predecessors, (182), 0 states have call successors, (0), 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 182 [2025-03-16 19:38:37,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:37,952 INFO L225 Difference]: With dead ends: 111169 [2025-03-16 19:38:37,953 INFO L226 Difference]: Without dead ends: 85235 [2025-03-16 19:38:37,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:38:37,987 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 1643 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1643 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:37,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1643 Valid, 568 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:38:38,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85235 states. [2025-03-16 19:38:38,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85235 to 55041. [2025-03-16 19:38:38,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55041 states, 55040 states have (on average 1.4686773255813954) internal successors, (80836), 55040 states have internal predecessors, (80836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:38,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55041 states to 55041 states and 80836 transitions. [2025-03-16 19:38:38,723 INFO L78 Accepts]: Start accepts. Automaton has 55041 states and 80836 transitions. Word has length 182 [2025-03-16 19:38:38,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:38,724 INFO L471 AbstractCegarLoop]: Abstraction has 55041 states and 80836 transitions. [2025-03-16 19:38:38,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.0) internal successors, (182), 6 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:38,724 INFO L276 IsEmpty]: Start isEmpty. Operand 55041 states and 80836 transitions. [2025-03-16 19:38:38,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-16 19:38:38,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:38,728 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:38,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-16 19:38:38,728 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:38,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:38,728 INFO L85 PathProgramCache]: Analyzing trace with hash 376574999, now seen corresponding path program 1 times [2025-03-16 19:38:38,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:38,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196376119] [2025-03-16 19:38:38,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:38,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:38,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-16 19:38:38,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-16 19:38:38,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:38,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:38,839 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:38,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:38,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196376119] [2025-03-16 19:38:38,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196376119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:38,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:38,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:38:38,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552551627] [2025-03-16 19:38:38,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:38,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:38:38,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:38,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:38:38,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:38:38,841 INFO L87 Difference]: Start difference. First operand 55041 states and 80836 transitions. Second operand has 7 states, 7 states have (on average 26.0) internal successors, (182), 6 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:39,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:39,653 INFO L93 Difference]: Finished difference Result 219157 states and 323134 transitions. [2025-03-16 19:38:39,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:38:39,653 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.0) internal successors, (182), 6 states have internal predecessors, (182), 0 states have call successors, (0), 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 182 [2025-03-16 19:38:39,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:39,869 INFO L225 Difference]: With dead ends: 219157 [2025-03-16 19:38:39,869 INFO L226 Difference]: Without dead ends: 164331 [2025-03-16 19:38:39,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:38:39,961 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 1558 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1558 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:39,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1558 Valid, 566 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:38:40,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164331 states. [2025-03-16 19:38:41,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164331 to 115785. [2025-03-16 19:38:41,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115785 states, 115784 states have (on average 1.465832930283977) internal successors, (169720), 115784 states have internal predecessors, (169720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:41,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115785 states to 115785 states and 169720 transitions. [2025-03-16 19:38:41,889 INFO L78 Accepts]: Start accepts. Automaton has 115785 states and 169720 transitions. Word has length 182 [2025-03-16 19:38:41,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:41,889 INFO L471 AbstractCegarLoop]: Abstraction has 115785 states and 169720 transitions. [2025-03-16 19:38:41,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.0) internal successors, (182), 6 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:41,889 INFO L276 IsEmpty]: Start isEmpty. Operand 115785 states and 169720 transitions. [2025-03-16 19:38:41,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-16 19:38:41,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:41,895 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:41,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-16 19:38:41,895 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:41,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:41,896 INFO L85 PathProgramCache]: Analyzing trace with hash 89675479, now seen corresponding path program 1 times [2025-03-16 19:38:41,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:41,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972827220] [2025-03-16 19:38:41,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:41,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:41,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-16 19:38:41,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-16 19:38:41,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:41,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:42,311 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:42,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:42,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972827220] [2025-03-16 19:38:42,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972827220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:42,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:42,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:38:42,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977163452] [2025-03-16 19:38:42,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:42,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:38:42,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:42,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:38:42,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:38:42,312 INFO L87 Difference]: Start difference. First operand 115785 states and 169720 transitions. Second operand has 7 states, 7 states have (on average 26.0) internal successors, (182), 6 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:43,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:43,775 INFO L93 Difference]: Finished difference Result 432173 states and 635370 transitions. [2025-03-16 19:38:43,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:38:43,776 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.0) internal successors, (182), 6 states have internal predecessors, (182), 0 states have call successors, (0), 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 182 [2025-03-16 19:38:43,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:44,215 INFO L225 Difference]: With dead ends: 432173 [2025-03-16 19:38:44,215 INFO L226 Difference]: Without dead ends: 316603 [2025-03-16 19:38:44,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:38:44,279 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 1473 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1473 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:44,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1473 Valid, 564 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:38:44,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316603 states. [2025-03-16 19:38:47,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316603 to 243193. [2025-03-16 19:38:47,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243193 states, 243192 states have (on average 1.4629428599624987) internal successors, (355776), 243192 states have internal predecessors, (355776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:48,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243193 states to 243193 states and 355776 transitions. [2025-03-16 19:38:48,004 INFO L78 Accepts]: Start accepts. Automaton has 243193 states and 355776 transitions. Word has length 182 [2025-03-16 19:38:48,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:48,004 INFO L471 AbstractCegarLoop]: Abstraction has 243193 states and 355776 transitions. [2025-03-16 19:38:48,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.0) internal successors, (182), 6 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:48,004 INFO L276 IsEmpty]: Start isEmpty. Operand 243193 states and 355776 transitions. [2025-03-16 19:38:48,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-16 19:38:48,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:48,013 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:48,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-16 19:38:48,013 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:48,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:48,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1065317239, now seen corresponding path program 1 times [2025-03-16 19:38:48,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:48,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435608478] [2025-03-16 19:38:48,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:48,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:48,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-16 19:38:48,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-16 19:38:48,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:48,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:48,358 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:48,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:48,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435608478] [2025-03-16 19:38:48,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435608478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:48,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:48,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:38:48,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848797241] [2025-03-16 19:38:48,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:48,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:38:48,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:48,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:38:48,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:38:48,359 INFO L87 Difference]: Start difference. First operand 243193 states and 355776 transitions. Second operand has 7 states, 7 states have (on average 26.0) internal successors, (182), 6 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:50,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:50,638 INFO L93 Difference]: Finished difference Result 804925 states and 1178146 transitions. [2025-03-16 19:38:50,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:38:50,639 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.0) internal successors, (182), 6 states have internal predecessors, (182), 0 states have call successors, (0), 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 182 [2025-03-16 19:38:50,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:52,048 INFO L225 Difference]: With dead ends: 804925 [2025-03-16 19:38:52,048 INFO L226 Difference]: Without dead ends: 561947 [2025-03-16 19:38:52,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:38:52,145 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 1303 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1303 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:52,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1303 Valid, 560 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:38:52,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561947 states. [2025-03-16 19:38:57,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561947 to 509849. [2025-03-16 19:38:57,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509849 states, 509848 states have (on average 1.4601685208140465) internal successors, (744464), 509848 states have internal predecessors, (744464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:59,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509849 states to 509849 states and 744464 transitions. [2025-03-16 19:38:59,664 INFO L78 Accepts]: Start accepts. Automaton has 509849 states and 744464 transitions. Word has length 182 [2025-03-16 19:38:59,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:59,664 INFO L471 AbstractCegarLoop]: Abstraction has 509849 states and 744464 transitions. [2025-03-16 19:38:59,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.0) internal successors, (182), 6 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:59,664 INFO L276 IsEmpty]: Start isEmpty. Operand 509849 states and 744464 transitions. [2025-03-16 19:38:59,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-16 19:38:59,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:59,674 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:59,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-16 19:38:59,675 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:38:59,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:59,675 INFO L85 PathProgramCache]: Analyzing trace with hash 231866493, now seen corresponding path program 1 times [2025-03-16 19:38:59,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:59,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248168160] [2025-03-16 19:38:59,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:59,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:59,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-16 19:38:59,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-16 19:38:59,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:59,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:59,832 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:59,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:59,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248168160] [2025-03-16 19:38:59,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248168160] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:38:59,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110628017] [2025-03-16 19:38:59,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:59,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:38:59,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:38:59,835 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:38:59,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 19:38:59,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-16 19:39:00,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-16 19:39:00,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:39:00,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:39:00,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 19:39:00,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:39:00,751 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:39:00,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:39:00,923 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:39:00,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110628017] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:39:00,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:39:00,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-16 19:39:00,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007510612] [2025-03-16 19:39:00,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:39:00,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:39:00,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:39:00,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:39:00,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:39:00,924 INFO L87 Difference]: Start difference. First operand 509849 states and 744464 transitions. Second operand has 11 states, 11 states have (on average 29.636363636363637) internal successors, (326), 10 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)