./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '38533fb2932c589b42c93c264dc8e5e297bb0dbb9a49080a666466aefcec5174'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 38533fb2932c589b42c93c264dc8e5e297bb0dbb9a49080a666466aefcec5174 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:30:47,983 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:30:48,103 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 00:30:48,110 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:30:48,110 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:30:48,130 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:30:48,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:30:48,131 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:30:48,131 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:30:48,132 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:30:48,132 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:30:48,132 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:30:48,132 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:30:48,133 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:30:48,133 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:30:48,133 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:30:48,133 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:30:48,133 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:30:48,133 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:30:48,133 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:30:48,133 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:30:48,133 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:30:48,134 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:30:48,134 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:30:48,134 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:30:48,134 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:30:48,134 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:30:48,134 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:30:48,134 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:30:48,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:30:48,134 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:30:48,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:30:48,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:30:48,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:30:48,135 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:30:48,135 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:30:48,135 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:30:48,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:30:48,135 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:30:48,135 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:30:48,135 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:30:48,136 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:30:48,136 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 38533fb2932c589b42c93c264dc8e5e297bb0dbb9a49080a666466aefcec5174 [2024-11-07 00:30:48,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:30:48,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:30:48,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:30:48,409 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:30:48,409 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:30:48,411 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2024-11-07 00:30:49,906 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:30:50,251 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:30:50,252 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2024-11-07 00:30:50,269 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b0bbacb4a/c82f7307736740a29b3d2858695d5632/FLAG38ff668ae [2024-11-07 00:30:50,284 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b0bbacb4a/c82f7307736740a29b3d2858695d5632 [2024-11-07 00:30:50,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:30:50,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:30:50,289 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:30:50,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:30:50,293 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:30:50,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:30:50" (1/1) ... [2024-11-07 00:30:50,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14f452e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:50, skipping insertion in model container [2024-11-07 00:30:50,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:30:50" (1/1) ... [2024-11-07 00:30:50,343 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:30:50,551 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[9419,9432] [2024-11-07 00:30:50,569 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[12891,12904] [2024-11-07 00:30:50,575 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14047,14060] [2024-11-07 00:30:50,579 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14703,14716] [2024-11-07 00:30:50,585 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16224,16237] [2024-11-07 00:30:50,588 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16880,16893] [2024-11-07 00:30:50,593 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[17864,17877] [2024-11-07 00:30:50,603 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20202,20215] [2024-11-07 00:30:50,607 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20861,20874] [2024-11-07 00:30:50,611 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[21885,21898] [2024-11-07 00:30:50,621 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[23760,23773] [2024-11-07 00:30:50,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:30:50,723 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:30:50,805 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[9419,9432] [2024-11-07 00:30:50,835 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[12891,12904] [2024-11-07 00:30:50,854 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14047,14060] [2024-11-07 00:30:50,864 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14703,14716] [2024-11-07 00:30:50,880 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16224,16237] [2024-11-07 00:30:50,891 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16880,16893] [2024-11-07 00:30:50,902 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[17864,17877] [2024-11-07 00:30:50,921 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20202,20215] [2024-11-07 00:30:50,923 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20861,20874] [2024-11-07 00:30:50,933 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[21885,21898] [2024-11-07 00:30:50,950 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[23760,23773] [2024-11-07 00:30:51,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:30:51,122 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:30:51,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:51 WrapperNode [2024-11-07 00:30:51,123 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:30:51,124 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:30:51,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:30:51,124 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:30:51,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:51" (1/1) ... [2024-11-07 00:30:51,161 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:51" (1/1) ... [2024-11-07 00:30:51,226 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2020 [2024-11-07 00:30:51,226 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:30:51,227 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:30:51,227 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:30:51,227 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:30:51,238 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:51" (1/1) ... [2024-11-07 00:30:51,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:51" (1/1) ... [2024-11-07 00:30:51,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:51" (1/1) ... [2024-11-07 00:30:51,301 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]. [2024-11-07 00:30:51,302 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:51" (1/1) ... [2024-11-07 00:30:51,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:51" (1/1) ... [2024-11-07 00:30:51,338 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:51" (1/1) ... [2024-11-07 00:30:51,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:51" (1/1) ... [2024-11-07 00:30:51,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:51" (1/1) ... [2024-11-07 00:30:51,382 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:51" (1/1) ... [2024-11-07 00:30:51,396 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:30:51,401 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:30:51,401 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:30:51,401 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:30:51,403 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:51" (1/1) ... [2024-11-07 00:30:51,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:30:51,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:30:51,499 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 00:30:51,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 00:30:51,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:30:51,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:30:51,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:30:51,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:30:51,720 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:30:51,722 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:30:53,119 INFO L? ?]: Removed 326 outVars from TransFormulas that were not future-live. [2024-11-07 00:30:53,120 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:30:53,144 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:30:53,146 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 00:30:53,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:30:53 BoogieIcfgContainer [2024-11-07 00:30:53,147 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:30:53,150 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:30:53,150 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:30:53,155 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:30:53,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:30:50" (1/3) ... [2024-11-07 00:30:53,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db78dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:30:53, skipping insertion in model container [2024-11-07 00:30:53,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:51" (2/3) ... [2024-11-07 00:30:53,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db78dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:30:53, skipping insertion in model container [2024-11-07 00:30:53,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:30:53" (3/3) ... [2024-11-07 00:30:53,157 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2024-11-07 00:30:53,172 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:30:53,173 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-11-07 00:30:53,226 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:30:53,236 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;@7263421c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:30:53,237 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-07 00:30:53,244 INFO L276 IsEmpty]: Start isEmpty. Operand has 358 states, 346 states have (on average 1.8381502890173411) internal successors, (636), 357 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:30:53,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-07 00:30:53,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:53,259 INFO L215 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] [2024-11-07 00:30:53,263 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:30:53,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:53,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1374718599, now seen corresponding path program 1 times [2024-11-07 00:30:53,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:53,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367716963] [2024-11-07 00:30:53,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:53,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:53,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:30:53,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:53,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367716963] [2024-11-07 00:30:53,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367716963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:30:53,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:30:53,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:30:53,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872476237] [2024-11-07 00:30:53,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:30:53,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:30:53,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:53,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:30:53,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:30:53,812 INFO L87 Difference]: Start difference. First operand has 358 states, 346 states have (on average 1.8381502890173411) internal successors, (636), 357 states have internal predecessors, (636), 0 states have call successors, (0), 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 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:30:54,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:54,146 INFO L93 Difference]: Finished difference Result 570 states and 974 transitions. [2024-11-07 00:30:54,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:30:54,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2024-11-07 00:30:54,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:54,159 INFO L225 Difference]: With dead ends: 570 [2024-11-07 00:30:54,161 INFO L226 Difference]: Without dead ends: 294 [2024-11-07 00:30:54,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:30:54,170 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 1459 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1459 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:54,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1459 Valid, 363 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:30:54,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-07 00:30:54,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2024-11-07 00:30:54,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 283 states have (on average 1.2968197879858658) internal successors, (367), 293 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:30:54,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 367 transitions. [2024-11-07 00:30:54,228 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 367 transitions. Word has length 59 [2024-11-07 00:30:54,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:54,229 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 367 transitions. [2024-11-07 00:30:54,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:30:54,229 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 367 transitions. [2024-11-07 00:30:54,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-07 00:30:54,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:54,234 INFO L215 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] [2024-11-07 00:30:54,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:30:54,235 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:30:54,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:54,236 INFO L85 PathProgramCache]: Analyzing trace with hash -2133391140, now seen corresponding path program 1 times [2024-11-07 00:30:54,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:54,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687735238] [2024-11-07 00:30:54,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:54,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:54,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:30:54,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:54,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687735238] [2024-11-07 00:30:54,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687735238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:30:54,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:30:54,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:30:54,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779997128] [2024-11-07 00:30:54,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:30:54,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:30:54,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:54,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:30:54,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:30:54,523 INFO L87 Difference]: Start difference. First operand 294 states and 367 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:30:54,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:54,769 INFO L93 Difference]: Finished difference Result 497 states and 636 transitions. [2024-11-07 00:30:54,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:30:54,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-11-07 00:30:54,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:54,774 INFO L225 Difference]: With dead ends: 497 [2024-11-07 00:30:54,774 INFO L226 Difference]: Without dead ends: 274 [2024-11-07 00:30:54,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:30:54,776 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 950 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:54,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 210 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:30:54,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-07 00:30:54,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2024-11-07 00:30:54,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 263 states have (on average 1.3003802281368821) internal successors, (342), 273 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:30:54,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 342 transitions. [2024-11-07 00:30:54,786 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 342 transitions. Word has length 60 [2024-11-07 00:30:54,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:54,787 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 342 transitions. [2024-11-07 00:30:54,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:30:54,787 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 342 transitions. [2024-11-07 00:30:54,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-07 00:30:54,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:54,789 INFO L215 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] [2024-11-07 00:30:54,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:30:54,789 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:30:54,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:54,790 INFO L85 PathProgramCache]: Analyzing trace with hash 626465560, now seen corresponding path program 1 times [2024-11-07 00:30:54,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:54,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114661062] [2024-11-07 00:30:54,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:54,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:54,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:30:54,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:54,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114661062] [2024-11-07 00:30:54,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114661062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:30:54,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:30:54,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:30:54,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13446317] [2024-11-07 00:30:54,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:30:54,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:30:54,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:54,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:30:54,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:30:54,959 INFO L87 Difference]: Start difference. First operand 274 states and 342 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:30:55,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:55,146 INFO L93 Difference]: Finished difference Result 477 states and 610 transitions. [2024-11-07 00:30:55,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:30:55,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-11-07 00:30:55,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:55,149 INFO L225 Difference]: With dead ends: 477 [2024-11-07 00:30:55,149 INFO L226 Difference]: Without dead ends: 255 [2024-11-07 00:30:55,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:30:55,150 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 910 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:55,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 199 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:30:55,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-07 00:30:55,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2024-11-07 00:30:55,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 244 states have (on average 1.3114754098360655) internal successors, (320), 254 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:30:55,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 320 transitions. [2024-11-07 00:30:55,159 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 320 transitions. Word has length 61 [2024-11-07 00:30:55,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:55,159 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 320 transitions. [2024-11-07 00:30:55,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:30:55,159 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 320 transitions. [2024-11-07 00:30:55,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-07 00:30:55,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:55,161 INFO L215 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] [2024-11-07 00:30:55,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:30:55,161 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:30:55,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:55,162 INFO L85 PathProgramCache]: Analyzing trace with hash 55190193, now seen corresponding path program 1 times [2024-11-07 00:30:55,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:55,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539352500] [2024-11-07 00:30:55,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:55,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:55,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:30:55,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:55,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539352500] [2024-11-07 00:30:55,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539352500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:30:55,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:30:55,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:30:55,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79747964] [2024-11-07 00:30:55,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:30:55,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:30:55,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:55,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:30:55,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:30:55,339 INFO L87 Difference]: Start difference. First operand 255 states and 320 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:30:55,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:55,511 INFO L93 Difference]: Finished difference Result 458 states and 587 transitions. [2024-11-07 00:30:55,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:30:55,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-07 00:30:55,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:55,513 INFO L225 Difference]: With dead ends: 458 [2024-11-07 00:30:55,513 INFO L226 Difference]: Without dead ends: 247 [2024-11-07 00:30:55,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:30:55,514 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 867 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:55,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 195 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:30:55,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-07 00:30:55,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2024-11-07 00:30:55,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 236 states have (on average 1.3135593220338984) internal successors, (310), 246 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:30:55,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 310 transitions. [2024-11-07 00:30:55,522 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 310 transitions. Word has length 62 [2024-11-07 00:30:55,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:55,522 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 310 transitions. [2024-11-07 00:30:55,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:30:55,522 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 310 transitions. [2024-11-07 00:30:55,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-07 00:30:55,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:55,523 INFO L215 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] [2024-11-07 00:30:55,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:30:55,524 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:30:55,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:55,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1176799625, now seen corresponding path program 1 times [2024-11-07 00:30:55,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:55,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505217418] [2024-11-07 00:30:55,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:55,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:55,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:30:55,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:55,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505217418] [2024-11-07 00:30:55,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505217418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:30:55,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:30:55,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:30:55,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085476041] [2024-11-07 00:30:55,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:30:55,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:30:55,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:55,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:30:55,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:30:55,938 INFO L87 Difference]: Start difference. First operand 247 states and 310 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:30:56,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:56,602 INFO L93 Difference]: Finished difference Result 471 states and 608 transitions. [2024-11-07 00:30:56,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:30:56,603 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-11-07 00:30:56,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:56,606 INFO L225 Difference]: With dead ends: 471 [2024-11-07 00:30:56,606 INFO L226 Difference]: Without dead ends: 383 [2024-11-07 00:30:56,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:30:56,608 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 1424 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1424 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:56,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1424 Valid, 993 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:30:56,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-07 00:30:56,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 247. [2024-11-07 00:30:56,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 236 states have (on average 1.3093220338983051) internal successors, (309), 246 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:30:56,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 309 transitions. [2024-11-07 00:30:56,626 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 309 transitions. Word has length 63 [2024-11-07 00:30:56,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:56,627 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 309 transitions. [2024-11-07 00:30:56,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:30:56,627 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 309 transitions. [2024-11-07 00:30:56,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-07 00:30:56,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:56,628 INFO L215 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] [2024-11-07 00:30:56,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:30:56,632 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:30:56,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:56,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1585644853, now seen corresponding path program 1 times [2024-11-07 00:30:56,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:56,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452396433] [2024-11-07 00:30:56,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:56,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:56,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:57,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:30:57,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:57,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452396433] [2024-11-07 00:30:57,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452396433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:30:57,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:30:57,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:30:57,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418471746] [2024-11-07 00:30:57,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:30:57,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:30:57,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:57,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:30:57,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:30:57,038 INFO L87 Difference]: Start difference. First operand 247 states and 309 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:30:57,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:57,559 INFO L93 Difference]: Finished difference Result 376 states and 469 transitions. [2024-11-07 00:30:57,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:30:57,560 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-11-07 00:30:57,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:57,562 INFO L225 Difference]: With dead ends: 376 [2024-11-07 00:30:57,564 INFO L226 Difference]: Without dead ends: 371 [2024-11-07 00:30:57,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:30:57,566 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 820 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:57,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 742 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:30:57,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-07 00:30:57,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 247. [2024-11-07 00:30:57,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 236 states have (on average 1.305084745762712) internal successors, (308), 246 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:30:57,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 308 transitions. [2024-11-07 00:30:57,577 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 308 transitions. Word has length 63 [2024-11-07 00:30:57,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:57,577 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 308 transitions. [2024-11-07 00:30:57,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:30:57,577 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 308 transitions. [2024-11-07 00:30:57,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-07 00:30:57,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:57,580 INFO L215 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] [2024-11-07 00:30:57,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:30:57,582 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:30:57,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:57,582 INFO L85 PathProgramCache]: Analyzing trace with hash 202563885, now seen corresponding path program 1 times [2024-11-07 00:30:57,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:57,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861746888] [2024-11-07 00:30:57,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:57,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:58,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:30:58,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:58,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861746888] [2024-11-07 00:30:58,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861746888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:30:58,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:30:58,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:30:58,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933319683] [2024-11-07 00:30:58,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:30:58,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 00:30:58,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:58,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 00:30:58,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:30:58,164 INFO L87 Difference]: Start difference. First operand 247 states and 308 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:30:58,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:58,599 INFO L93 Difference]: Finished difference Result 486 states and 608 transitions. [2024-11-07 00:30:58,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:30:58,600 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-11-07 00:30:58,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:58,601 INFO L225 Difference]: With dead ends: 486 [2024-11-07 00:30:58,602 INFO L226 Difference]: Without dead ends: 353 [2024-11-07 00:30:58,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-07 00:30:58,603 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 1270 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1270 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:58,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1270 Valid, 767 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:30:58,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-07 00:30:58,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 247. [2024-11-07 00:30:58,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 236 states have (on average 1.3008474576271187) internal successors, (307), 246 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:30:58,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 307 transitions. [2024-11-07 00:30:58,610 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 307 transitions. Word has length 63 [2024-11-07 00:30:58,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:58,611 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 307 transitions. [2024-11-07 00:30:58,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:30:58,611 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 307 transitions. [2024-11-07 00:30:58,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 00:30:58,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:58,612 INFO L215 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] [2024-11-07 00:30:58,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:30:58,612 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:30:58,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:58,613 INFO L85 PathProgramCache]: Analyzing trace with hash -620136770, now seen corresponding path program 1 times [2024-11-07 00:30:58,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:58,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231073319] [2024-11-07 00:30:58,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:58,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:58,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:30:58,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:58,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231073319] [2024-11-07 00:30:58,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231073319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:30:58,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:30:58,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:30:58,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470330020] [2024-11-07 00:30:58,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:30:58,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:30:58,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:58,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:30:58,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:30:58,957 INFO L87 Difference]: Start difference. First operand 247 states and 307 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:30:59,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:59,468 INFO L93 Difference]: Finished difference Result 430 states and 546 transitions. [2024-11-07 00:30:59,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:30:59,469 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-07 00:30:59,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:59,470 INFO L225 Difference]: With dead ends: 430 [2024-11-07 00:30:59,470 INFO L226 Difference]: Without dead ends: 371 [2024-11-07 00:30:59,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:30:59,471 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 1710 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1710 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:59,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1710 Valid, 745 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:30:59,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-07 00:30:59,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 247. [2024-11-07 00:30:59,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 236 states have (on average 1.2966101694915255) internal successors, (306), 246 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:30:59,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 306 transitions. [2024-11-07 00:30:59,484 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 306 transitions. Word has length 65 [2024-11-07 00:30:59,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:59,484 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 306 transitions. [2024-11-07 00:30:59,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:30:59,485 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 306 transitions. [2024-11-07 00:30:59,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 00:30:59,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:59,486 INFO L215 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] [2024-11-07 00:30:59,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:30:59,486 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:30:59,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:59,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1292060332, now seen corresponding path program 1 times [2024-11-07 00:30:59,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:59,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279575543] [2024-11-07 00:30:59,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:59,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:00,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:00,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:00,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279575543] [2024-11-07 00:31:00,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279575543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:31:00,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:31:00,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:31:00,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902994483] [2024-11-07 00:31:00,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:31:00,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:31:00,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:00,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:31:00,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:31:00,199 INFO L87 Difference]: Start difference. First operand 247 states and 306 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:01,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:01,153 INFO L93 Difference]: Finished difference Result 632 states and 839 transitions. [2024-11-07 00:31:01,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 00:31:01,153 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-07 00:31:01,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:01,156 INFO L225 Difference]: With dead ends: 632 [2024-11-07 00:31:01,156 INFO L226 Difference]: Without dead ends: 561 [2024-11-07 00:31:01,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:31:01,157 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 3487 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3487 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:01,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3487 Valid, 1118 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:31:01,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2024-11-07 00:31:01,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 251. [2024-11-07 00:31:01,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 240 states have (on average 1.2916666666666667) internal successors, (310), 250 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:01,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 310 transitions. [2024-11-07 00:31:01,166 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 310 transitions. Word has length 65 [2024-11-07 00:31:01,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:01,166 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 310 transitions. [2024-11-07 00:31:01,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:01,166 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 310 transitions. [2024-11-07 00:31:01,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 00:31:01,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:01,167 INFO L215 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] [2024-11-07 00:31:01,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:31:01,167 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:01,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:01,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1564639340, now seen corresponding path program 1 times [2024-11-07 00:31:01,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:01,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957094820] [2024-11-07 00:31:01,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:01,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:01,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:01,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:01,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957094820] [2024-11-07 00:31:01,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957094820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:31:01,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:31:01,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:31:01,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697475576] [2024-11-07 00:31:01,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:31:01,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:31:01,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:01,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:31:01,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:31:01,440 INFO L87 Difference]: Start difference. First operand 251 states and 310 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:01,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:01,905 INFO L93 Difference]: Finished difference Result 445 states and 568 transitions. [2024-11-07 00:31:01,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:31:01,905 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-07 00:31:01,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:01,907 INFO L225 Difference]: With dead ends: 445 [2024-11-07 00:31:01,907 INFO L226 Difference]: Without dead ends: 379 [2024-11-07 00:31:01,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:31:01,909 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 1673 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1673 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:01,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1673 Valid, 824 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:31:01,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-07 00:31:01,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 251. [2024-11-07 00:31:01,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 240 states have (on average 1.2875) internal successors, (309), 250 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:01,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 309 transitions. [2024-11-07 00:31:01,919 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 309 transitions. Word has length 65 [2024-11-07 00:31:01,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:01,919 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 309 transitions. [2024-11-07 00:31:01,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:01,920 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 309 transitions. [2024-11-07 00:31:01,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 00:31:01,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:01,920 INFO L215 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] [2024-11-07 00:31:01,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:31:01,921 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:01,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:01,923 INFO L85 PathProgramCache]: Analyzing trace with hash -109241464, now seen corresponding path program 1 times [2024-11-07 00:31:01,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:01,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240229268] [2024-11-07 00:31:01,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:01,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:02,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:02,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:02,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240229268] [2024-11-07 00:31:02,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240229268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:31:02,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:31:02,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:31:02,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717312370] [2024-11-07 00:31:02,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:31:02,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:31:02,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:02,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:31:02,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:31:02,225 INFO L87 Difference]: Start difference. First operand 251 states and 309 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:02,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:02,685 INFO L93 Difference]: Finished difference Result 431 states and 545 transitions. [2024-11-07 00:31:02,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:31:02,685 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-07 00:31:02,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:02,687 INFO L225 Difference]: With dead ends: 431 [2024-11-07 00:31:02,687 INFO L226 Difference]: Without dead ends: 375 [2024-11-07 00:31:02,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:31:02,688 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 1662 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1662 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:02,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1662 Valid, 777 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:31:02,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-07 00:31:02,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 251. [2024-11-07 00:31:02,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 240 states have (on average 1.2833333333333334) internal successors, (308), 250 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:02,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 308 transitions. [2024-11-07 00:31:02,701 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 308 transitions. Word has length 65 [2024-11-07 00:31:02,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:02,701 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 308 transitions. [2024-11-07 00:31:02,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:02,701 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 308 transitions. [2024-11-07 00:31:02,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 00:31:02,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:02,703 INFO L215 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] [2024-11-07 00:31:02,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:31:02,704 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:02,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:02,704 INFO L85 PathProgramCache]: Analyzing trace with hash -636059456, now seen corresponding path program 1 times [2024-11-07 00:31:02,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:02,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153084969] [2024-11-07 00:31:02,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:02,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:02,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:02,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:02,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153084969] [2024-11-07 00:31:02,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153084969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:31:02,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:31:02,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:31:02,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009530301] [2024-11-07 00:31:02,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:31:02,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:31:02,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:02,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:31:02,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:31:02,988 INFO L87 Difference]: Start difference. First operand 251 states and 308 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:03,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:03,525 INFO L93 Difference]: Finished difference Result 481 states and 611 transitions. [2024-11-07 00:31:03,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:31:03,525 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-07 00:31:03,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:03,527 INFO L225 Difference]: With dead ends: 481 [2024-11-07 00:31:03,527 INFO L226 Difference]: Without dead ends: 387 [2024-11-07 00:31:03,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:31:03,528 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 1004 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:03,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 1214 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:31:03,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-11-07 00:31:03,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 251. [2024-11-07 00:31:03,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 240 states have (on average 1.2791666666666666) internal successors, (307), 250 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:03,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 307 transitions. [2024-11-07 00:31:03,540 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 307 transitions. Word has length 65 [2024-11-07 00:31:03,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:03,540 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 307 transitions. [2024-11-07 00:31:03,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:03,540 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 307 transitions. [2024-11-07 00:31:03,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 00:31:03,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:03,541 INFO L215 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] [2024-11-07 00:31:03,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:31:03,541 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:03,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:03,542 INFO L85 PathProgramCache]: Analyzing trace with hash 2058271748, now seen corresponding path program 1 times [2024-11-07 00:31:03,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:03,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100685458] [2024-11-07 00:31:03,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:03,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:03,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:03,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:03,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100685458] [2024-11-07 00:31:03,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100685458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:31:03,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:31:03,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:31:03,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595181670] [2024-11-07 00:31:03,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:31:03,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:31:03,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:03,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:31:03,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:31:03,967 INFO L87 Difference]: Start difference. First operand 251 states and 307 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:04,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:04,498 INFO L93 Difference]: Finished difference Result 380 states and 466 transitions. [2024-11-07 00:31:04,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:31:04,499 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-07 00:31:04,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:04,501 INFO L225 Difference]: With dead ends: 380 [2024-11-07 00:31:04,501 INFO L226 Difference]: Without dead ends: 375 [2024-11-07 00:31:04,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:31:04,502 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 1652 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1652 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:04,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1652 Valid, 777 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:31:04,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-07 00:31:04,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 251. [2024-11-07 00:31:04,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 240 states have (on average 1.275) internal successors, (306), 250 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:04,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 306 transitions. [2024-11-07 00:31:04,510 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 306 transitions. Word has length 65 [2024-11-07 00:31:04,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:04,510 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 306 transitions. [2024-11-07 00:31:04,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:04,511 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 306 transitions. [2024-11-07 00:31:04,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 00:31:04,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:04,512 INFO L215 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] [2024-11-07 00:31:04,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 00:31:04,512 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:04,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:04,512 INFO L85 PathProgramCache]: Analyzing trace with hash -324498446, now seen corresponding path program 1 times [2024-11-07 00:31:04,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:04,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815561506] [2024-11-07 00:31:04,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:04,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:04,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:04,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:04,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815561506] [2024-11-07 00:31:04,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815561506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:31:04,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:31:04,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:31:04,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535015946] [2024-11-07 00:31:04,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:31:04,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:31:04,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:04,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:31:04,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:31:04,753 INFO L87 Difference]: Start difference. First operand 251 states and 306 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:05,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:05,199 INFO L93 Difference]: Finished difference Result 396 states and 490 transitions. [2024-11-07 00:31:05,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:31:05,199 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-07 00:31:05,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:05,201 INFO L225 Difference]: With dead ends: 396 [2024-11-07 00:31:05,201 INFO L226 Difference]: Without dead ends: 379 [2024-11-07 00:31:05,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:31:05,202 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 1282 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1282 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:05,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1282 Valid, 970 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:31:05,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-07 00:31:05,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 251. [2024-11-07 00:31:05,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 240 states have (on average 1.2708333333333333) internal successors, (305), 250 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:05,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 305 transitions. [2024-11-07 00:31:05,209 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 305 transitions. Word has length 65 [2024-11-07 00:31:05,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:05,209 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 305 transitions. [2024-11-07 00:31:05,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:05,210 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 305 transitions. [2024-11-07 00:31:05,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 00:31:05,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:05,211 INFO L215 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] [2024-11-07 00:31:05,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 00:31:05,211 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:05,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:05,211 INFO L85 PathProgramCache]: Analyzing trace with hash -849466761, now seen corresponding path program 1 times [2024-11-07 00:31:05,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:05,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322302871] [2024-11-07 00:31:05,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:05,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:05,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:05,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:05,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322302871] [2024-11-07 00:31:05,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322302871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:31:05,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:31:05,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:31:05,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752487617] [2024-11-07 00:31:05,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:31:05,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:31:05,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:05,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:31:05,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:31:05,473 INFO L87 Difference]: Start difference. First operand 251 states and 305 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:06,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:06,024 INFO L93 Difference]: Finished difference Result 450 states and 569 transitions. [2024-11-07 00:31:06,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:31:06,025 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-07 00:31:06,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:06,026 INFO L225 Difference]: With dead ends: 450 [2024-11-07 00:31:06,027 INFO L226 Difference]: Without dead ends: 379 [2024-11-07 00:31:06,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2024-11-07 00:31:06,028 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 944 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:06,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 1119 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:31:06,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-07 00:31:06,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 247. [2024-11-07 00:31:06,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 236 states have (on average 1.271186440677966) internal successors, (300), 246 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:06,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 300 transitions. [2024-11-07 00:31:06,038 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 300 transitions. Word has length 66 [2024-11-07 00:31:06,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:06,038 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 300 transitions. [2024-11-07 00:31:06,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:06,038 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 300 transitions. [2024-11-07 00:31:06,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-07 00:31:06,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:06,039 INFO L215 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] [2024-11-07 00:31:06,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 00:31:06,039 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:06,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:06,040 INFO L85 PathProgramCache]: Analyzing trace with hash -809481061, now seen corresponding path program 1 times [2024-11-07 00:31:06,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:06,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596921873] [2024-11-07 00:31:06,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:06,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:07,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:07,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:07,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596921873] [2024-11-07 00:31:07,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596921873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:31:07,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:31:07,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-07 00:31:07,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835662568] [2024-11-07 00:31:07,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:31:07,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-07 00:31:07,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:07,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-07 00:31:07,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2024-11-07 00:31:07,251 INFO L87 Difference]: Start difference. First operand 247 states and 300 transitions. Second operand has 20 states, 20 states have (on average 3.35) internal successors, (67), 20 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:09,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:09,454 INFO L93 Difference]: Finished difference Result 689 states and 865 transitions. [2024-11-07 00:31:09,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-07 00:31:09,454 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.35) internal successors, (67), 20 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-07 00:31:09,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:09,457 INFO L225 Difference]: With dead ends: 689 [2024-11-07 00:31:09,457 INFO L226 Difference]: Without dead ends: 606 [2024-11-07 00:31:09,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=324, Invalid=1008, Unknown=0, NotChecked=0, Total=1332 [2024-11-07 00:31:09,458 INFO L432 NwaCegarLoop]: 417 mSDtfsCounter, 2467 mSDsluCounter, 3906 mSDsCounter, 0 mSdLazyCounter, 1959 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2467 SdHoareTripleChecker+Valid, 4323 SdHoareTripleChecker+Invalid, 1968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:09,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2467 Valid, 4323 Invalid, 1968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1959 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 00:31:09,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-07 00:31:09,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 253. [2024-11-07 00:31:09,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 242 states have (on average 1.2644628099173554) internal successors, (306), 252 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:09,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 306 transitions. [2024-11-07 00:31:09,466 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 306 transitions. Word has length 67 [2024-11-07 00:31:09,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:09,466 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 306 transitions. [2024-11-07 00:31:09,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.35) internal successors, (67), 20 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:09,467 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 306 transitions. [2024-11-07 00:31:09,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-07 00:31:09,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:09,468 INFO L215 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] [2024-11-07 00:31:09,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 00:31:09,468 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:09,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:09,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1258064571, now seen corresponding path program 1 times [2024-11-07 00:31:09,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:09,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268852279] [2024-11-07 00:31:09,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:09,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:09,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:09,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:09,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268852279] [2024-11-07 00:31:09,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268852279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:31:09,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:31:09,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 00:31:09,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695456110] [2024-11-07 00:31:09,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:31:09,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:31:09,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:09,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:31:09,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:31:09,943 INFO L87 Difference]: Start difference. First operand 253 states and 306 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:10,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:10,465 INFO L93 Difference]: Finished difference Result 441 states and 557 transitions. [2024-11-07 00:31:10,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:31:10,466 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-07 00:31:10,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:10,468 INFO L225 Difference]: With dead ends: 441 [2024-11-07 00:31:10,468 INFO L226 Difference]: Without dead ends: 363 [2024-11-07 00:31:10,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-11-07 00:31:10,469 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 1280 mSDsluCounter, 1818 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1280 SdHoareTripleChecker+Valid, 2211 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:10,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1280 Valid, 2211 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:31:10,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-07 00:31:10,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 229. [2024-11-07 00:31:10,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 219 states have (on average 1.2602739726027397) internal successors, (276), 228 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:10,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 276 transitions. [2024-11-07 00:31:10,475 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 276 transitions. Word has length 67 [2024-11-07 00:31:10,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:10,475 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 276 transitions. [2024-11-07 00:31:10,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:10,475 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 276 transitions. [2024-11-07 00:31:10,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-07 00:31:10,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:10,476 INFO L215 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] [2024-11-07 00:31:10,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 00:31:10,476 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:10,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:10,477 INFO L85 PathProgramCache]: Analyzing trace with hash -827796874, now seen corresponding path program 1 times [2024-11-07 00:31:10,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:10,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199169650] [2024-11-07 00:31:10,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:10,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:11,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:11,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:11,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199169650] [2024-11-07 00:31:11,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199169650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:31:11,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:31:11,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-07 00:31:11,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928640385] [2024-11-07 00:31:11,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:31:11,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-07 00:31:11,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:11,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-07 00:31:11,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2024-11-07 00:31:11,751 INFO L87 Difference]: Start difference. First operand 229 states and 276 transitions. Second operand has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:14,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:14,219 INFO L93 Difference]: Finished difference Result 640 states and 807 transitions. [2024-11-07 00:31:14,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 00:31:14,220 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-07 00:31:14,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:14,222 INFO L225 Difference]: With dead ends: 640 [2024-11-07 00:31:14,223 INFO L226 Difference]: Without dead ends: 582 [2024-11-07 00:31:14,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=233, Invalid=1099, Unknown=0, NotChecked=0, Total=1332 [2024-11-07 00:31:14,224 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 2173 mSDsluCounter, 4075 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2173 SdHoareTripleChecker+Valid, 4425 SdHoareTripleChecker+Invalid, 2151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:14,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2173 Valid, 4425 Invalid, 2151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2142 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 00:31:14,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2024-11-07 00:31:14,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 244. [2024-11-07 00:31:14,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 234 states have (on average 1.2692307692307692) internal successors, (297), 243 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:14,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 297 transitions. [2024-11-07 00:31:14,230 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 297 transitions. Word has length 67 [2024-11-07 00:31:14,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:14,232 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 297 transitions. [2024-11-07 00:31:14,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:14,232 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 297 transitions. [2024-11-07 00:31:14,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-07 00:31:14,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:14,233 INFO L215 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] [2024-11-07 00:31:14,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 00:31:14,234 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:14,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:14,234 INFO L85 PathProgramCache]: Analyzing trace with hash 455689729, now seen corresponding path program 1 times [2024-11-07 00:31:14,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:14,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189317433] [2024-11-07 00:31:14,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:14,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:14,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:14,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:14,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189317433] [2024-11-07 00:31:14,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189317433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:31:14,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:31:14,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 00:31:14,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256332927] [2024-11-07 00:31:14,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:31:14,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:31:14,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:14,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:31:14,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:31:14,655 INFO L87 Difference]: Start difference. First operand 244 states and 297 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:15,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:15,196 INFO L93 Difference]: Finished difference Result 394 states and 505 transitions. [2024-11-07 00:31:15,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:31:15,196 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-07 00:31:15,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:15,198 INFO L225 Difference]: With dead ends: 394 [2024-11-07 00:31:15,198 INFO L226 Difference]: Without dead ends: 307 [2024-11-07 00:31:15,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-11-07 00:31:15,199 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 1107 mSDsluCounter, 1697 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 2005 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:15,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 2005 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:31:15,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-07 00:31:15,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 211. [2024-11-07 00:31:15,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 204 states have (on average 1.2696078431372548) internal successors, (259), 210 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:15,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 259 transitions. [2024-11-07 00:31:15,204 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 259 transitions. Word has length 67 [2024-11-07 00:31:15,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:15,205 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 259 transitions. [2024-11-07 00:31:15,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:15,205 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 259 transitions. [2024-11-07 00:31:15,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 00:31:15,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:15,207 INFO L215 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] [2024-11-07 00:31:15,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 00:31:15,207 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:15,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:15,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1015007640, now seen corresponding path program 1 times [2024-11-07 00:31:15,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:15,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259295822] [2024-11-07 00:31:15,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:15,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:15,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:15,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:15,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259295822] [2024-11-07 00:31:15,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259295822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:31:15,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:31:15,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 00:31:15,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234374695] [2024-11-07 00:31:15,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:31:15,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:31:15,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:15,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:31:15,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:31:15,735 INFO L87 Difference]: Start difference. First operand 211 states and 259 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:16,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:16,613 INFO L93 Difference]: Finished difference Result 352 states and 454 transitions. [2024-11-07 00:31:16,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:31:16,615 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-07 00:31:16,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:16,617 INFO L225 Difference]: With dead ends: 352 [2024-11-07 00:31:16,617 INFO L226 Difference]: Without dead ends: 294 [2024-11-07 00:31:16,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2024-11-07 00:31:16,618 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 547 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:16,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1171 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:31:16,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-07 00:31:16,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 207. [2024-11-07 00:31:16,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 201 states have (on average 1.263681592039801) internal successors, (254), 206 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:16,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 254 transitions. [2024-11-07 00:31:16,626 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 254 transitions. Word has length 68 [2024-11-07 00:31:16,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:16,626 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 254 transitions. [2024-11-07 00:31:16,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:16,626 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 254 transitions. [2024-11-07 00:31:16,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 00:31:16,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:16,627 INFO L215 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] [2024-11-07 00:31:16,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 00:31:16,628 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:16,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:16,628 INFO L85 PathProgramCache]: Analyzing trace with hash 986767498, now seen corresponding path program 1 times [2024-11-07 00:31:16,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:16,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353802800] [2024-11-07 00:31:16,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:16,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:17,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:17,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:17,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353802800] [2024-11-07 00:31:17,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353802800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:31:17,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:31:17,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 00:31:17,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231955937] [2024-11-07 00:31:17,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:31:17,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:31:17,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:17,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:31:17,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:31:17,249 INFO L87 Difference]: Start difference. First operand 207 states and 254 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:18,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:18,074 INFO L93 Difference]: Finished difference Result 370 states and 475 transitions. [2024-11-07 00:31:18,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:31:18,074 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-07 00:31:18,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:18,075 INFO L225 Difference]: With dead ends: 370 [2024-11-07 00:31:18,075 INFO L226 Difference]: Without dead ends: 305 [2024-11-07 00:31:18,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2024-11-07 00:31:18,076 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 978 mSDsluCounter, 1689 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 1995 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:18,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 1995 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:31:18,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-07 00:31:18,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 195. [2024-11-07 00:31:18,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 190 states have (on average 1.2578947368421052) internal successors, (239), 194 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:18,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 239 transitions. [2024-11-07 00:31:18,089 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 239 transitions. Word has length 68 [2024-11-07 00:31:18,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:18,089 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 239 transitions. [2024-11-07 00:31:18,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:18,090 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 239 transitions. [2024-11-07 00:31:18,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 00:31:18,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:18,091 INFO L215 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] [2024-11-07 00:31:18,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 00:31:18,091 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:18,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:18,095 INFO L85 PathProgramCache]: Analyzing trace with hash -922376210, now seen corresponding path program 1 times [2024-11-07 00:31:18,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:18,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028373282] [2024-11-07 00:31:18,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:18,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:18,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:18,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:18,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028373282] [2024-11-07 00:31:18,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028373282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:31:18,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:31:18,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 00:31:18,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174308198] [2024-11-07 00:31:18,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:31:18,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:31:18,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:18,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:31:18,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:31:18,846 INFO L87 Difference]: Start difference. First operand 195 states and 239 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:19,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:19,758 INFO L93 Difference]: Finished difference Result 336 states and 433 transitions. [2024-11-07 00:31:19,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:31:19,762 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-07 00:31:19,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:19,763 INFO L225 Difference]: With dead ends: 336 [2024-11-07 00:31:19,763 INFO L226 Difference]: Without dead ends: 278 [2024-11-07 00:31:19,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2024-11-07 00:31:19,764 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1012 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:19,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1012 Valid, 987 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:31:19,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-07 00:31:19,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 176. [2024-11-07 00:31:19,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 172 states have (on average 1.2383720930232558) internal successors, (213), 175 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:19,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 213 transitions. [2024-11-07 00:31:19,770 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 213 transitions. Word has length 68 [2024-11-07 00:31:19,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:19,771 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 213 transitions. [2024-11-07 00:31:19,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:19,771 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 213 transitions. [2024-11-07 00:31:19,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 00:31:19,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:19,772 INFO L215 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] [2024-11-07 00:31:19,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 00:31:19,772 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:19,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:19,773 INFO L85 PathProgramCache]: Analyzing trace with hash 823611388, now seen corresponding path program 1 times [2024-11-07 00:31:19,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:19,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735835565] [2024-11-07 00:31:19,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:19,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:20,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:20,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:20,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735835565] [2024-11-07 00:31:20,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735835565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:31:20,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:31:20,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:31:20,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075345345] [2024-11-07 00:31:20,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:31:20,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:31:20,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:20,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:31:20,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:31:20,011 INFO L87 Difference]: Start difference. First operand 176 states and 213 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:20,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:20,517 INFO L93 Difference]: Finished difference Result 272 states and 336 transitions. [2024-11-07 00:31:20,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:31:20,518 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-07 00:31:20,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:20,522 INFO L225 Difference]: With dead ends: 272 [2024-11-07 00:31:20,522 INFO L226 Difference]: Without dead ends: 265 [2024-11-07 00:31:20,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:31:20,523 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 1186 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:20,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 504 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:31:20,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-07 00:31:20,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 176. [2024-11-07 00:31:20,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 172 states have (on average 1.2325581395348837) internal successors, (212), 175 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:20,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 212 transitions. [2024-11-07 00:31:20,531 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 212 transitions. Word has length 68 [2024-11-07 00:31:20,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:20,531 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 212 transitions. [2024-11-07 00:31:20,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:20,532 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 212 transitions. [2024-11-07 00:31:20,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 00:31:20,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:20,532 INFO L215 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] [2024-11-07 00:31:20,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 00:31:20,532 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:20,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:20,533 INFO L85 PathProgramCache]: Analyzing trace with hash 520441226, now seen corresponding path program 1 times [2024-11-07 00:31:20,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:20,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474442375] [2024-11-07 00:31:20,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:20,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:20,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:20,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:20,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474442375] [2024-11-07 00:31:20,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474442375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:31:20,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:31:20,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:31:20,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021275893] [2024-11-07 00:31:20,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:31:20,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:31:20,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:20,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:31:20,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:31:20,828 INFO L87 Difference]: Start difference. First operand 176 states and 212 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:21,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:21,491 INFO L93 Difference]: Finished difference Result 538 states and 714 transitions. [2024-11-07 00:31:21,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 00:31:21,491 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-07 00:31:21,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:21,493 INFO L225 Difference]: With dead ends: 538 [2024-11-07 00:31:21,493 INFO L226 Difference]: Without dead ends: 466 [2024-11-07 00:31:21,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:31:21,494 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 2708 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2708 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:21,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2708 Valid, 749 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:31:21,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-11-07 00:31:21,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 180. [2024-11-07 00:31:21,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 176 states have (on average 1.2272727272727273) internal successors, (216), 179 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:21,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 216 transitions. [2024-11-07 00:31:21,499 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 216 transitions. Word has length 68 [2024-11-07 00:31:21,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:21,499 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 216 transitions. [2024-11-07 00:31:21,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:21,499 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 216 transitions. [2024-11-07 00:31:21,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 00:31:21,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:21,500 INFO L215 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] [2024-11-07 00:31:21,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 00:31:21,500 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:21,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:21,501 INFO L85 PathProgramCache]: Analyzing trace with hash 2115976703, now seen corresponding path program 1 times [2024-11-07 00:31:21,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:21,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201172921] [2024-11-07 00:31:21,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:21,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:21,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:21,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:21,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201172921] [2024-11-07 00:31:21,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201172921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:31:21,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:31:21,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:31:21,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935706308] [2024-11-07 00:31:21,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:31:21,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:31:21,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:21,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:31:21,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:31:21,724 INFO L87 Difference]: Start difference. First operand 180 states and 216 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:22,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:22,187 INFO L93 Difference]: Finished difference Result 276 states and 339 transitions. [2024-11-07 00:31:22,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:31:22,189 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-07 00:31:22,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:22,191 INFO L225 Difference]: With dead ends: 276 [2024-11-07 00:31:22,191 INFO L226 Difference]: Without dead ends: 269 [2024-11-07 00:31:22,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:31:22,191 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 836 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:22,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 501 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:31:22,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-07 00:31:22,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 180. [2024-11-07 00:31:22,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 176 states have (on average 1.2215909090909092) internal successors, (215), 179 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:22,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 215 transitions. [2024-11-07 00:31:22,206 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 215 transitions. Word has length 69 [2024-11-07 00:31:22,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:22,206 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 215 transitions. [2024-11-07 00:31:22,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:22,207 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 215 transitions. [2024-11-07 00:31:22,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-07 00:31:22,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:22,211 INFO L215 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] [2024-11-07 00:31:22,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 00:31:22,212 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:22,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:22,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1317093723, now seen corresponding path program 1 times [2024-11-07 00:31:22,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:22,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669798329] [2024-11-07 00:31:22,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:22,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:22,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:22,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:22,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669798329] [2024-11-07 00:31:22,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669798329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:31:22,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:31:22,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:31:22,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131248777] [2024-11-07 00:31:22,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:31:22,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:31:22,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:22,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:31:22,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:31:22,505 INFO L87 Difference]: Start difference. First operand 180 states and 215 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:22,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:22,969 INFO L93 Difference]: Finished difference Result 356 states and 447 transitions. [2024-11-07 00:31:22,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:31:22,970 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-07 00:31:22,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:22,971 INFO L225 Difference]: With dead ends: 356 [2024-11-07 00:31:22,971 INFO L226 Difference]: Without dead ends: 284 [2024-11-07 00:31:22,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:31:22,973 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 797 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:22,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 845 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:31:22,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-07 00:31:22,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 176. [2024-11-07 00:31:22,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 172 states have (on average 1.2209302325581395) internal successors, (210), 175 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:22,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 210 transitions. [2024-11-07 00:31:22,987 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 210 transitions. Word has length 69 [2024-11-07 00:31:22,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:22,987 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 210 transitions. [2024-11-07 00:31:22,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:22,987 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 210 transitions. [2024-11-07 00:31:22,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-07 00:31:22,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:22,988 INFO L215 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] [2024-11-07 00:31:22,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-07 00:31:22,988 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:22,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:22,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1997555533, now seen corresponding path program 1 times [2024-11-07 00:31:22,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:22,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170802981] [2024-11-07 00:31:22,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:22,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:23,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:23,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:23,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170802981] [2024-11-07 00:31:23,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170802981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:31:23,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:31:23,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-07 00:31:23,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954213425] [2024-11-07 00:31:23,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:31:23,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 00:31:23,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:23,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 00:31:23,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:31:23,859 INFO L87 Difference]: Start difference. First operand 176 states and 210 transitions. Second operand has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 18 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:25,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:25,399 INFO L93 Difference]: Finished difference Result 386 states and 485 transitions. [2024-11-07 00:31:25,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 00:31:25,400 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 18 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-07 00:31:25,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:25,401 INFO L225 Difference]: With dead ends: 386 [2024-11-07 00:31:25,401 INFO L226 Difference]: Without dead ends: 380 [2024-11-07 00:31:25,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=231, Invalid=825, Unknown=0, NotChecked=0, Total=1056 [2024-11-07 00:31:25,406 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 1110 mSDsluCounter, 2533 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 2792 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:25,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 2792 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:31:25,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-11-07 00:31:25,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 193. [2024-11-07 00:31:25,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 189 states have (on average 1.2222222222222223) internal successors, (231), 192 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:25,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 231 transitions. [2024-11-07 00:31:25,413 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 231 transitions. Word has length 70 [2024-11-07 00:31:25,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:25,414 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 231 transitions. [2024-11-07 00:31:25,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 18 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:25,414 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 231 transitions. [2024-11-07 00:31:25,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-07 00:31:25,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:25,415 INFO L215 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] [2024-11-07 00:31:25,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-07 00:31:25,415 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:25,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:25,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1662348756, now seen corresponding path program 1 times [2024-11-07 00:31:25,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:25,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481819532] [2024-11-07 00:31:25,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:25,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:26,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:26,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:26,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481819532] [2024-11-07 00:31:26,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481819532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:31:26,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:31:26,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2024-11-07 00:31:26,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571086759] [2024-11-07 00:31:26,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:31:26,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-07 00:31:26,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:26,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-07 00:31:26,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2024-11-07 00:31:26,593 INFO L87 Difference]: Start difference. First operand 193 states and 231 transitions. Second operand has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:29,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:29,093 INFO L93 Difference]: Finished difference Result 567 states and 714 transitions. [2024-11-07 00:31:29,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-07 00:31:29,094 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-07 00:31:29,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:29,096 INFO L225 Difference]: With dead ends: 567 [2024-11-07 00:31:29,096 INFO L226 Difference]: Without dead ends: 559 [2024-11-07 00:31:29,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=273, Invalid=1449, Unknown=0, NotChecked=0, Total=1722 [2024-11-07 00:31:29,097 INFO L432 NwaCegarLoop]: 456 mSDtfsCounter, 1585 mSDsluCounter, 5449 mSDsCounter, 0 mSdLazyCounter, 2903 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 5905 SdHoareTripleChecker+Invalid, 2914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:29,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1585 Valid, 5905 Invalid, 2914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2903 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 00:31:29,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-11-07 00:31:29,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 202. [2024-11-07 00:31:29,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 198 states have (on average 1.2222222222222223) internal successors, (242), 201 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:29,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 242 transitions. [2024-11-07 00:31:29,102 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 242 transitions. Word has length 70 [2024-11-07 00:31:29,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:29,103 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 242 transitions. [2024-11-07 00:31:29,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:29,103 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 242 transitions. [2024-11-07 00:31:29,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-07 00:31:29,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:29,104 INFO L215 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] [2024-11-07 00:31:29,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-07 00:31:29,104 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:29,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:29,104 INFO L85 PathProgramCache]: Analyzing trace with hash -944822257, now seen corresponding path program 1 times [2024-11-07 00:31:29,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:29,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366558120] [2024-11-07 00:31:29,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:29,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:29,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:29,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:29,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366558120] [2024-11-07 00:31:29,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366558120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:31:29,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:31:29,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:31:29,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672277300] [2024-11-07 00:31:29,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:31:29,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 00:31:29,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:29,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 00:31:29,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:31:29,659 INFO L87 Difference]: Start difference. First operand 202 states and 242 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:30,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:30,188 INFO L93 Difference]: Finished difference Result 426 states and 542 transitions. [2024-11-07 00:31:30,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:31:30,189 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-07 00:31:30,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:30,190 INFO L225 Difference]: With dead ends: 426 [2024-11-07 00:31:30,190 INFO L226 Difference]: Without dead ends: 397 [2024-11-07 00:31:30,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-11-07 00:31:30,191 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 1026 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:30,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1026 Valid, 1196 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:31:30,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-07 00:31:30,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 173. [2024-11-07 00:31:30,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 170 states have (on average 1.2352941176470589) internal successors, (210), 172 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:30,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 210 transitions. [2024-11-07 00:31:30,199 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 210 transitions. Word has length 71 [2024-11-07 00:31:30,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:30,200 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 210 transitions. [2024-11-07 00:31:30,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:30,200 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 210 transitions. [2024-11-07 00:31:30,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-07 00:31:30,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:30,200 INFO L215 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] [2024-11-07 00:31:30,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-07 00:31:30,201 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:30,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:30,201 INFO L85 PathProgramCache]: Analyzing trace with hash -2112008133, now seen corresponding path program 1 times [2024-11-07 00:31:30,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:30,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625210784] [2024-11-07 00:31:30,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:30,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:30,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:30,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:30,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625210784] [2024-11-07 00:31:30,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625210784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:31:30,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:31:30,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 00:31:30,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165844703] [2024-11-07 00:31:30,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:31:30,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:31:30,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:30,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:31:30,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:31:30,601 INFO L87 Difference]: Start difference. First operand 173 states and 210 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:31,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:31,088 INFO L93 Difference]: Finished difference Result 240 states and 305 transitions. [2024-11-07 00:31:31,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:31:31,088 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-07 00:31:31,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:31,089 INFO L225 Difference]: With dead ends: 240 [2024-11-07 00:31:31,089 INFO L226 Difference]: Without dead ends: 234 [2024-11-07 00:31:31,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2024-11-07 00:31:31,090 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 696 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:31,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 1211 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:31:31,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-07 00:31:31,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 155. [2024-11-07 00:31:31,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 153 states have (on average 1.2352941176470589) internal successors, (189), 154 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:31,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 189 transitions. [2024-11-07 00:31:31,093 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 189 transitions. Word has length 71 [2024-11-07 00:31:31,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:31,094 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 189 transitions. [2024-11-07 00:31:31,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:31,094 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 189 transitions. [2024-11-07 00:31:31,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-07 00:31:31,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:31,094 INFO L215 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] [2024-11-07 00:31:31,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-07 00:31:31,094 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:31,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:31,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1776801356, now seen corresponding path program 1 times [2024-11-07 00:31:31,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:31,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650071836] [2024-11-07 00:31:31,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:31,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:31,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:31,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:31,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650071836] [2024-11-07 00:31:31,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650071836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:31:31,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:31:31,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 00:31:31,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583838098] [2024-11-07 00:31:31,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:31:31,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:31:31,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:31,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:31:31,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:31:31,545 INFO L87 Difference]: Start difference. First operand 155 states and 189 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:31,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:31,932 INFO L93 Difference]: Finished difference Result 228 states and 291 transitions. [2024-11-07 00:31:31,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:31:31,932 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-07 00:31:31,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:31,933 INFO L225 Difference]: With dead ends: 228 [2024-11-07 00:31:31,933 INFO L226 Difference]: Without dead ends: 213 [2024-11-07 00:31:31,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2024-11-07 00:31:31,935 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 534 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:31,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 1323 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:31:31,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-07 00:31:31,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 129. [2024-11-07 00:31:31,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.2421875) internal successors, (159), 128 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:31,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 159 transitions. [2024-11-07 00:31:31,941 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 159 transitions. Word has length 71 [2024-11-07 00:31:31,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:31,941 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 159 transitions. [2024-11-07 00:31:31,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:31,941 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 159 transitions. [2024-11-07 00:31:31,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 00:31:31,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:31,941 INFO L215 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] [2024-11-07 00:31:31,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-07 00:31:31,942 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:31,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:31,942 INFO L85 PathProgramCache]: Analyzing trace with hash 161471129, now seen corresponding path program 1 times [2024-11-07 00:31:31,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:31,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596123274] [2024-11-07 00:31:31,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:31,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:32,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:32,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:32,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596123274] [2024-11-07 00:31:32,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596123274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:31:32,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:31:32,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:31:32,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941909371] [2024-11-07 00:31:32,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:31:32,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:31:32,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:32,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:31:32,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:31:32,082 INFO L87 Difference]: Start difference. First operand 129 states and 159 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:32,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:32,263 INFO L93 Difference]: Finished difference Result 561 states and 791 transitions. [2024-11-07 00:31:32,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 00:31:32,263 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-11-07 00:31:32,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:32,265 INFO L225 Difference]: With dead ends: 561 [2024-11-07 00:31:32,265 INFO L226 Difference]: Without dead ends: 507 [2024-11-07 00:31:32,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:31:32,268 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 834 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:32,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 1258 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:31:32,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2024-11-07 00:31:32,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 181. [2024-11-07 00:31:32,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.3055555555555556) internal successors, (235), 180 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:32,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 235 transitions. [2024-11-07 00:31:32,277 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 235 transitions. Word has length 93 [2024-11-07 00:31:32,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:32,277 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 235 transitions. [2024-11-07 00:31:32,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:32,278 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 235 transitions. [2024-11-07 00:31:32,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 00:31:32,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:32,278 INFO L215 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] [2024-11-07 00:31:32,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-07 00:31:32,279 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:32,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:32,279 INFO L85 PathProgramCache]: Analyzing trace with hash -880942767, now seen corresponding path program 1 times [2024-11-07 00:31:32,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:32,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132567703] [2024-11-07 00:31:32,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:32,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:32,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:32,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:32,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132567703] [2024-11-07 00:31:32,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132567703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:31:32,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:31:32,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:31:32,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685079083] [2024-11-07 00:31:32,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:31:32,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:31:32,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:32,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:31:32,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:31:32,394 INFO L87 Difference]: Start difference. First operand 181 states and 235 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:32,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:32,462 INFO L93 Difference]: Finished difference Result 659 states and 932 transitions. [2024-11-07 00:31:32,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:31:32,463 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-11-07 00:31:32,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:32,464 INFO L225 Difference]: With dead ends: 659 [2024-11-07 00:31:32,465 INFO L226 Difference]: Without dead ends: 553 [2024-11-07 00:31:32,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:31:32,465 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 642 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:32,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 752 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:31:32,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-07 00:31:32,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 285. [2024-11-07 00:31:32,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 1.3661971830985915) internal successors, (388), 284 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:32,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 388 transitions. [2024-11-07 00:31:32,476 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 388 transitions. Word has length 95 [2024-11-07 00:31:32,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:32,476 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 388 transitions. [2024-11-07 00:31:32,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:32,476 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 388 transitions. [2024-11-07 00:31:32,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 00:31:32,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:32,477 INFO L215 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] [2024-11-07 00:31:32,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-07 00:31:32,477 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:32,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:32,478 INFO L85 PathProgramCache]: Analyzing trace with hash 284809815, now seen corresponding path program 1 times [2024-11-07 00:31:32,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:32,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191524831] [2024-11-07 00:31:32,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:32,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:32,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:32,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:32,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191524831] [2024-11-07 00:31:32,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191524831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:31:32,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:31:32,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:31:32,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213040244] [2024-11-07 00:31:32,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:31:32,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:31:32,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:32,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:31:32,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:31:32,575 INFO L87 Difference]: Start difference. First operand 285 states and 388 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:32,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:32,643 INFO L93 Difference]: Finished difference Result 763 states and 1085 transitions. [2024-11-07 00:31:32,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:31:32,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-11-07 00:31:32,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:32,645 INFO L225 Difference]: With dead ends: 763 [2024-11-07 00:31:32,645 INFO L226 Difference]: Without dead ends: 657 [2024-11-07 00:31:32,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:31:32,646 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 642 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:32,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 702 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:31:32,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2024-11-07 00:31:32,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 441. [2024-11-07 00:31:32,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 440 states have (on average 1.4022727272727273) internal successors, (617), 440 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:32,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 617 transitions. [2024-11-07 00:31:32,653 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 617 transitions. Word has length 95 [2024-11-07 00:31:32,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:32,654 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 617 transitions. [2024-11-07 00:31:32,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:32,654 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 617 transitions. [2024-11-07 00:31:32,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 00:31:32,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:32,655 INFO L215 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] [2024-11-07 00:31:32,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-07 00:31:32,655 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:32,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:32,656 INFO L85 PathProgramCache]: Analyzing trace with hash -736748582, now seen corresponding path program 1 times [2024-11-07 00:31:32,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:32,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332944969] [2024-11-07 00:31:32,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:32,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:32,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:32,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:32,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332944969] [2024-11-07 00:31:32,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332944969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:31:32,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:31:32,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:31:32,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120851528] [2024-11-07 00:31:32,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:31:32,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:31:32,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:32,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:31:32,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:31:32,857 INFO L87 Difference]: Start difference. First operand 441 states and 617 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:32,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:32,934 INFO L93 Difference]: Finished difference Result 809 states and 1155 transitions. [2024-11-07 00:31:32,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:31:32,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-11-07 00:31:32,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:32,937 INFO L225 Difference]: With dead ends: 809 [2024-11-07 00:31:32,937 INFO L226 Difference]: Without dead ends: 443 [2024-11-07 00:31:32,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:31:32,938 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 74 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:32,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 451 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:31:32,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-07 00:31:32,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 441. [2024-11-07 00:31:32,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 440 states have (on average 1.393181818181818) internal successors, (613), 440 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:32,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 613 transitions. [2024-11-07 00:31:32,957 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 613 transitions. Word has length 95 [2024-11-07 00:31:32,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:32,958 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 613 transitions. [2024-11-07 00:31:32,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:32,958 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 613 transitions. [2024-11-07 00:31:32,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 00:31:32,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:32,961 INFO L215 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] [2024-11-07 00:31:32,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-07 00:31:32,961 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:32,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:32,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1506041575, now seen corresponding path program 1 times [2024-11-07 00:31:32,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:32,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895180184] [2024-11-07 00:31:32,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:32,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:33,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:33,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:33,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895180184] [2024-11-07 00:31:33,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895180184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:31:33,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:31:33,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:31:33,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237954511] [2024-11-07 00:31:33,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:31:33,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:31:33,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:33,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:31:33,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:31:33,007 INFO L87 Difference]: Start difference. First operand 441 states and 613 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:33,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:33,025 INFO L93 Difference]: Finished difference Result 1128 states and 1604 transitions. [2024-11-07 00:31:33,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:31:33,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-11-07 00:31:33,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:33,028 INFO L225 Difference]: With dead ends: 1128 [2024-11-07 00:31:33,028 INFO L226 Difference]: Without dead ends: 762 [2024-11-07 00:31:33,028 INFO L431 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 [2024-11-07 00:31:33,029 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 66 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:33,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 365 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:31:33,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2024-11-07 00:31:33,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 760. [2024-11-07 00:31:33,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 759 states have (on average 1.391304347826087) internal successors, (1056), 759 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:33,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1056 transitions. [2024-11-07 00:31:33,039 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1056 transitions. Word has length 95 [2024-11-07 00:31:33,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:33,040 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 1056 transitions. [2024-11-07 00:31:33,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:33,040 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1056 transitions. [2024-11-07 00:31:33,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 00:31:33,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:33,041 INFO L215 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] [2024-11-07 00:31:33,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-07 00:31:33,041 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:33,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:33,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1675387619, now seen corresponding path program 1 times [2024-11-07 00:31:33,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:33,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965945677] [2024-11-07 00:31:33,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:33,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:33,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:33,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:33,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:33,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965945677] [2024-11-07 00:31:33,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965945677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:31:33,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:31:33,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:31:33,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189545078] [2024-11-07 00:31:33,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:31:33,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:31:33,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:33,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:31:33,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:31:33,135 INFO L87 Difference]: Start difference. First operand 760 states and 1056 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:33,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:33,209 INFO L93 Difference]: Finished difference Result 1550 states and 2181 transitions. [2024-11-07 00:31:33,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:31:33,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-11-07 00:31:33,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:33,215 INFO L225 Difference]: With dead ends: 1550 [2024-11-07 00:31:33,215 INFO L226 Difference]: Without dead ends: 1353 [2024-11-07 00:31:33,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:31:33,216 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 607 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:33,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 760 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:31:33,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2024-11-07 00:31:33,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 955. [2024-11-07 00:31:33,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 954 states have (on average 1.39832285115304) internal successors, (1334), 954 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:33,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1334 transitions. [2024-11-07 00:31:33,229 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1334 transitions. Word has length 95 [2024-11-07 00:31:33,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:33,229 INFO L471 AbstractCegarLoop]: Abstraction has 955 states and 1334 transitions. [2024-11-07 00:31:33,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:33,230 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1334 transitions. [2024-11-07 00:31:33,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 00:31:33,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:33,230 INFO L215 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] [2024-11-07 00:31:33,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-07 00:31:33,231 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:33,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:33,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1554031907, now seen corresponding path program 1 times [2024-11-07 00:31:33,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:33,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025144233] [2024-11-07 00:31:33,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:33,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:33,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:33,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:33,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025144233] [2024-11-07 00:31:33,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025144233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:31:33,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:31:33,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:31:33,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654599149] [2024-11-07 00:31:33,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:31:33,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:31:33,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:33,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:31:33,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:31:33,328 INFO L87 Difference]: Start difference. First operand 955 states and 1334 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:33,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:33,406 INFO L93 Difference]: Finished difference Result 1745 states and 2459 transitions. [2024-11-07 00:31:33,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:31:33,406 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-11-07 00:31:33,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:33,410 INFO L225 Difference]: With dead ends: 1745 [2024-11-07 00:31:33,411 INFO L226 Difference]: Without dead ends: 1548 [2024-11-07 00:31:33,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:31:33,412 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 577 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:33,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 807 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:31:33,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2024-11-07 00:31:33,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1150. [2024-11-07 00:31:33,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 1149 states have (on average 1.4029590948651) internal successors, (1612), 1149 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:33,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1612 transitions. [2024-11-07 00:31:33,428 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1612 transitions. Word has length 95 [2024-11-07 00:31:33,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:33,428 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1612 transitions. [2024-11-07 00:31:33,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:33,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1612 transitions. [2024-11-07 00:31:33,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 00:31:33,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:33,429 INFO L215 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] [2024-11-07 00:31:33,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-07 00:31:33,430 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:33,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:33,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1423537109, now seen corresponding path program 1 times [2024-11-07 00:31:33,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:33,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083612767] [2024-11-07 00:31:33,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:33,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:33,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:33,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:33,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:33,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083612767] [2024-11-07 00:31:33,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083612767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:31:33,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:31:33,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:31:33,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351891868] [2024-11-07 00:31:33,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:31:33,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:31:33,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:33,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:31:33,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:31:33,514 INFO L87 Difference]: Start difference. First operand 1150 states and 1612 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:33,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:33,533 INFO L93 Difference]: Finished difference Result 2882 states and 4059 transitions. [2024-11-07 00:31:33,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:31:33,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-11-07 00:31:33,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:33,538 INFO L225 Difference]: With dead ends: 2882 [2024-11-07 00:31:33,538 INFO L226 Difference]: Without dead ends: 1807 [2024-11-07 00:31:33,540 INFO L431 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 [2024-11-07 00:31:33,540 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 77 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:33,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 341 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:31:33,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1807 states. [2024-11-07 00:31:33,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1807 to 1717. [2024-11-07 00:31:33,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1717 states, 1716 states have (on average 1.3951048951048952) internal successors, (2394), 1716 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:33,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 2394 transitions. [2024-11-07 00:31:33,602 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 2394 transitions. Word has length 96 [2024-11-07 00:31:33,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:33,602 INFO L471 AbstractCegarLoop]: Abstraction has 1717 states and 2394 transitions. [2024-11-07 00:31:33,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:33,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 2394 transitions. [2024-11-07 00:31:33,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 00:31:33,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:33,603 INFO L215 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] [2024-11-07 00:31:33,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-07 00:31:33,604 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:33,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:33,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1571382276, now seen corresponding path program 1 times [2024-11-07 00:31:33,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:33,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211778692] [2024-11-07 00:31:33,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:33,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:33,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:33,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:33,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211778692] [2024-11-07 00:31:33,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211778692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:31:33,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:31:33,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:31:33,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930329248] [2024-11-07 00:31:33,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:31:33,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:31:33,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:33,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:31:33,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:31:33,826 INFO L87 Difference]: Start difference. First operand 1717 states and 2394 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:33,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:33,879 INFO L93 Difference]: Finished difference Result 4869 states and 6791 transitions. [2024-11-07 00:31:33,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:31:33,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2024-11-07 00:31:33,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:33,896 INFO L225 Difference]: With dead ends: 4869 [2024-11-07 00:31:33,900 INFO L226 Difference]: Without dead ends: 3227 [2024-11-07 00:31:33,904 INFO L431 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 [2024-11-07 00:31:33,908 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 70 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:33,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 341 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:31:33,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3227 states. [2024-11-07 00:31:34,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3227 to 3093. [2024-11-07 00:31:34,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3093 states, 3092 states have (on average 1.3835705045278137) internal successors, (4278), 3092 states have internal predecessors, (4278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:34,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3093 states to 3093 states and 4278 transitions. [2024-11-07 00:31:34,023 INFO L78 Accepts]: Start accepts. Automaton has 3093 states and 4278 transitions. Word has length 97 [2024-11-07 00:31:34,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:34,026 INFO L471 AbstractCegarLoop]: Abstraction has 3093 states and 4278 transitions. [2024-11-07 00:31:34,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:34,026 INFO L276 IsEmpty]: Start isEmpty. Operand 3093 states and 4278 transitions. [2024-11-07 00:31:34,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 00:31:34,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:34,027 INFO L215 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] [2024-11-07 00:31:34,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-07 00:31:34,027 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:34,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:34,028 INFO L85 PathProgramCache]: Analyzing trace with hash 584515800, now seen corresponding path program 1 times [2024-11-07 00:31:34,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:34,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960601424] [2024-11-07 00:31:34,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:34,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:34,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:34,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:34,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:34,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960601424] [2024-11-07 00:31:34,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960601424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:31:34,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:31:34,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:31:34,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400652844] [2024-11-07 00:31:34,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:31:34,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:31:34,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:34,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:31:34,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:31:34,195 INFO L87 Difference]: Start difference. First operand 3093 states and 4278 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:34,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:34,251 INFO L93 Difference]: Finished difference Result 8865 states and 12212 transitions. [2024-11-07 00:31:34,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:31:34,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2024-11-07 00:31:34,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:34,269 INFO L225 Difference]: With dead ends: 8865 [2024-11-07 00:31:34,269 INFO L226 Difference]: Without dead ends: 5847 [2024-11-07 00:31:34,282 INFO L431 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 [2024-11-07 00:31:34,283 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 63 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:34,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 340 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:31:34,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5847 states. [2024-11-07 00:31:34,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5847 to 5581. [2024-11-07 00:31:34,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5581 states, 5580 states have (on average 1.3650537634408602) internal successors, (7617), 5580 states have internal predecessors, (7617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:34,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5581 states to 5581 states and 7617 transitions. [2024-11-07 00:31:34,437 INFO L78 Accepts]: Start accepts. Automaton has 5581 states and 7617 transitions. Word has length 98 [2024-11-07 00:31:34,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:34,440 INFO L471 AbstractCegarLoop]: Abstraction has 5581 states and 7617 transitions. [2024-11-07 00:31:34,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:34,440 INFO L276 IsEmpty]: Start isEmpty. Operand 5581 states and 7617 transitions. [2024-11-07 00:31:34,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 00:31:34,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:34,441 INFO L215 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] [2024-11-07 00:31:34,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-07 00:31:34,441 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:34,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:34,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1344323197, now seen corresponding path program 1 times [2024-11-07 00:31:34,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:34,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045056500] [2024-11-07 00:31:34,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:34,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:34,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:34,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:34,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045056500] [2024-11-07 00:31:34,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045056500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:31:34,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:31:34,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:31:34,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684394363] [2024-11-07 00:31:34,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:31:34,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:31:34,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:34,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:31:34,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:31:34,600 INFO L87 Difference]: Start difference. First operand 5581 states and 7617 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:34,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:34,686 INFO L93 Difference]: Finished difference Result 16065 states and 21767 transitions. [2024-11-07 00:31:34,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:31:34,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2024-11-07 00:31:34,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:34,726 INFO L225 Difference]: With dead ends: 16065 [2024-11-07 00:31:34,730 INFO L226 Difference]: Without dead ends: 10559 [2024-11-07 00:31:34,745 INFO L431 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 [2024-11-07 00:31:34,746 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 53 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:34,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 338 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:31:34,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10559 states. [2024-11-07 00:31:34,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10559 to 10029. [2024-11-07 00:31:34,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10029 states, 10028 states have (on average 1.3399481451934583) internal successors, (13437), 10028 states have internal predecessors, (13437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:34,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10029 states to 10029 states and 13437 transitions. [2024-11-07 00:31:34,926 INFO L78 Accepts]: Start accepts. Automaton has 10029 states and 13437 transitions. Word has length 99 [2024-11-07 00:31:34,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:34,927 INFO L471 AbstractCegarLoop]: Abstraction has 10029 states and 13437 transitions. [2024-11-07 00:31:34,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:34,928 INFO L276 IsEmpty]: Start isEmpty. Operand 10029 states and 13437 transitions. [2024-11-07 00:31:34,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 00:31:34,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:34,928 INFO L215 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] [2024-11-07 00:31:34,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-07 00:31:34,929 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:34,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:34,929 INFO L85 PathProgramCache]: Analyzing trace with hash -445596435, now seen corresponding path program 1 times [2024-11-07 00:31:34,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:34,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028555768] [2024-11-07 00:31:34,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:34,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:34,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:35,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:35,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:35,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028555768] [2024-11-07 00:31:35,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028555768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:31:35,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:31:35,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:31:35,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376004777] [2024-11-07 00:31:35,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:31:35,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:31:35,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:35,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:31:35,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:31:35,182 INFO L87 Difference]: Start difference. First operand 10029 states and 13437 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:35,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:35,296 INFO L93 Difference]: Finished difference Result 10271 states and 13758 transitions. [2024-11-07 00:31:35,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:31:35,299 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2024-11-07 00:31:35,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:35,318 INFO L225 Difference]: With dead ends: 10271 [2024-11-07 00:31:35,318 INFO L226 Difference]: Without dead ends: 10269 [2024-11-07 00:31:35,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:31:35,324 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:35,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 758 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:31:35,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10269 states. [2024-11-07 00:31:35,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10269 to 10269. [2024-11-07 00:31:35,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10269 states, 10268 states have (on average 1.322652902220491) internal successors, (13581), 10268 states have internal predecessors, (13581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:35,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10269 states to 10269 states and 13581 transitions. [2024-11-07 00:31:35,542 INFO L78 Accepts]: Start accepts. Automaton has 10269 states and 13581 transitions. Word has length 100 [2024-11-07 00:31:35,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:35,544 INFO L471 AbstractCegarLoop]: Abstraction has 10269 states and 13581 transitions. [2024-11-07 00:31:35,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:35,545 INFO L276 IsEmpty]: Start isEmpty. Operand 10269 states and 13581 transitions. [2024-11-07 00:31:35,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 00:31:35,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:35,546 INFO L215 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] [2024-11-07 00:31:35,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-07 00:31:35,547 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:35,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:35,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1981290545, now seen corresponding path program 1 times [2024-11-07 00:31:35,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:35,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852103859] [2024-11-07 00:31:35,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:35,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:35,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:35,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:35,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852103859] [2024-11-07 00:31:35,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852103859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:31:35,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:31:35,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:31:35,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575479981] [2024-11-07 00:31:35,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:31:35,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:31:35,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:35,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:31:35,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:31:35,595 INFO L87 Difference]: Start difference. First operand 10269 states and 13581 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:35,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:35,651 INFO L93 Difference]: Finished difference Result 20785 states and 27511 transitions. [2024-11-07 00:31:35,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:31:35,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2024-11-07 00:31:35,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:35,674 INFO L225 Difference]: With dead ends: 20785 [2024-11-07 00:31:35,674 INFO L226 Difference]: Without dead ends: 10591 [2024-11-07 00:31:35,685 INFO L431 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 [2024-11-07 00:31:35,686 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 86 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:35,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 280 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:31:35,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10591 states. [2024-11-07 00:31:35,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10591 to 10589. [2024-11-07 00:31:35,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10589 states, 10588 states have (on average 1.305723460521345) internal successors, (13825), 10588 states have internal predecessors, (13825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:35,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10589 states to 10589 states and 13825 transitions. [2024-11-07 00:31:35,888 INFO L78 Accepts]: Start accepts. Automaton has 10589 states and 13825 transitions. Word has length 100 [2024-11-07 00:31:35,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:35,888 INFO L471 AbstractCegarLoop]: Abstraction has 10589 states and 13825 transitions. [2024-11-07 00:31:35,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:35,888 INFO L276 IsEmpty]: Start isEmpty. Operand 10589 states and 13825 transitions. [2024-11-07 00:31:35,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-07 00:31:35,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:35,891 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:31:35,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-07 00:31:35,892 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:35,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:35,892 INFO L85 PathProgramCache]: Analyzing trace with hash 642240657, now seen corresponding path program 1 times [2024-11-07 00:31:35,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:35,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146774304] [2024-11-07 00:31:35,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:35,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:36,396 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:36,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:36,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146774304] [2024-11-07 00:31:36,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146774304] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:31:36,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733969107] [2024-11-07 00:31:36,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:36,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:31:36,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:31:36,402 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:31:36,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 00:31:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:36,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-07 00:31:36,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:31:37,565 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:37,565 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:31:38,922 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:38,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733969107] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:31:38,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:31:38,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 30 [2024-11-07 00:31:38,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692544116] [2024-11-07 00:31:38,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:31:38,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-07 00:31:38,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:38,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-07 00:31:38,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2024-11-07 00:31:38,925 INFO L87 Difference]: Start difference. First operand 10589 states and 13825 transitions. Second operand has 31 states, 31 states have (on average 11.064516129032258) internal successors, (343), 30 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:49,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:31:49,256 INFO L93 Difference]: Finished difference Result 91528 states and 119238 transitions. [2024-11-07 00:31:49,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2024-11-07 00:31:49,256 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 11.064516129032258) internal successors, (343), 30 states have internal predecessors, (343), 0 states have call successors, (0), 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 [2024-11-07 00:31:49,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:31:49,517 INFO L225 Difference]: With dead ends: 91528 [2024-11-07 00:31:49,520 INFO L226 Difference]: Without dead ends: 81014 [2024-11-07 00:31:49,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10670 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=4750, Invalid=27470, Unknown=0, NotChecked=0, Total=32220 [2024-11-07 00:31:49,597 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 4020 mSDsluCounter, 3187 mSDsCounter, 0 mSdLazyCounter, 4637 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4020 SdHoareTripleChecker+Valid, 3412 SdHoareTripleChecker+Invalid, 4725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 4637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:31:49,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4020 Valid, 3412 Invalid, 4725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 4637 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-07 00:31:49,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81014 states. [2024-11-07 00:31:50,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81014 to 53369. [2024-11-07 00:31:51,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53369 states, 53368 states have (on average 1.2972005696297406) internal successors, (69229), 53368 states have internal predecessors, (69229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:51,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53369 states to 53369 states and 69229 transitions. [2024-11-07 00:31:51,230 INFO L78 Accepts]: Start accepts. Automaton has 53369 states and 69229 transitions. Word has length 127 [2024-11-07 00:31:51,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:31:51,231 INFO L471 AbstractCegarLoop]: Abstraction has 53369 states and 69229 transitions. [2024-11-07 00:31:51,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 11.064516129032258) internal successors, (343), 30 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:31:51,231 INFO L276 IsEmpty]: Start isEmpty. Operand 53369 states and 69229 transitions. [2024-11-07 00:31:51,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-07 00:31:51,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:31:51,252 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:31:51,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 00:31:51,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2024-11-07 00:31:51,457 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:31:51,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:31:51,461 INFO L85 PathProgramCache]: Analyzing trace with hash -895889741, now seen corresponding path program 1 times [2024-11-07 00:31:51,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:31:51,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702056621] [2024-11-07 00:31:51,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:51,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:31:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:52,420 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:52,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:31:52,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702056621] [2024-11-07 00:31:52,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702056621] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:31:52,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237066783] [2024-11-07 00:31:52,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:31:52,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:31:52,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:31:52,424 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:31:52,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 00:31:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:31:52,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 00:31:52,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:31:53,377 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:53,377 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:31:54,000 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:31:54,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237066783] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:31:54,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:31:54,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 27 [2024-11-07 00:31:54,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502078203] [2024-11-07 00:31:54,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:31:54,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-07 00:31:54,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:31:54,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-07 00:31:54,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=622, Unknown=0, NotChecked=0, Total=702 [2024-11-07 00:31:54,006 INFO L87 Difference]: Start difference. First operand 53369 states and 69229 transitions. Second operand has 27 states, 27 states have (on average 12.666666666666666) internal successors, (342), 27 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:00,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:00,010 INFO L93 Difference]: Finished difference Result 266571 states and 347338 transitions. [2024-11-07 00:32:00,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2024-11-07 00:32:00,011 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 12.666666666666666) internal successors, (342), 27 states have internal predecessors, (342), 0 states have call successors, (0), 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 [2024-11-07 00:32:00,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:00,363 INFO L225 Difference]: With dead ends: 266571 [2024-11-07 00:32:00,363 INFO L226 Difference]: Without dead ends: 213340 [2024-11-07 00:32:01,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4427 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2065, Invalid=12215, Unknown=0, NotChecked=0, Total=14280 [2024-11-07 00:32:01,181 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 4135 mSDsluCounter, 2633 mSDsCounter, 0 mSdLazyCounter, 2586 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4135 SdHoareTripleChecker+Valid, 2837 SdHoareTripleChecker+Invalid, 2628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:01,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4135 Valid, 2837 Invalid, 2628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2586 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 00:32:01,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213340 states. [2024-11-07 00:32:03,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213340 to 132282. [2024-11-07 00:32:04,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132282 states, 132281 states have (on average 1.2940331566891692) internal successors, (171176), 132281 states have internal predecessors, (171176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:04,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132282 states to 132282 states and 171176 transitions. [2024-11-07 00:32:04,842 INFO L78 Accepts]: Start accepts. Automaton has 132282 states and 171176 transitions. Word has length 128 [2024-11-07 00:32:04,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:04,843 INFO L471 AbstractCegarLoop]: Abstraction has 132282 states and 171176 transitions. [2024-11-07 00:32:04,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 12.666666666666666) internal successors, (342), 27 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:04,843 INFO L276 IsEmpty]: Start isEmpty. Operand 132282 states and 171176 transitions. [2024-11-07 00:32:04,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 00:32:04,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:04,871 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:32:04,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 00:32:05,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:32:05,072 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-07 00:32:05,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:05,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1950563265, now seen corresponding path program 1 times [2024-11-07 00:32:05,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:05,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148562951] [2024-11-07 00:32:05,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:05,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:05,833 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:05,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:05,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148562951] [2024-11-07 00:32:05,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148562951] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:32:05,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081916575] [2024-11-07 00:32:05,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:05,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:32:05,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:32:05,836 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:32:05,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 00:32:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:06,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-07 00:32:06,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:32:06,995 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:06,996 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:32:07,973 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:32:07,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081916575] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:32:07,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:32:07,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 9, 9] total 32 [2024-11-07 00:32:07,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165559385] [2024-11-07 00:32:07,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:32:07,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-07 00:32:07,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:07,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-07 00:32:07,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=906, Unknown=0, NotChecked=0, Total=992 [2024-11-07 00:32:07,979 INFO L87 Difference]: Start difference. First operand 132282 states and 171176 transitions. Second operand has 32 states, 32 states have (on average 10.75) internal successors, (344), 32 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)