./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.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.5.ufo.BOUNDED-10.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', '8381803db0f296b6c475c94ca7dd8f9a2c79c383b82b37638a653c8556f3f15c'] 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.5.ufo.BOUNDED-10.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 8381803db0f296b6c475c94ca7dd8f9a2c79c383b82b37638a653c8556f3f15c --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:32:32,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:32:32,713 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:32:32,719 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:32:32,720 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:32:32,748 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:32:32,750 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:32:32,750 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:32:32,750 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:32:32,750 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:32:32,751 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:32:32,751 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:32:32,751 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:32:32,751 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:32:32,751 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:32:32,751 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:32:32,751 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:32:32,751 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:32:32,751 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:32:32,751 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:32:32,752 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:32:32,752 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:32:32,752 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:32:32,752 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:32:32,752 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:32:32,752 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:32:32,752 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:32:32,752 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:32:32,752 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:32:32,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:32:32,752 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:32:32,752 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:32:32,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:32:32,755 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:32:32,755 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:32:32,756 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:32:32,756 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:32:32,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:32:32,756 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:32:32,756 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:32:32,756 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:32:32,756 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:32:32,756 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 -> 8381803db0f296b6c475c94ca7dd8f9a2c79c383b82b37638a653c8556f3f15c [2024-11-07 00:32:33,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:32:33,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:32:33,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:32:33,057 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:32:33,057 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:32:33,058 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2024-11-07 00:32:34,361 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:32:34,836 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:32:34,837 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2024-11-07 00:32:34,867 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f3d594dd/071d1a28dfab4caaa2e41fa05ec06e09/FLAG148879ae1 [2024-11-07 00:32:34,887 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f3d594dd/071d1a28dfab4caaa2e41fa05ec06e09 [2024-11-07 00:32:34,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:32:34,891 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:32:34,893 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:32:34,893 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:32:34,901 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:32:34,902 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:32:34" (1/1) ... [2024-11-07 00:32:34,903 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19fbc235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:34, skipping insertion in model container [2024-11-07 00:32:34,903 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:32:34" (1/1) ... [2024-11-07 00:32:34,998 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:32:35,290 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[11561,11574] [2024-11-07 00:32:35,316 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[15618,15631] [2024-11-07 00:32:35,323 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[16839,16852] [2024-11-07 00:32:35,327 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[17545,17558] [2024-11-07 00:32:35,335 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[19131,19144] [2024-11-07 00:32:35,338 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[19837,19850] [2024-11-07 00:32:35,343 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[20908,20921] [2024-11-07 00:32:35,353 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[23398,23411] [2024-11-07 00:32:35,356 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[24107,24120] [2024-11-07 00:32:35,364 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[25144,25157] [2024-11-07 00:32:35,372 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[27082,27095] [2024-11-07 00:32:35,388 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[31116,31129] [2024-11-07 00:32:35,392 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[31825,31838] [2024-11-07 00:32:35,396 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[32899,32912] [2024-11-07 00:32:35,406 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[34874,34887] [2024-11-07 00:32:35,417 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[38255,38268] [2024-11-07 00:32:35,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:32:35,584 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:32:35,618 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[11561,11574] [2024-11-07 00:32:35,630 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[15618,15631] [2024-11-07 00:32:35,636 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[16839,16852] [2024-11-07 00:32:35,639 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[17545,17558] [2024-11-07 00:32:35,661 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[19131,19144] [2024-11-07 00:32:35,663 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[19837,19850] [2024-11-07 00:32:35,670 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[20908,20921] [2024-11-07 00:32:35,676 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[23398,23411] [2024-11-07 00:32:35,679 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[24107,24120] [2024-11-07 00:32:35,682 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[25144,25157] [2024-11-07 00:32:35,687 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[27082,27095] [2024-11-07 00:32:35,696 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[31116,31129] [2024-11-07 00:32:35,698 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[31825,31838] [2024-11-07 00:32:35,701 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[32899,32912] [2024-11-07 00:32:35,706 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[34874,34887] [2024-11-07 00:32:35,713 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.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[38255,38268] [2024-11-07 00:32:35,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:32:35,819 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:32:35,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:35 WrapperNode [2024-11-07 00:32:35,820 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:32:35,821 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:32:35,821 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:32:35,822 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:32:35,827 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:32:35" (1/1) ... [2024-11-07 00:32:35,855 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:32:35" (1/1) ... [2024-11-07 00:32:35,942 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3756 [2024-11-07 00:32:35,943 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:32:35,944 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:32:35,944 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:32:35,944 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:32:35,951 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:35" (1/1) ... [2024-11-07 00:32:35,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:35" (1/1) ... [2024-11-07 00:32:35,966 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:35" (1/1) ... [2024-11-07 00:32:36,014 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:32:36,018 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:35" (1/1) ... [2024-11-07 00:32:36,018 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:35" (1/1) ... [2024-11-07 00:32:36,065 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:35" (1/1) ... [2024-11-07 00:32:36,090 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:35" (1/1) ... [2024-11-07 00:32:36,112 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:35" (1/1) ... [2024-11-07 00:32:36,123 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:35" (1/1) ... [2024-11-07 00:32:36,138 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:32:36,140 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:32:36,140 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:32:36,140 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:32:36,142 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:35" (1/1) ... [2024-11-07 00:32:36,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:32:36,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:32:36,178 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:32:36,182 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:32:36,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:32:36,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:32:36,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:32:36,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:32:36,469 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:32:36,471 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:32:38,708 INFO L? ?]: Removed 602 outVars from TransFormulas that were not future-live. [2024-11-07 00:32:38,708 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:32:38,748 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:32:38,752 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 00:32:38,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:32:38 BoogieIcfgContainer [2024-11-07 00:32:38,753 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:32:38,755 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:32:38,755 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:32:38,762 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:32:38,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:32:34" (1/3) ... [2024-11-07 00:32:38,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7045e8e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:32:38, skipping insertion in model container [2024-11-07 00:32:38,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:32:35" (2/3) ... [2024-11-07 00:32:38,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7045e8e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:32:38, skipping insertion in model container [2024-11-07 00:32:38,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:32:38" (3/3) ... [2024-11-07 00:32:38,765 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2024-11-07 00:32:38,779 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:32:38,779 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-11-07 00:32:38,860 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:32:38,871 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6eca5b20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:32:38,871 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-07 00:32:38,880 INFO L276 IsEmpty]: Start isEmpty. Operand has 629 states, 612 states have (on average 1.8480392156862746) internal successors, (1131), 628 states have internal predecessors, (1131), 0 states have call successors, (0), 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:38,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 00:32:38,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:38,899 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] [2024-11-07 00:32:38,899 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:38,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:38,905 INFO L85 PathProgramCache]: Analyzing trace with hash -729096350, now seen corresponding path program 1 times [2024-11-07 00:32:38,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:38,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337700585] [2024-11-07 00:32:38,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:38,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:39,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:32:39,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:39,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337700585] [2024-11-07 00:32:39,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337700585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:39,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:39,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:32:39,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498261532] [2024-11-07 00:32:39,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:39,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:32:39,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:39,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:32:39,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:32:39,632 INFO L87 Difference]: Start difference. First operand has 629 states, 612 states have (on average 1.8480392156862746) internal successors, (1131), 628 states have internal predecessors, (1131), 0 states have call successors, (0), 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 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:40,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:40,178 INFO L93 Difference]: Finished difference Result 976 states and 1692 transitions. [2024-11-07 00:32:40,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:32:40,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-07 00:32:40,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:40,192 INFO L225 Difference]: With dead ends: 976 [2024-11-07 00:32:40,196 INFO L226 Difference]: Without dead ends: 504 [2024-11-07 00:32:40,200 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:32:40,203 INFO L432 NwaCegarLoop]: 591 mSDtfsCounter, 2533 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2533 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:40,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2533 Valid, 621 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:32:40,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2024-11-07 00:32:40,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2024-11-07 00:32:40,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 488 states have (on average 1.305327868852459) internal successors, (637), 503 states have internal predecessors, (637), 0 states have call successors, (0), 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:40,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 637 transitions. [2024-11-07 00:32:40,265 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 637 transitions. Word has length 72 [2024-11-07 00:32:40,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:40,266 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 637 transitions. [2024-11-07 00:32:40,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:40,267 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 637 transitions. [2024-11-07 00:32:40,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 00:32:40,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:40,274 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] [2024-11-07 00:32:40,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:32:40,275 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:40,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:40,275 INFO L85 PathProgramCache]: Analyzing trace with hash -2012921467, now seen corresponding path program 1 times [2024-11-07 00:32:40,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:40,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849312256] [2024-11-07 00:32:40,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:40,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:40,546 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:32:40,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:40,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849312256] [2024-11-07 00:32:40,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849312256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:40,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:40,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:32:40,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470904024] [2024-11-07 00:32:40,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:40,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:32:40,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:40,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:32:40,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:32:40,551 INFO L87 Difference]: Start difference. First operand 504 states and 637 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:40,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:40,899 INFO L93 Difference]: Finished difference Result 842 states and 1093 transitions. [2024-11-07 00:32:40,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:32:40,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-07 00:32:40,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:40,903 INFO L225 Difference]: With dead ends: 842 [2024-11-07 00:32:40,905 INFO L226 Difference]: Without dead ends: 440 [2024-11-07 00:32:40,907 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:32:40,909 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 1646 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1646 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:40,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1646 Valid, 337 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:32:40,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-11-07 00:32:40,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2024-11-07 00:32:40,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 424 states have (on average 1.330188679245283) internal successors, (564), 439 states have internal predecessors, (564), 0 states have call successors, (0), 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:40,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 564 transitions. [2024-11-07 00:32:40,930 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 564 transitions. Word has length 73 [2024-11-07 00:32:40,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:40,931 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 564 transitions. [2024-11-07 00:32:40,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:40,931 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 564 transitions. [2024-11-07 00:32:40,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-07 00:32:40,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:40,932 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] [2024-11-07 00:32:40,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:32:40,933 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:40,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:40,933 INFO L85 PathProgramCache]: Analyzing trace with hash -800948093, now seen corresponding path program 1 times [2024-11-07 00:32:40,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:40,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297377582] [2024-11-07 00:32:40,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:40,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:41,205 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:32:41,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:41,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297377582] [2024-11-07 00:32:41,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297377582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:41,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:41,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:32:41,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272441843] [2024-11-07 00:32:41,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:41,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:32:41,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:41,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:32:41,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:32:41,209 INFO L87 Difference]: Start difference. First operand 440 states and 564 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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:41,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:41,547 INFO L93 Difference]: Finished difference Result 778 states and 1019 transitions. [2024-11-07 00:32:41,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:32:41,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-11-07 00:32:41,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:41,550 INFO L225 Difference]: With dead ends: 778 [2024-11-07 00:32:41,551 INFO L226 Difference]: Without dead ends: 420 [2024-11-07 00:32:41,554 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:32:41,554 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 1514 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:41,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 302 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:32:41,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-11-07 00:32:41,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2024-11-07 00:32:41,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 404 states have (on average 1.3341584158415842) internal successors, (539), 419 states have internal predecessors, (539), 0 states have call successors, (0), 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:41,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 539 transitions. [2024-11-07 00:32:41,566 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 539 transitions. Word has length 74 [2024-11-07 00:32:41,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:41,567 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 539 transitions. [2024-11-07 00:32:41,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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:41,567 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 539 transitions. [2024-11-07 00:32:41,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-07 00:32:41,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:41,568 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] [2024-11-07 00:32:41,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:32:41,569 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:41,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:41,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1628151892, now seen corresponding path program 1 times [2024-11-07 00:32:41,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:41,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408940008] [2024-11-07 00:32:41,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:41,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:41,770 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:32:41,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:41,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408940008] [2024-11-07 00:32:41,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408940008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:41,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:41,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:32:41,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355409812] [2024-11-07 00:32:41,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:41,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:32:41,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:41,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:32:41,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:32:41,773 INFO L87 Difference]: Start difference. First operand 420 states and 539 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:42,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:42,056 INFO L93 Difference]: Finished difference Result 758 states and 993 transitions. [2024-11-07 00:32:42,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:32:42,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-07 00:32:42,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:42,059 INFO L225 Difference]: With dead ends: 758 [2024-11-07 00:32:42,060 INFO L226 Difference]: Without dead ends: 404 [2024-11-07 00:32:42,061 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:32:42,062 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 1475 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:42,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 308 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:32:42,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-07 00:32:42,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2024-11-07 00:32:42,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 388 states have (on average 1.3402061855670102) internal successors, (520), 403 states have internal predecessors, (520), 0 states have call successors, (0), 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:42,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 520 transitions. [2024-11-07 00:32:42,076 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 520 transitions. Word has length 75 [2024-11-07 00:32:42,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:42,078 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 520 transitions. [2024-11-07 00:32:42,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:42,078 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 520 transitions. [2024-11-07 00:32:42,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-07 00:32:42,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:42,080 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] [2024-11-07 00:32:42,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:32:42,080 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:42,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:42,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1037752348, now seen corresponding path program 1 times [2024-11-07 00:32:42,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:42,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538489709] [2024-11-07 00:32:42,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:42,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:42,303 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:32:42,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:42,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538489709] [2024-11-07 00:32:42,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538489709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:42,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:42,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:32:42,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677831469] [2024-11-07 00:32:42,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:42,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:32:42,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:42,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:32:42,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:32:42,305 INFO L87 Difference]: Start difference. First operand 404 states and 520 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:42,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:42,566 INFO L93 Difference]: Finished difference Result 742 states and 973 transitions. [2024-11-07 00:32:42,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:32:42,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-07 00:32:42,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:42,569 INFO L225 Difference]: With dead ends: 742 [2024-11-07 00:32:42,569 INFO L226 Difference]: Without dead ends: 393 [2024-11-07 00:32:42,570 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:32:42,571 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 1450 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1450 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:42,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1450 Valid, 305 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:32:42,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-07 00:32:42,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-07 00:32:42,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.3448275862068966) internal successors, (507), 392 states have internal predecessors, (507), 0 states have call successors, (0), 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:42,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 507 transitions. [2024-11-07 00:32:42,581 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 507 transitions. Word has length 76 [2024-11-07 00:32:42,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:42,581 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 507 transitions. [2024-11-07 00:32:42,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:42,581 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 507 transitions. [2024-11-07 00:32:42,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 00:32:42,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:42,583 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] [2024-11-07 00:32:42,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:32:42,583 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:42,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:42,584 INFO L85 PathProgramCache]: Analyzing trace with hash -142744767, now seen corresponding path program 1 times [2024-11-07 00:32:42,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:42,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973098390] [2024-11-07 00:32:42,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:42,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:43,016 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:32:43,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:43,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973098390] [2024-11-07 00:32:43,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973098390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:43,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:43,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:32:43,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239696445] [2024-11-07 00:32:43,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:43,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:32:43,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:43,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:32:43,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:32:43,018 INFO L87 Difference]: Start difference. First operand 393 states and 507 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:43,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:43,789 INFO L93 Difference]: Finished difference Result 695 states and 915 transitions. [2024-11-07 00:32:43,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:32:43,789 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-07 00:32:43,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:43,792 INFO L225 Difference]: With dead ends: 695 [2024-11-07 00:32:43,792 INFO L226 Difference]: Without dead ends: 605 [2024-11-07 00:32:43,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:32:43,793 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 2840 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2840 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:43,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2840 Valid, 1259 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:32:43,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-07 00:32:43,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 393. [2024-11-07 00:32:43,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.3421750663129974) internal successors, (506), 392 states have internal predecessors, (506), 0 states have call successors, (0), 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:43,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 506 transitions. [2024-11-07 00:32:43,804 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 506 transitions. Word has length 77 [2024-11-07 00:32:43,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:43,804 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 506 transitions. [2024-11-07 00:32:43,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:43,805 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 506 transitions. [2024-11-07 00:32:43,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 00:32:43,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:43,807 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] [2024-11-07 00:32:43,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:32:43,807 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:43,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:43,808 INFO L85 PathProgramCache]: Analyzing trace with hash -2022253705, now seen corresponding path program 1 times [2024-11-07 00:32:43,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:43,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402317046] [2024-11-07 00:32:43,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:43,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:43,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:44,308 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:32:44,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:44,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402317046] [2024-11-07 00:32:44,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402317046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:44,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:44,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:32:44,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120873932] [2024-11-07 00:32:44,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:44,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:32:44,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:44,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:32:44,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:32:44,311 INFO L87 Difference]: Start difference. First operand 393 states and 506 transitions. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 11 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:45,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:45,283 INFO L93 Difference]: Finished difference Result 683 states and 883 transitions. [2024-11-07 00:32:45,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:32:45,284 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 11 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-07 00:32:45,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:45,287 INFO L225 Difference]: With dead ends: 683 [2024-11-07 00:32:45,287 INFO L226 Difference]: Without dead ends: 613 [2024-11-07 00:32:45,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2024-11-07 00:32:45,288 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 3410 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3410 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:45,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3410 Valid, 1442 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 00:32:45,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-11-07 00:32:45,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 406. [2024-11-07 00:32:45,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 390 states have (on average 1.3461538461538463) internal successors, (525), 405 states have internal predecessors, (525), 0 states have call successors, (0), 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:45,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 525 transitions. [2024-11-07 00:32:45,300 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 525 transitions. Word has length 77 [2024-11-07 00:32:45,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:45,300 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 525 transitions. [2024-11-07 00:32:45,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 11 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:45,300 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 525 transitions. [2024-11-07 00:32:45,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 00:32:45,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:45,302 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] [2024-11-07 00:32:45,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:32:45,302 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:45,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:45,302 INFO L85 PathProgramCache]: Analyzing trace with hash -110056603, now seen corresponding path program 1 times [2024-11-07 00:32:45,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:45,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490108287] [2024-11-07 00:32:45,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:45,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:45,718 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:32:45,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:45,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490108287] [2024-11-07 00:32:45,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490108287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:45,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:45,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:32:45,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38635387] [2024-11-07 00:32:45,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:45,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:32:45,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:45,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:32:45,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:32:45,720 INFO L87 Difference]: Start difference. First operand 406 states and 525 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:46,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:46,543 INFO L93 Difference]: Finished difference Result 738 states and 968 transitions. [2024-11-07 00:32:46,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:32:46,543 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-07 00:32:46,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:46,547 INFO L225 Difference]: With dead ends: 738 [2024-11-07 00:32:46,548 INFO L226 Difference]: Without dead ends: 609 [2024-11-07 00:32:46,548 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:32:46,549 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 2323 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2323 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:46,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2323 Valid, 1598 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 00:32:46,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-07 00:32:46,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 393. [2024-11-07 00:32:46,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.339522546419098) internal successors, (505), 392 states have internal predecessors, (505), 0 states have call successors, (0), 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:46,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 505 transitions. [2024-11-07 00:32:46,559 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 505 transitions. Word has length 77 [2024-11-07 00:32:46,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:46,561 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 505 transitions. [2024-11-07 00:32:46,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:46,562 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 505 transitions. [2024-11-07 00:32:46,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 00:32:46,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:46,563 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] [2024-11-07 00:32:46,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:32:46,563 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:46,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:46,563 INFO L85 PathProgramCache]: Analyzing trace with hash 679839246, now seen corresponding path program 1 times [2024-11-07 00:32:46,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:46,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121518304] [2024-11-07 00:32:46,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:46,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:46,923 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:32:46,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:46,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121518304] [2024-11-07 00:32:46,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121518304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:46,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:46,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:32:46,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928334010] [2024-11-07 00:32:46,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:46,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 00:32:46,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:46,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 00:32:46,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:32:46,925 INFO L87 Difference]: Start difference. First operand 393 states and 505 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:47,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:47,574 INFO L93 Difference]: Finished difference Result 760 states and 963 transitions. [2024-11-07 00:32:47,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:32:47,575 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-07 00:32:47,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:47,577 INFO L225 Difference]: With dead ends: 760 [2024-11-07 00:32:47,578 INFO L226 Difference]: Without dead ends: 547 [2024-11-07 00:32:47,579 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:32:47,580 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 2069 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2069 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:47,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2069 Valid, 1149 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:32:47,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-11-07 00:32:47,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 393. [2024-11-07 00:32:47,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.336870026525199) internal successors, (504), 392 states have internal predecessors, (504), 0 states have call successors, (0), 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:47,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 504 transitions. [2024-11-07 00:32:47,589 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 504 transitions. Word has length 77 [2024-11-07 00:32:47,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:47,590 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 504 transitions. [2024-11-07 00:32:47,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:47,590 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 504 transitions. [2024-11-07 00:32:47,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 00:32:47,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:47,591 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] [2024-11-07 00:32:47,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:32:47,591 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:47,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:47,593 INFO L85 PathProgramCache]: Analyzing trace with hash -204100811, now seen corresponding path program 1 times [2024-11-07 00:32:47,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:47,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874645509] [2024-11-07 00:32:47,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:47,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:48,137 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:32:48,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:48,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874645509] [2024-11-07 00:32:48,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874645509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:48,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:48,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:32:48,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795513811] [2024-11-07 00:32:48,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:48,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:32:48,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:48,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:32:48,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:32:48,140 INFO L87 Difference]: Start difference. First operand 393 states and 504 transitions. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 11 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:49,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:49,565 INFO L93 Difference]: Finished difference Result 952 states and 1281 transitions. [2024-11-07 00:32:49,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 00:32:49,566 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 11 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-07 00:32:49,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:49,571 INFO L225 Difference]: With dead ends: 952 [2024-11-07 00:32:49,571 INFO L226 Difference]: Without dead ends: 853 [2024-11-07 00:32:49,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:32:49,572 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 3685 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3685 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:49,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3685 Valid, 1841 Invalid, 1649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1502 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 00:32:49,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2024-11-07 00:32:49,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 397. [2024-11-07 00:32:49,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.3333333333333333) internal successors, (508), 396 states have internal predecessors, (508), 0 states have call successors, (0), 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:49,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 508 transitions. [2024-11-07 00:32:49,587 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 508 transitions. Word has length 79 [2024-11-07 00:32:49,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:49,587 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 508 transitions. [2024-11-07 00:32:49,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 11 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:49,588 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 508 transitions. [2024-11-07 00:32:49,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 00:32:49,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:49,589 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] [2024-11-07 00:32:49,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:32:49,589 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:49,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:49,590 INFO L85 PathProgramCache]: Analyzing trace with hash -612946039, now seen corresponding path program 1 times [2024-11-07 00:32:49,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:49,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110592294] [2024-11-07 00:32:49,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:49,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:49,924 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:32:49,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:49,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110592294] [2024-11-07 00:32:49,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110592294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:49,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:49,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:32:49,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384443936] [2024-11-07 00:32:49,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:49,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:32:49,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:49,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:32:49,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:32:49,925 INFO L87 Difference]: Start difference. First operand 397 states and 508 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:50,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:50,637 INFO L93 Difference]: Finished difference Result 678 states and 881 transitions. [2024-11-07 00:32:50,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:32:50,638 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-07 00:32:50,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:50,641 INFO L225 Difference]: With dead ends: 678 [2024-11-07 00:32:50,641 INFO L226 Difference]: Without dead ends: 601 [2024-11-07 00:32:50,642 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:32:50,643 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 2729 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2729 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:50,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2729 Valid, 1298 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:32:50,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-07 00:32:50,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 397. [2024-11-07 00:32:50,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.330708661417323) internal successors, (507), 396 states have internal predecessors, (507), 0 states have call successors, (0), 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:50,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 507 transitions. [2024-11-07 00:32:50,653 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 507 transitions. Word has length 79 [2024-11-07 00:32:50,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:50,654 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 507 transitions. [2024-11-07 00:32:50,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:50,654 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 507 transitions. [2024-11-07 00:32:50,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 00:32:50,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:50,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] [2024-11-07 00:32:50,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:32:50,656 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:50,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:50,656 INFO L85 PathProgramCache]: Analyzing trace with hash -244843864, now seen corresponding path program 1 times [2024-11-07 00:32:50,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:50,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110238837] [2024-11-07 00:32:50,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:50,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:50,954 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:32:50,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:50,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110238837] [2024-11-07 00:32:50,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110238837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:50,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:50,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:32:50,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623775049] [2024-11-07 00:32:50,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:50,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:32:50,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:50,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:32:50,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:32:50,956 INFO L87 Difference]: Start difference. First operand 397 states and 507 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:51,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:51,623 INFO L93 Difference]: Finished difference Result 678 states and 879 transitions. [2024-11-07 00:32:51,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:32:51,623 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-07 00:32:51,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:51,625 INFO L225 Difference]: With dead ends: 678 [2024-11-07 00:32:51,626 INFO L226 Difference]: Without dead ends: 601 [2024-11-07 00:32:51,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:32:51,627 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 1285 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1285 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:51,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1285 Valid, 1283 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:32:51,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-07 00:32:51,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 397. [2024-11-07 00:32:51,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.3280839895013123) internal successors, (506), 396 states have internal predecessors, (506), 0 states have call successors, (0), 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:51,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 506 transitions. [2024-11-07 00:32:51,636 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 506 transitions. Word has length 79 [2024-11-07 00:32:51,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:51,636 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 506 transitions. [2024-11-07 00:32:51,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:51,636 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 506 transitions. [2024-11-07 00:32:51,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 00:32:51,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:51,637 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] [2024-11-07 00:32:51,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:32:51,638 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:51,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:51,638 INFO L85 PathProgramCache]: Analyzing trace with hash 391973260, now seen corresponding path program 1 times [2024-11-07 00:32:51,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:51,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276155053] [2024-11-07 00:32:51,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:51,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:51,929 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:32:51,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:51,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276155053] [2024-11-07 00:32:51,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276155053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:51,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:51,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:32:51,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817399491] [2024-11-07 00:32:51,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:51,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:32:51,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:51,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:32:51,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:32:51,931 INFO L87 Difference]: Start difference. First operand 397 states and 506 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:52,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:52,614 INFO L93 Difference]: Finished difference Result 674 states and 874 transitions. [2024-11-07 00:32:52,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:32:52,615 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-07 00:32:52,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:52,617 INFO L225 Difference]: With dead ends: 674 [2024-11-07 00:32:52,617 INFO L226 Difference]: Without dead ends: 601 [2024-11-07 00:32:52,618 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:32:52,619 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 2722 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2722 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:52,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2722 Valid, 1298 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:32:52,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-07 00:32:52,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 397. [2024-11-07 00:32:52,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.3254593175853018) internal successors, (505), 396 states have internal predecessors, (505), 0 states have call successors, (0), 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:52,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 505 transitions. [2024-11-07 00:32:52,628 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 505 transitions. Word has length 79 [2024-11-07 00:32:52,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:52,629 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 505 transitions. [2024-11-07 00:32:52,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:52,630 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 505 transitions. [2024-11-07 00:32:52,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 00:32:52,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:52,631 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] [2024-11-07 00:32:52,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 00:32:52,632 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:52,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:52,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1786631023, now seen corresponding path program 1 times [2024-11-07 00:32:52,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:52,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436454730] [2024-11-07 00:32:52,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:52,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:53,051 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:32:53,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:53,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436454730] [2024-11-07 00:32:53,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436454730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:53,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:53,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 00:32:53,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322800046] [2024-11-07 00:32:53,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:53,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 00:32:53,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:53,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 00:32:53,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:32:53,052 INFO L87 Difference]: Start difference. First operand 397 states and 505 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 10 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:54,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:54,090 INFO L93 Difference]: Finished difference Result 833 states and 1091 transitions. [2024-11-07 00:32:54,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 00:32:54,091 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 10 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-07 00:32:54,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:54,093 INFO L225 Difference]: With dead ends: 833 [2024-11-07 00:32:54,093 INFO L226 Difference]: Without dead ends: 689 [2024-11-07 00:32:54,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2024-11-07 00:32:54,094 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 1897 mSDsluCounter, 2135 mSDsCounter, 0 mSdLazyCounter, 1906 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1897 SdHoareTripleChecker+Valid, 2558 SdHoareTripleChecker+Invalid, 1918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:54,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1897 Valid, 2558 Invalid, 1918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1906 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 00:32:54,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2024-11-07 00:32:54,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 397. [2024-11-07 00:32:54,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.3228346456692914) internal successors, (504), 396 states have internal predecessors, (504), 0 states have call successors, (0), 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:54,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 504 transitions. [2024-11-07 00:32:54,103 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 504 transitions. Word has length 79 [2024-11-07 00:32:54,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:54,104 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 504 transitions. [2024-11-07 00:32:54,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 10 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:54,104 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 504 transitions. [2024-11-07 00:32:54,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 00:32:54,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:54,105 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] [2024-11-07 00:32:54,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 00:32:54,105 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:54,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:54,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1207195179, now seen corresponding path program 1 times [2024-11-07 00:32:54,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:54,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470088248] [2024-11-07 00:32:54,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:54,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:54,354 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:32:54,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:54,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470088248] [2024-11-07 00:32:54,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470088248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:54,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:54,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:32:54,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116406699] [2024-11-07 00:32:54,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:54,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:32:54,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:54,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:32:54,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:32:54,356 INFO L87 Difference]: Start difference. First operand 397 states and 504 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:54,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:54,998 INFO L93 Difference]: Finished difference Result 678 states and 875 transitions. [2024-11-07 00:32:54,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:32:54,999 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-07 00:32:54,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:55,001 INFO L225 Difference]: With dead ends: 678 [2024-11-07 00:32:55,002 INFO L226 Difference]: Without dead ends: 601 [2024-11-07 00:32:55,002 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:32:55,003 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 2222 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2222 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:55,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2222 Valid, 1304 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:32:55,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-07 00:32:55,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 397. [2024-11-07 00:32:55,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.3202099737532809) internal successors, (503), 396 states have internal predecessors, (503), 0 states have call successors, (0), 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:55,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 503 transitions. [2024-11-07 00:32:55,012 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 503 transitions. Word has length 79 [2024-11-07 00:32:55,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:55,012 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 503 transitions. [2024-11-07 00:32:55,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:55,013 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 503 transitions. [2024-11-07 00:32:55,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 00:32:55,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:55,014 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] [2024-11-07 00:32:55,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 00:32:55,015 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:55,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:55,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1616040407, now seen corresponding path program 1 times [2024-11-07 00:32:55,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:55,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015028243] [2024-11-07 00:32:55,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:55,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:55,258 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:32:55,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:55,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015028243] [2024-11-07 00:32:55,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015028243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:55,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:55,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:32:55,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890694063] [2024-11-07 00:32:55,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:55,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:32:55,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:55,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:32:55,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:32:55,261 INFO L87 Difference]: Start difference. First operand 397 states and 503 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:56,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:56,052 INFO L93 Difference]: Finished difference Result 704 states and 912 transitions. [2024-11-07 00:32:56,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:32:56,053 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-07 00:32:56,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:56,055 INFO L225 Difference]: With dead ends: 704 [2024-11-07 00:32:56,055 INFO L226 Difference]: Without dead ends: 605 [2024-11-07 00:32:56,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:32:56,056 INFO L432 NwaCegarLoop]: 377 mSDtfsCounter, 2141 mSDsluCounter, 1571 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2141 SdHoareTripleChecker+Valid, 1948 SdHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:56,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2141 Valid, 1948 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1359 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 00:32:56,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-07 00:32:56,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 397. [2024-11-07 00:32:56,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.3175853018372703) internal successors, (502), 396 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:56,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 502 transitions. [2024-11-07 00:32:56,064 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 502 transitions. Word has length 79 [2024-11-07 00:32:56,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:56,064 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 502 transitions. [2024-11-07 00:32:56,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:56,065 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 502 transitions. [2024-11-07 00:32:56,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 00:32:56,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:56,066 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] [2024-11-07 00:32:56,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 00:32:56,066 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:56,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:56,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1975429315, now seen corresponding path program 1 times [2024-11-07 00:32:56,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:56,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327712882] [2024-11-07 00:32:56,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:56,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:56,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:56,287 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:32:56,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:56,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327712882] [2024-11-07 00:32:56,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327712882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:56,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:56,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:32:56,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772948611] [2024-11-07 00:32:56,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:56,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:32:56,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:56,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:32:56,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:32:56,289 INFO L87 Difference]: Start difference. First operand 397 states and 502 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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:57,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:57,001 INFO L93 Difference]: Finished difference Result 704 states and 913 transitions. [2024-11-07 00:32:57,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:32:57,002 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-11-07 00:32:57,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:57,003 INFO L225 Difference]: With dead ends: 704 [2024-11-07 00:32:57,004 INFO L226 Difference]: Without dead ends: 605 [2024-11-07 00:32:57,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:32:57,004 INFO L432 NwaCegarLoop]: 439 mSDtfsCounter, 1504 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1854 SdHoareTripleChecker+Invalid, 1376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:57,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1854 Invalid, 1376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1371 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:32:57,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-07 00:32:57,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 393. [2024-11-07 00:32:57,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.3183023872679045) internal successors, (497), 392 states have internal predecessors, (497), 0 states have call successors, (0), 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:57,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 497 transitions. [2024-11-07 00:32:57,014 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 497 transitions. Word has length 80 [2024-11-07 00:32:57,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:57,014 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 497 transitions. [2024-11-07 00:32:57,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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:57,014 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 497 transitions. [2024-11-07 00:32:57,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-07 00:32:57,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:57,016 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] [2024-11-07 00:32:57,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 00:32:57,016 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:57,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:57,017 INFO L85 PathProgramCache]: Analyzing trace with hash 2135531548, now seen corresponding path program 1 times [2024-11-07 00:32:57,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:57,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743607129] [2024-11-07 00:32:57,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:57,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:57,264 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:32:57,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:57,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743607129] [2024-11-07 00:32:57,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743607129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:57,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:57,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:32:57,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869425845] [2024-11-07 00:32:57,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:57,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:32:57,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:57,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:32:57,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:32:57,266 INFO L87 Difference]: Start difference. First operand 393 states and 497 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:57,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:57,849 INFO L93 Difference]: Finished difference Result 651 states and 832 transitions. [2024-11-07 00:32:57,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:32:57,849 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-07 00:32:57,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:57,851 INFO L225 Difference]: With dead ends: 651 [2024-11-07 00:32:57,851 INFO L226 Difference]: Without dead ends: 581 [2024-11-07 00:32:57,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:32:57,852 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 2228 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2228 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:57,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2228 Valid, 1584 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:32:57,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-11-07 00:32:57,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 393. [2024-11-07 00:32:57,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.3156498673740054) internal successors, (496), 392 states have internal predecessors, (496), 0 states have call successors, (0), 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:57,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 496 transitions. [2024-11-07 00:32:57,859 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 496 transitions. Word has length 81 [2024-11-07 00:32:57,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:57,860 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 496 transitions. [2024-11-07 00:32:57,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:57,860 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 496 transitions. [2024-11-07 00:32:57,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-07 00:32:57,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:57,861 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] [2024-11-07 00:32:57,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 00:32:57,861 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:57,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:57,862 INFO L85 PathProgramCache]: Analyzing trace with hash -247238646, now seen corresponding path program 1 times [2024-11-07 00:32:57,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:57,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363122727] [2024-11-07 00:32:57,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:57,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:58,245 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:32:58,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:58,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363122727] [2024-11-07 00:32:58,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363122727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:58,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:58,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:32:58,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614084825] [2024-11-07 00:32:58,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:58,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:32:58,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:58,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:32:58,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:32:58,247 INFO L87 Difference]: Start difference. First operand 393 states and 496 transitions. Second operand has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:59,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:32:59,196 INFO L93 Difference]: Finished difference Result 887 states and 1171 transitions. [2024-11-07 00:32:59,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 00:32:59,196 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-07 00:32:59,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:32:59,198 INFO L225 Difference]: With dead ends: 887 [2024-11-07 00:32:59,198 INFO L226 Difference]: Without dead ends: 805 [2024-11-07 00:32:59,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:32:59,199 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 4021 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4021 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:32:59,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4021 Valid, 1595 Invalid, 1372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:32:59,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-11-07 00:32:59,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 397. [2024-11-07 00:32:59,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.3123359580052494) internal successors, (500), 396 states have internal predecessors, (500), 0 states have call successors, (0), 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:59,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 500 transitions. [2024-11-07 00:32:59,207 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 500 transitions. Word has length 81 [2024-11-07 00:32:59,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:32:59,207 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 500 transitions. [2024-11-07 00:32:59,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:32:59,208 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 500 transitions. [2024-11-07 00:32:59,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-07 00:32:59,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:32:59,209 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] [2024-11-07 00:32:59,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 00:32:59,209 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:32:59,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:32:59,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1648828412, now seen corresponding path program 1 times [2024-11-07 00:32:59,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:32:59,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476369460] [2024-11-07 00:32:59,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:32:59,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:32:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:32:59,436 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:32:59,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:32:59,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476369460] [2024-11-07 00:32:59,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476369460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:32:59,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:32:59,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:32:59,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709565411] [2024-11-07 00:32:59,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:32:59,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:32:59,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:32:59,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:32:59,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:32:59,438 INFO L87 Difference]: Start difference. First operand 397 states and 500 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:00,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:00,039 INFO L93 Difference]: Finished difference Result 652 states and 832 transitions. [2024-11-07 00:33:00,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:33:00,039 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-07 00:33:00,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:00,041 INFO L225 Difference]: With dead ends: 652 [2024-11-07 00:33:00,041 INFO L226 Difference]: Without dead ends: 585 [2024-11-07 00:33:00,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:33:00,042 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 2146 mSDsluCounter, 1401 mSDsCounter, 0 mSdLazyCounter, 1336 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2146 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:00,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2146 Valid, 1750 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1336 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:33:00,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-07 00:33:00,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 397. [2024-11-07 00:33:00,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.3097112860892388) internal successors, (499), 396 states have internal predecessors, (499), 0 states have call successors, (0), 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:33:00,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 499 transitions. [2024-11-07 00:33:00,050 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 499 transitions. Word has length 81 [2024-11-07 00:33:00,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:00,050 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 499 transitions. [2024-11-07 00:33:00,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:00,050 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 499 transitions. [2024-11-07 00:33:00,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-07 00:33:00,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:00,051 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] [2024-11-07 00:33:00,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 00:33:00,052 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:00,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:00,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1380394973, now seen corresponding path program 1 times [2024-11-07 00:33:00,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:00,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669597363] [2024-11-07 00:33:00,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:00,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:00,405 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:33:00,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:00,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669597363] [2024-11-07 00:33:00,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669597363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:00,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:00,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:33:00,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396350578] [2024-11-07 00:33:00,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:00,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:33:00,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:00,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:33:00,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:33:00,408 INFO L87 Difference]: Start difference. First operand 397 states and 499 transitions. Second operand has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:01,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:01,345 INFO L93 Difference]: Finished difference Result 823 states and 1074 transitions. [2024-11-07 00:33:01,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 00:33:01,346 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-07 00:33:01,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:01,347 INFO L225 Difference]: With dead ends: 823 [2024-11-07 00:33:01,347 INFO L226 Difference]: Without dead ends: 753 [2024-11-07 00:33:01,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:33:01,348 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 4086 mSDsluCounter, 1339 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4086 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 1482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:01,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4086 Valid, 1638 Invalid, 1482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:33:01,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2024-11-07 00:33:01,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 401. [2024-11-07 00:33:01,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.3064935064935066) internal successors, (503), 400 states have internal predecessors, (503), 0 states have call successors, (0), 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:33:01,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 503 transitions. [2024-11-07 00:33:01,355 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 503 transitions. Word has length 81 [2024-11-07 00:33:01,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:01,355 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 503 transitions. [2024-11-07 00:33:01,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:01,356 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 503 transitions. [2024-11-07 00:33:01,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-07 00:33:01,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:01,357 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] [2024-11-07 00:33:01,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 00:33:01,357 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:01,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:01,358 INFO L85 PathProgramCache]: Analyzing trace with hash -90069907, now seen corresponding path program 1 times [2024-11-07 00:33:01,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:01,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106091417] [2024-11-07 00:33:01,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:01,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:01,579 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:33:01,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:01,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106091417] [2024-11-07 00:33:01,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106091417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:01,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:01,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:33:01,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268252144] [2024-11-07 00:33:01,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:01,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:33:01,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:01,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:33:01,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:33:01,581 INFO L87 Difference]: Start difference. First operand 401 states and 503 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:02,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:02,192 INFO L93 Difference]: Finished difference Result 652 states and 830 transitions. [2024-11-07 00:33:02,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:33:02,193 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-07 00:33:02,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:02,195 INFO L225 Difference]: With dead ends: 652 [2024-11-07 00:33:02,195 INFO L226 Difference]: Without dead ends: 585 [2024-11-07 00:33:02,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:33:02,197 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 2143 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2143 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:02,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2143 Valid, 1754 Invalid, 1323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:33:02,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-07 00:33:02,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 401. [2024-11-07 00:33:02,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.3038961038961039) internal successors, (502), 400 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 502 transitions. [2024-11-07 00:33:02,203 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 502 transitions. Word has length 81 [2024-11-07 00:33:02,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:02,203 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 502 transitions. [2024-11-07 00:33:02,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:02,204 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 502 transitions. [2024-11-07 00:33:02,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-07 00:33:02,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:02,204 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] [2024-11-07 00:33:02,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 00:33:02,205 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:02,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:02,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1355696644, now seen corresponding path program 1 times [2024-11-07 00:33:02,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:02,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831859071] [2024-11-07 00:33:02,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:02,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:02,399 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:33:02,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:02,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831859071] [2024-11-07 00:33:02,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831859071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:02,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:02,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:33:02,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595248050] [2024-11-07 00:33:02,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:02,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:33:02,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:02,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:33:02,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:33:02,401 INFO L87 Difference]: Start difference. First operand 401 states and 502 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:03,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:03,009 INFO L93 Difference]: Finished difference Result 590 states and 736 transitions. [2024-11-07 00:33:03,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:33:03,010 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-07 00:33:03,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:03,011 INFO L225 Difference]: With dead ends: 590 [2024-11-07 00:33:03,011 INFO L226 Difference]: Without dead ends: 585 [2024-11-07 00:33:03,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:33:03,012 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 2297 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2297 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:03,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2297 Valid, 1430 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:33:03,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-07 00:33:03,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 401. [2024-11-07 00:33:03,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.3012987012987014) internal successors, (501), 400 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:03,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 501 transitions. [2024-11-07 00:33:03,017 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 501 transitions. Word has length 81 [2024-11-07 00:33:03,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:03,017 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 501 transitions. [2024-11-07 00:33:03,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:03,017 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 501 transitions. [2024-11-07 00:33:03,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-07 00:33:03,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:03,018 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] [2024-11-07 00:33:03,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 00:33:03,018 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:03,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:03,019 INFO L85 PathProgramCache]: Analyzing trace with hash 558624169, now seen corresponding path program 1 times [2024-11-07 00:33:03,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:03,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494030947] [2024-11-07 00:33:03,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:03,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:03,209 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:33:03,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:03,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494030947] [2024-11-07 00:33:03,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494030947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:03,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:03,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:33:03,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734522848] [2024-11-07 00:33:03,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:03,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:33:03,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:03,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:33:03,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:33:03,212 INFO L87 Difference]: Start difference. First operand 401 states and 501 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:03,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:03,728 INFO L93 Difference]: Finished difference Result 652 states and 827 transitions. [2024-11-07 00:33:03,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:33:03,729 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-07 00:33:03,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:03,730 INFO L225 Difference]: With dead ends: 652 [2024-11-07 00:33:03,730 INFO L226 Difference]: Without dead ends: 585 [2024-11-07 00:33:03,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:33:03,731 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 1919 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1919 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:03,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1919 Valid, 1260 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:33:03,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-07 00:33:03,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 401. [2024-11-07 00:33:03,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.2987012987012987) internal successors, (500), 400 states have internal predecessors, (500), 0 states have call successors, (0), 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:33:03,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 500 transitions. [2024-11-07 00:33:03,738 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 500 transitions. Word has length 81 [2024-11-07 00:33:03,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:03,739 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 500 transitions. [2024-11-07 00:33:03,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:03,739 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 500 transitions. [2024-11-07 00:33:03,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-07 00:33:03,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:03,740 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] [2024-11-07 00:33:03,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 00:33:03,740 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:03,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:03,740 INFO L85 PathProgramCache]: Analyzing trace with hash -237124242, now seen corresponding path program 1 times [2024-11-07 00:33:03,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:03,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87775732] [2024-11-07 00:33:03,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:03,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:03,969 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:33:03,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:03,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87775732] [2024-11-07 00:33:03,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87775732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:03,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:03,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:33:03,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561709365] [2024-11-07 00:33:03,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:03,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:33:03,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:03,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:33:03,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:33:03,972 INFO L87 Difference]: Start difference. First operand 401 states and 500 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:04,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:04,522 INFO L93 Difference]: Finished difference Result 650 states and 823 transitions. [2024-11-07 00:33:04,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:33:04,523 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-07 00:33:04,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:04,524 INFO L225 Difference]: With dead ends: 650 [2024-11-07 00:33:04,524 INFO L226 Difference]: Without dead ends: 585 [2024-11-07 00:33:04,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:33:04,525 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 2215 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2215 SdHoareTripleChecker+Valid, 1564 SdHoareTripleChecker+Invalid, 1155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:04,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2215 Valid, 1564 Invalid, 1155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:33:04,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-07 00:33:04,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 401. [2024-11-07 00:33:04,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.2961038961038962) internal successors, (499), 400 states have internal predecessors, (499), 0 states have call successors, (0), 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:33:04,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 499 transitions. [2024-11-07 00:33:04,530 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 499 transitions. Word has length 81 [2024-11-07 00:33:04,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:04,530 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 499 transitions. [2024-11-07 00:33:04,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:04,531 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 499 transitions. [2024-11-07 00:33:04,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-07 00:33:04,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:04,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:33:04,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 00:33:04,532 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:04,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:04,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1610096682, now seen corresponding path program 1 times [2024-11-07 00:33:04,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:04,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161364191] [2024-11-07 00:33:04,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:04,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:04,752 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:33:04,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:04,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161364191] [2024-11-07 00:33:04,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161364191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:04,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:04,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:33:04,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267782357] [2024-11-07 00:33:04,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:04,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:33:04,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:04,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:33:04,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:33:04,755 INFO L87 Difference]: Start difference. First operand 401 states and 499 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:05,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:05,292 INFO L93 Difference]: Finished difference Result 683 states and 867 transitions. [2024-11-07 00:33:05,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:33:05,293 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-07 00:33:05,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:05,294 INFO L225 Difference]: With dead ends: 683 [2024-11-07 00:33:05,294 INFO L226 Difference]: Without dead ends: 601 [2024-11-07 00:33:05,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:33:05,295 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 2446 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2446 SdHoareTripleChecker+Valid, 1494 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:05,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2446 Valid, 1494 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:33:05,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-07 00:33:05,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 401. [2024-11-07 00:33:05,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.2935064935064935) internal successors, (498), 400 states have internal predecessors, (498), 0 states have call successors, (0), 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:33:05,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 498 transitions. [2024-11-07 00:33:05,301 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 498 transitions. Word has length 81 [2024-11-07 00:33:05,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:05,301 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 498 transitions. [2024-11-07 00:33:05,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:05,302 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 498 transitions. [2024-11-07 00:33:05,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-07 00:33:05,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:05,303 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] [2024-11-07 00:33:05,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-07 00:33:05,303 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:05,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:05,303 INFO L85 PathProgramCache]: Analyzing trace with hash -302100420, now seen corresponding path program 1 times [2024-11-07 00:33:05,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:05,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613092892] [2024-11-07 00:33:05,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:05,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:05,558 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:33:05,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:05,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613092892] [2024-11-07 00:33:05,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613092892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:05,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:05,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:33:05,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864759295] [2024-11-07 00:33:05,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:05,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:33:05,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:05,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:33:05,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:33:05,563 INFO L87 Difference]: Start difference. First operand 401 states and 498 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:06,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:06,205 INFO L93 Difference]: Finished difference Result 655 states and 826 transitions. [2024-11-07 00:33:06,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:33:06,206 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-07 00:33:06,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:06,207 INFO L225 Difference]: With dead ends: 655 [2024-11-07 00:33:06,207 INFO L226 Difference]: Without dead ends: 585 [2024-11-07 00:33:06,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:33:06,208 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 2184 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2184 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:06,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2184 Valid, 1620 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1160 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:33:06,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-07 00:33:06,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 401. [2024-11-07 00:33:06,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.290909090909091) internal successors, (497), 400 states have internal predecessors, (497), 0 states have call successors, (0), 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:33:06,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 497 transitions. [2024-11-07 00:33:06,213 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 497 transitions. Word has length 81 [2024-11-07 00:33:06,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:06,213 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 497 transitions. [2024-11-07 00:33:06,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:06,214 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 497 transitions. [2024-11-07 00:33:06,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-07 00:33:06,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:06,215 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] [2024-11-07 00:33:06,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-07 00:33:06,215 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:06,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:06,215 INFO L85 PathProgramCache]: Analyzing trace with hash -286808248, now seen corresponding path program 1 times [2024-11-07 00:33:06,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:06,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290409396] [2024-11-07 00:33:06,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:06,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:06,393 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:33:06,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:06,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290409396] [2024-11-07 00:33:06,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290409396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:06,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:06,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:33:06,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528087201] [2024-11-07 00:33:06,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:06,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:33:06,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:06,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:33:06,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:33:06,396 INFO L87 Difference]: Start difference. First operand 401 states and 497 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:07,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:07,008 INFO L93 Difference]: Finished difference Result 726 states and 921 transitions. [2024-11-07 00:33:07,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:33:07,008 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-07 00:33:07,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:07,010 INFO L225 Difference]: With dead ends: 726 [2024-11-07 00:33:07,010 INFO L226 Difference]: Without dead ends: 621 [2024-11-07 00:33:07,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:33:07,010 INFO L432 NwaCegarLoop]: 396 mSDtfsCounter, 1673 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1673 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:07,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1673 Valid, 1684 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:33:07,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-11-07 00:33:07,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 401. [2024-11-07 00:33:07,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.2883116883116883) internal successors, (496), 400 states have internal predecessors, (496), 0 states have call successors, (0), 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:33:07,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 496 transitions. [2024-11-07 00:33:07,015 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 496 transitions. Word has length 81 [2024-11-07 00:33:07,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:07,015 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 496 transitions. [2024-11-07 00:33:07,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:07,015 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 496 transitions. [2024-11-07 00:33:07,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-07 00:33:07,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:07,016 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] [2024-11-07 00:33:07,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-07 00:33:07,016 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:07,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:07,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1055423202, now seen corresponding path program 1 times [2024-11-07 00:33:07,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:07,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573648736] [2024-11-07 00:33:07,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:07,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:07,239 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:33:07,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:07,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573648736] [2024-11-07 00:33:07,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573648736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:07,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:07,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:33:07,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215221299] [2024-11-07 00:33:07,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:07,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:33:07,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:07,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:33:07,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:33:07,241 INFO L87 Difference]: Start difference. First operand 401 states and 496 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:07,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:07,771 INFO L93 Difference]: Finished difference Result 590 states and 728 transitions. [2024-11-07 00:33:07,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:33:07,772 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-07 00:33:07,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:07,773 INFO L225 Difference]: With dead ends: 590 [2024-11-07 00:33:07,773 INFO L226 Difference]: Without dead ends: 585 [2024-11-07 00:33:07,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:33:07,774 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 2175 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2175 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:07,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2175 Valid, 1620 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:33:07,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-07 00:33:07,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 401. [2024-11-07 00:33:07,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.2857142857142858) internal successors, (495), 400 states have internal predecessors, (495), 0 states have call successors, (0), 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:33:07,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 495 transitions. [2024-11-07 00:33:07,779 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 495 transitions. Word has length 81 [2024-11-07 00:33:07,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:07,779 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 495 transitions. [2024-11-07 00:33:07,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:07,779 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 495 transitions. [2024-11-07 00:33:07,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-07 00:33:07,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:07,780 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] [2024-11-07 00:33:07,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-07 00:33:07,780 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:07,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:07,781 INFO L85 PathProgramCache]: Analyzing trace with hash 856773900, now seen corresponding path program 1 times [2024-11-07 00:33:07,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:07,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379331003] [2024-11-07 00:33:07,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:07,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:08,090 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:33:08,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:08,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379331003] [2024-11-07 00:33:08,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379331003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:08,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:08,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:33:08,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432385812] [2024-11-07 00:33:08,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:08,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:33:08,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:08,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:33:08,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:33:08,092 INFO L87 Difference]: Start difference. First operand 401 states and 495 transitions. Second operand has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:08,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:08,953 INFO L93 Difference]: Finished difference Result 826 states and 1066 transitions. [2024-11-07 00:33:08,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 00:33:08,953 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-07 00:33:08,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:08,955 INFO L225 Difference]: With dead ends: 826 [2024-11-07 00:33:08,955 INFO L226 Difference]: Without dead ends: 809 [2024-11-07 00:33:08,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:33:08,956 INFO L432 NwaCegarLoop]: 374 mSDtfsCounter, 4698 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4698 SdHoareTripleChecker+Valid, 1696 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:08,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4698 Valid, 1696 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1207 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:33:08,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2024-11-07 00:33:08,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 405. [2024-11-07 00:33:08,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 389 states have (on average 1.2827763496143958) internal successors, (499), 404 states have internal predecessors, (499), 0 states have call successors, (0), 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:33:08,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 499 transitions. [2024-11-07 00:33:08,961 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 499 transitions. Word has length 81 [2024-11-07 00:33:08,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:08,961 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 499 transitions. [2024-11-07 00:33:08,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:08,962 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 499 transitions. [2024-11-07 00:33:08,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-07 00:33:08,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:08,962 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] [2024-11-07 00:33:08,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-07 00:33:08,963 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:08,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:08,963 INFO L85 PathProgramCache]: Analyzing trace with hash -544552721, now seen corresponding path program 1 times [2024-11-07 00:33:08,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:08,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064348059] [2024-11-07 00:33:08,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:08,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:09,174 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:33:09,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:09,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064348059] [2024-11-07 00:33:09,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064348059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:09,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:09,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:33:09,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142418656] [2024-11-07 00:33:09,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:09,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:33:09,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:09,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:33:09,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:33:09,175 INFO L87 Difference]: Start difference. First operand 405 states and 499 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:09,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:09,734 INFO L93 Difference]: Finished difference Result 656 states and 824 transitions. [2024-11-07 00:33:09,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:33:09,734 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-07 00:33:09,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:09,736 INFO L225 Difference]: With dead ends: 656 [2024-11-07 00:33:09,736 INFO L226 Difference]: Without dead ends: 589 [2024-11-07 00:33:09,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:33:09,736 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 2172 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2172 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:09,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2172 Valid, 1620 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:33:09,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2024-11-07 00:33:09,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 405. [2024-11-07 00:33:09,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 389 states have (on average 1.2802056555269923) internal successors, (498), 404 states have internal predecessors, (498), 0 states have call successors, (0), 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:33:09,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 498 transitions. [2024-11-07 00:33:09,741 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 498 transitions. Word has length 81 [2024-11-07 00:33:09,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:09,741 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 498 transitions. [2024-11-07 00:33:09,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:09,741 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 498 transitions. [2024-11-07 00:33:09,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-07 00:33:09,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:09,742 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] [2024-11-07 00:33:09,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-07 00:33:09,742 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:09,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:09,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1810559777, now seen corresponding path program 1 times [2024-11-07 00:33:09,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:09,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286342953] [2024-11-07 00:33:09,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:09,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:09,877 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:33:09,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:09,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286342953] [2024-11-07 00:33:09,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286342953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:09,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:09,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:33:09,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245681822] [2024-11-07 00:33:09,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:09,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:33:09,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:09,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:33:09,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:33:09,878 INFO L87 Difference]: Start difference. First operand 405 states and 498 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:10,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:10,374 INFO L93 Difference]: Finished difference Result 594 states and 730 transitions. [2024-11-07 00:33:10,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:33:10,374 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-07 00:33:10,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:10,376 INFO L225 Difference]: With dead ends: 594 [2024-11-07 00:33:10,376 INFO L226 Difference]: Without dead ends: 589 [2024-11-07 00:33:10,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:33:10,376 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 1231 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1231 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:10,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1231 Valid, 1312 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:33:10,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2024-11-07 00:33:10,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 405. [2024-11-07 00:33:10,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 389 states have (on average 1.2776349614395888) internal successors, (497), 404 states have internal predecessors, (497), 0 states have call successors, (0), 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:33:10,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 497 transitions. [2024-11-07 00:33:10,384 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 497 transitions. Word has length 81 [2024-11-07 00:33:10,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:10,384 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 497 transitions. [2024-11-07 00:33:10,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:10,384 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 497 transitions. [2024-11-07 00:33:10,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-07 00:33:10,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:10,385 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] [2024-11-07 00:33:10,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-07 00:33:10,385 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:10,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:10,386 INFO L85 PathProgramCache]: Analyzing trace with hash -423596437, now seen corresponding path program 1 times [2024-11-07 00:33:10,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:10,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257836748] [2024-11-07 00:33:10,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:10,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:10,546 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:33:10,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:10,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257836748] [2024-11-07 00:33:10,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257836748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:10,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:10,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:33:10,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322541852] [2024-11-07 00:33:10,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:10,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:33:10,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:10,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:33:10,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:33:10,548 INFO L87 Difference]: Start difference. First operand 405 states and 497 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:11,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:11,025 INFO L93 Difference]: Finished difference Result 659 states and 824 transitions. [2024-11-07 00:33:11,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:33:11,025 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-07 00:33:11,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:11,027 INFO L225 Difference]: With dead ends: 659 [2024-11-07 00:33:11,027 INFO L226 Difference]: Without dead ends: 589 [2024-11-07 00:33:11,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:33:11,027 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 2432 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2432 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:11,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2432 Valid, 1328 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:33:11,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2024-11-07 00:33:11,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 401. [2024-11-07 00:33:11,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.277922077922078) internal successors, (492), 400 states have internal predecessors, (492), 0 states have call successors, (0), 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:33:11,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 492 transitions. [2024-11-07 00:33:11,031 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 492 transitions. Word has length 82 [2024-11-07 00:33:11,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:11,031 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 492 transitions. [2024-11-07 00:33:11,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:11,032 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 492 transitions. [2024-11-07 00:33:11,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-07 00:33:11,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:11,032 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] [2024-11-07 00:33:11,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-07 00:33:11,033 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:11,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:11,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1323094470, now seen corresponding path program 1 times [2024-11-07 00:33:11,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:11,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811143987] [2024-11-07 00:33:11,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:11,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:11,215 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:33:11,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:11,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811143987] [2024-11-07 00:33:11,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811143987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:11,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:11,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:33:11,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587062698] [2024-11-07 00:33:11,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:11,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:33:11,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:11,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:33:11,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:33:11,216 INFO L87 Difference]: Start difference. First operand 401 states and 492 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:11,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:11,765 INFO L93 Difference]: Finished difference Result 679 states and 854 transitions. [2024-11-07 00:33:11,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:33:11,766 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-07 00:33:11,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:11,767 INFO L225 Difference]: With dead ends: 679 [2024-11-07 00:33:11,767 INFO L226 Difference]: Without dead ends: 597 [2024-11-07 00:33:11,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:33:11,768 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 1980 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 1231 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1980 SdHoareTripleChecker+Valid, 1777 SdHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:11,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1980 Valid, 1777 Invalid, 1237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1231 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:33:11,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2024-11-07 00:33:11,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 397. [2024-11-07 00:33:11,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.2782152230971129) internal successors, (487), 396 states have internal predecessors, (487), 0 states have call successors, (0), 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:33:11,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 487 transitions. [2024-11-07 00:33:11,773 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 487 transitions. Word has length 82 [2024-11-07 00:33:11,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:11,773 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 487 transitions. [2024-11-07 00:33:11,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:11,773 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 487 transitions. [2024-11-07 00:33:11,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-07 00:33:11,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:11,774 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] [2024-11-07 00:33:11,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-07 00:33:11,774 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:11,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:11,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1458444177, now seen corresponding path program 1 times [2024-11-07 00:33:11,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:11,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474821593] [2024-11-07 00:33:11,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:11,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:11,937 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:33:11,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:11,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474821593] [2024-11-07 00:33:11,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474821593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:11,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:11,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:33:11,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911637642] [2024-11-07 00:33:11,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:11,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:33:11,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:11,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:33:11,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:33:11,938 INFO L87 Difference]: Start difference. First operand 397 states and 487 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:12,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:12,479 INFO L93 Difference]: Finished difference Result 614 states and 757 transitions. [2024-11-07 00:33:12,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:33:12,480 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-07 00:33:12,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:12,481 INFO L225 Difference]: With dead ends: 614 [2024-11-07 00:33:12,481 INFO L226 Difference]: Without dead ends: 597 [2024-11-07 00:33:12,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:33:12,482 INFO L432 NwaCegarLoop]: 435 mSDtfsCounter, 1922 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1922 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:12,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1922 Valid, 1825 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1251 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:33:12,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2024-11-07 00:33:12,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 393. [2024-11-07 00:33:12,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.2785145888594165) internal successors, (482), 392 states have internal predecessors, (482), 0 states have call successors, (0), 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:33:12,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 482 transitions. [2024-11-07 00:33:12,486 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 482 transitions. Word has length 82 [2024-11-07 00:33:12,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:12,486 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 482 transitions. [2024-11-07 00:33:12,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:12,487 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 482 transitions. [2024-11-07 00:33:12,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-07 00:33:12,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:12,487 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] [2024-11-07 00:33:12,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-07 00:33:12,488 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:12,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:12,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1687929497, now seen corresponding path program 1 times [2024-11-07 00:33:12,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:12,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905203294] [2024-11-07 00:33:12,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:12,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:12,998 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:33:12,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:12,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905203294] [2024-11-07 00:33:12,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905203294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:12,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:12,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:33:12,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743034443] [2024-11-07 00:33:12,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:12,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 00:33:12,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:12,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 00:33:13,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:33:13,000 INFO L87 Difference]: Start difference. First operand 393 states and 482 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:13,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:13,513 INFO L93 Difference]: Finished difference Result 906 states and 1133 transitions. [2024-11-07 00:33:13,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:33:13,513 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-07 00:33:13,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:13,515 INFO L225 Difference]: With dead ends: 906 [2024-11-07 00:33:13,515 INFO L226 Difference]: Without dead ends: 723 [2024-11-07 00:33:13,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-11-07 00:33:13,516 INFO L432 NwaCegarLoop]: 547 mSDtfsCounter, 1306 mSDsluCounter, 2658 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1306 SdHoareTripleChecker+Valid, 3205 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:13,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1306 Valid, 3205 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:33:13,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2024-11-07 00:33:13,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 275. [2024-11-07 00:33:13,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 264 states have (on average 1.2651515151515151) internal successors, (334), 274 states have internal predecessors, (334), 0 states have call successors, (0), 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:33:13,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 334 transitions. [2024-11-07 00:33:13,518 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 334 transitions. Word has length 83 [2024-11-07 00:33:13,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:13,519 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 334 transitions. [2024-11-07 00:33:13,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:13,519 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 334 transitions. [2024-11-07 00:33:13,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-07 00:33:13,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:13,519 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] [2024-11-07 00:33:13,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-07 00:33:13,519 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:13,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:13,520 INFO L85 PathProgramCache]: Analyzing trace with hash -119228615, now seen corresponding path program 1 times [2024-11-07 00:33:13,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:13,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10323628] [2024-11-07 00:33:13,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:13,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:14,018 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:33:14,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:14,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10323628] [2024-11-07 00:33:14,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10323628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:14,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:14,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 00:33:14,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492163941] [2024-11-07 00:33:14,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:14,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:33:14,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:14,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:33:14,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:33:14,020 INFO L87 Difference]: Start difference. First operand 275 states and 334 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:14,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:14,477 INFO L93 Difference]: Finished difference Result 452 states and 580 transitions. [2024-11-07 00:33:14,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:33:14,478 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-07 00:33:14,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:14,479 INFO L225 Difference]: With dead ends: 452 [2024-11-07 00:33:14,479 INFO L226 Difference]: Without dead ends: 354 [2024-11-07 00:33:14,479 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:33:14,480 INFO L432 NwaCegarLoop]: 377 mSDtfsCounter, 1397 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1397 SdHoareTripleChecker+Valid, 2061 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:14,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1397 Valid, 2061 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:33:14,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-07 00:33:14,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 242. [2024-11-07 00:33:14,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 234 states have (on average 1.2564102564102564) internal successors, (294), 241 states have internal predecessors, (294), 0 states have call successors, (0), 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:33:14,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 294 transitions. [2024-11-07 00:33:14,483 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 294 transitions. Word has length 83 [2024-11-07 00:33:14,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:14,483 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 294 transitions. [2024-11-07 00:33:14,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:14,484 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 294 transitions. [2024-11-07 00:33:14,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-07 00:33:14,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:14,484 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] [2024-11-07 00:33:14,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-07 00:33:14,485 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:14,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:14,485 INFO L85 PathProgramCache]: Analyzing trace with hash 2051820758, now seen corresponding path program 1 times [2024-11-07 00:33:14,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:14,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524046188] [2024-11-07 00:33:14,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:14,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:14,970 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:33:14,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:14,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524046188] [2024-11-07 00:33:14,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524046188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:14,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:14,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 00:33:14,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557022136] [2024-11-07 00:33:14,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:14,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 00:33:14,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:14,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 00:33:14,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-07 00:33:14,972 INFO L87 Difference]: Start difference. First operand 242 states and 294 transitions. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:15,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:15,587 INFO L93 Difference]: Finished difference Result 649 states and 837 transitions. [2024-11-07 00:33:15,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 00:33:15,588 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-07 00:33:15,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:15,589 INFO L225 Difference]: With dead ends: 649 [2024-11-07 00:33:15,589 INFO L226 Difference]: Without dead ends: 568 [2024-11-07 00:33:15,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-11-07 00:33:15,590 INFO L432 NwaCegarLoop]: 416 mSDtfsCounter, 1154 mSDsluCounter, 2797 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1154 SdHoareTripleChecker+Valid, 3213 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:15,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1154 Valid, 3213 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:33:15,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-11-07 00:33:15,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 226. [2024-11-07 00:33:15,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 220 states have (on average 1.25) internal successors, (275), 225 states have internal predecessors, (275), 0 states have call successors, (0), 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:33:15,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 275 transitions. [2024-11-07 00:33:15,592 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 275 transitions. Word has length 83 [2024-11-07 00:33:15,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:15,593 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 275 transitions. [2024-11-07 00:33:15,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:15,593 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 275 transitions. [2024-11-07 00:33:15,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-07 00:33:15,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:15,593 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] [2024-11-07 00:33:15,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-07 00:33:15,593 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:15,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:15,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1787055611, now seen corresponding path program 1 times [2024-11-07 00:33:15,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:15,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62509392] [2024-11-07 00:33:15,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:15,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:16,004 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:33:16,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:16,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62509392] [2024-11-07 00:33:16,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62509392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:16,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:16,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 00:33:16,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773598005] [2024-11-07 00:33:16,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:16,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 00:33:16,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:16,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 00:33:16,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-07 00:33:16,006 INFO L87 Difference]: Start difference. First operand 226 states and 275 transitions. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:16,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:16,720 INFO L93 Difference]: Finished difference Result 585 states and 771 transitions. [2024-11-07 00:33:16,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 00:33:16,720 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-07 00:33:16,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:16,721 INFO L225 Difference]: With dead ends: 585 [2024-11-07 00:33:16,721 INFO L226 Difference]: Without dead ends: 457 [2024-11-07 00:33:16,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-11-07 00:33:16,722 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 741 mSDsluCounter, 4276 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 4819 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:16,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 4819 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:33:16,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-11-07 00:33:16,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 163. [2024-11-07 00:33:16,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 161 states have (on average 1.2422360248447204) internal successors, (200), 162 states have internal predecessors, (200), 0 states have call successors, (0), 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:33:16,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 200 transitions. [2024-11-07 00:33:16,725 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 200 transitions. Word has length 83 [2024-11-07 00:33:16,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:16,725 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 200 transitions. [2024-11-07 00:33:16,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:16,726 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 200 transitions. [2024-11-07 00:33:16,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-07 00:33:16,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:16,726 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] [2024-11-07 00:33:16,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-07 00:33:16,726 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:16,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:16,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1707932206, now seen corresponding path program 1 times [2024-11-07 00:33:16,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:16,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783652777] [2024-11-07 00:33:16,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:16,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:16,903 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:33:16,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:16,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783652777] [2024-11-07 00:33:16,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783652777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:16,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:16,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:33:16,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842383403] [2024-11-07 00:33:16,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:16,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:33:16,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:16,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:33:16,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:33:16,905 INFO L87 Difference]: Start difference. First operand 163 states and 200 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 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:33:17,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:17,212 INFO L93 Difference]: Finished difference Result 338 states and 441 transitions. [2024-11-07 00:33:17,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:33:17,212 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-11-07 00:33:17,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:17,213 INFO L225 Difference]: With dead ends: 338 [2024-11-07 00:33:17,213 INFO L226 Difference]: Without dead ends: 255 [2024-11-07 00:33:17,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:33:17,213 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 413 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:17,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 764 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:33:17,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-07 00:33:17,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 163. [2024-11-07 00:33:17,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 161 states have (on average 1.236024844720497) internal successors, (199), 162 states have internal predecessors, (199), 0 states have call successors, (0), 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:33:17,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 199 transitions. [2024-11-07 00:33:17,215 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 199 transitions. Word has length 84 [2024-11-07 00:33:17,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:17,216 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 199 transitions. [2024-11-07 00:33:17,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 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:33:17,216 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 199 transitions. [2024-11-07 00:33:17,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-07 00:33:17,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:17,216 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] [2024-11-07 00:33:17,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-07 00:33:17,216 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:17,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:17,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1161243347, now seen corresponding path program 1 times [2024-11-07 00:33:17,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:17,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514556500] [2024-11-07 00:33:17,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:17,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:18,475 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:33:18,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:18,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514556500] [2024-11-07 00:33:18,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514556500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:18,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:18,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2024-11-07 00:33:18,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586923400] [2024-11-07 00:33:18,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:18,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-07 00:33:18,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:18,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-07 00:33:18,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:33:18,477 INFO L87 Difference]: Start difference. First operand 163 states and 199 transitions. Second operand has 28 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 28 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:21,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:21,173 INFO L93 Difference]: Finished difference Result 631 states and 835 transitions. [2024-11-07 00:33:21,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-07 00:33:21,173 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 28 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-11-07 00:33:21,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:21,174 INFO L225 Difference]: With dead ends: 631 [2024-11-07 00:33:21,174 INFO L226 Difference]: Without dead ends: 625 [2024-11-07 00:33:21,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=426, Invalid=2124, Unknown=0, NotChecked=0, Total=2550 [2024-11-07 00:33:21,175 INFO L432 NwaCegarLoop]: 546 mSDtfsCounter, 1295 mSDsluCounter, 7337 mSDsCounter, 0 mSdLazyCounter, 3884 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1295 SdHoareTripleChecker+Valid, 7883 SdHoareTripleChecker+Invalid, 3896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:21,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1295 Valid, 7883 Invalid, 3896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3884 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 00:33:21,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2024-11-07 00:33:21,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 184. [2024-11-07 00:33:21,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 182 states have (on average 1.2362637362637363) internal successors, (225), 183 states have internal predecessors, (225), 0 states have call successors, (0), 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:33:21,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 225 transitions. [2024-11-07 00:33:21,179 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 225 transitions. Word has length 86 [2024-11-07 00:33:21,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:21,179 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 225 transitions. [2024-11-07 00:33:21,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 28 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:21,179 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 225 transitions. [2024-11-07 00:33:21,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-07 00:33:21,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:21,179 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] [2024-11-07 00:33:21,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-07 00:33:21,179 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:21,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:21,180 INFO L85 PathProgramCache]: Analyzing trace with hash 91928287, now seen corresponding path program 1 times [2024-11-07 00:33:21,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:21,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979211196] [2024-11-07 00:33:21,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:21,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:21,592 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:33:21,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:21,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979211196] [2024-11-07 00:33:21,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979211196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:21,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:21,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 00:33:21,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357777288] [2024-11-07 00:33:21,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:21,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:33:21,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:21,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:33:21,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:33:21,593 INFO L87 Difference]: Start difference. First operand 184 states and 225 transitions. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:21,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:21,940 INFO L93 Difference]: Finished difference Result 262 states and 336 transitions. [2024-11-07 00:33:21,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:33:21,941 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-11-07 00:33:21,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:21,941 INFO L225 Difference]: With dead ends: 262 [2024-11-07 00:33:21,941 INFO L226 Difference]: Without dead ends: 256 [2024-11-07 00:33:21,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2024-11-07 00:33:21,942 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 831 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:21,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 1185 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:33:21,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-07 00:33:21,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 157. [2024-11-07 00:33:21,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.2371794871794872) internal successors, (193), 156 states have internal predecessors, (193), 0 states have call successors, (0), 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:33:21,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 193 transitions. [2024-11-07 00:33:21,946 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 193 transitions. Word has length 87 [2024-11-07 00:33:21,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:21,946 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 193 transitions. [2024-11-07 00:33:21,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:21,946 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 193 transitions. [2024-11-07 00:33:21,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-07 00:33:21,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:21,947 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:33:21,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-07 00:33:21,947 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:21,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:21,948 INFO L85 PathProgramCache]: Analyzing trace with hash -2132814901, now seen corresponding path program 1 times [2024-11-07 00:33:21,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:21,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741275247] [2024-11-07 00:33:21,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:21,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:22,067 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:33:22,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:22,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741275247] [2024-11-07 00:33:22,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741275247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:22,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:22,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:33:22,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102945527] [2024-11-07 00:33:22,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:22,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:33:22,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:22,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:33:22,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:33:22,069 INFO L87 Difference]: Start difference. First operand 157 states and 193 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 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:33:22,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:22,216 INFO L93 Difference]: Finished difference Result 807 states and 1143 transitions. [2024-11-07 00:33:22,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 00:33:22,216 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2024-11-07 00:33:22,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:22,218 INFO L225 Difference]: With dead ends: 807 [2024-11-07 00:33:22,218 INFO L226 Difference]: Without dead ends: 742 [2024-11-07 00:33:22,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-07 00:33:22,219 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 1268 mSDsluCounter, 1954 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1268 SdHoareTripleChecker+Valid, 2157 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:22,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1268 Valid, 2157 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:33:22,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2024-11-07 00:33:22,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 220. [2024-11-07 00:33:22,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 1.3013698630136987) internal successors, (285), 219 states have internal predecessors, (285), 0 states have call successors, (0), 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:33:22,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 285 transitions. [2024-11-07 00:33:22,224 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 285 transitions. Word has length 114 [2024-11-07 00:33:22,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:22,224 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 285 transitions. [2024-11-07 00:33:22,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 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:33:22,224 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 285 transitions. [2024-11-07 00:33:22,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-07 00:33:22,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:22,224 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:33:22,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-07 00:33:22,225 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:22,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:22,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1778175941, now seen corresponding path program 1 times [2024-11-07 00:33:22,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:22,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051305452] [2024-11-07 00:33:22,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:22,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:22,348 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:33:22,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:22,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051305452] [2024-11-07 00:33:22,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051305452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:22,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:22,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:33:22,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146867027] [2024-11-07 00:33:22,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:22,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:33:22,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:22,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:33:22,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:33:22,349 INFO L87 Difference]: Start difference. First operand 220 states and 285 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 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:33:22,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:22,429 INFO L93 Difference]: Finished difference Result 925 states and 1313 transitions. [2024-11-07 00:33:22,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:33:22,429 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-11-07 00:33:22,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:22,431 INFO L225 Difference]: With dead ends: 925 [2024-11-07 00:33:22,431 INFO L226 Difference]: Without dead ends: 797 [2024-11-07 00:33:22,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:33:22,432 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 1034 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1034 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:22,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1034 Valid, 1201 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:33:22,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2024-11-07 00:33:22,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 346. [2024-11-07 00:33:22,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 345 states have (on average 1.3623188405797102) internal successors, (470), 345 states have internal predecessors, (470), 0 states have call successors, (0), 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:33:22,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 470 transitions. [2024-11-07 00:33:22,438 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 470 transitions. Word has length 116 [2024-11-07 00:33:22,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:22,438 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 470 transitions. [2024-11-07 00:33:22,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 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:33:22,438 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 470 transitions. [2024-11-07 00:33:22,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-07 00:33:22,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:22,439 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:33:22,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-07 00:33:22,439 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:22,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:22,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1881237749, now seen corresponding path program 1 times [2024-11-07 00:33:22,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:22,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672780510] [2024-11-07 00:33:22,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:22,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:22,555 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:33:22,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:22,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672780510] [2024-11-07 00:33:22,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672780510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:22,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:22,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:33:22,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150376330] [2024-11-07 00:33:22,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:22,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:33:22,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:22,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:33:22,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:33:22,557 INFO L87 Difference]: Start difference. First operand 346 states and 470 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 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:33:22,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:22,650 INFO L93 Difference]: Finished difference Result 1051 states and 1498 transitions. [2024-11-07 00:33:22,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:33:22,650 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-11-07 00:33:22,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:22,653 INFO L225 Difference]: With dead ends: 1051 [2024-11-07 00:33:22,653 INFO L226 Difference]: Without dead ends: 923 [2024-11-07 00:33:22,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:33:22,654 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 1034 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1034 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:22,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1034 Valid, 1131 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:33:22,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2024-11-07 00:33:22,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 535. [2024-11-07 00:33:22,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 534 states have (on average 1.398876404494382) internal successors, (747), 534 states have internal predecessors, (747), 0 states have call successors, (0), 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:33:22,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 747 transitions. [2024-11-07 00:33:22,661 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 747 transitions. Word has length 116 [2024-11-07 00:33:22,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:22,661 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 747 transitions. [2024-11-07 00:33:22,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 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:33:22,661 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 747 transitions. [2024-11-07 00:33:22,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-07 00:33:22,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:22,662 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:33:22,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-07 00:33:22,662 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:22,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:22,662 INFO L85 PathProgramCache]: Analyzing trace with hash -455453719, now seen corresponding path program 1 times [2024-11-07 00:33:22,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:22,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965296448] [2024-11-07 00:33:22,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:22,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:22,761 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:33:22,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:22,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965296448] [2024-11-07 00:33:22,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965296448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:22,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:22,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:33:22,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113129275] [2024-11-07 00:33:22,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:22,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:33:22,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:22,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:33:22,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:33:22,762 INFO L87 Difference]: Start difference. First operand 535 states and 747 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 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:33:22,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:22,847 INFO L93 Difference]: Finished difference Result 1177 states and 1683 transitions. [2024-11-07 00:33:22,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:33:22,847 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-11-07 00:33:22,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:22,850 INFO L225 Difference]: With dead ends: 1177 [2024-11-07 00:33:22,850 INFO L226 Difference]: Without dead ends: 1049 [2024-11-07 00:33:22,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:33:22,851 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 1109 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:22,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1109 Valid, 1156 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:33:22,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2024-11-07 00:33:22,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 661. [2024-11-07 00:33:22,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 660 states have (on average 1.412121212121212) internal successors, (932), 660 states have internal predecessors, (932), 0 states have call successors, (0), 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:33:22,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 932 transitions. [2024-11-07 00:33:22,859 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 932 transitions. Word has length 116 [2024-11-07 00:33:22,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:22,859 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 932 transitions. [2024-11-07 00:33:22,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 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:33:22,859 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 932 transitions. [2024-11-07 00:33:22,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-07 00:33:22,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:22,860 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:33:22,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-07 00:33:22,860 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:22,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:22,861 INFO L85 PathProgramCache]: Analyzing trace with hash 2067568748, now seen corresponding path program 1 times [2024-11-07 00:33:22,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:22,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933958648] [2024-11-07 00:33:22,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:22,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:23,006 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:33:23,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:23,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933958648] [2024-11-07 00:33:23,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933958648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:23,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:23,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:33:23,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407418860] [2024-11-07 00:33:23,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:23,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:33:23,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:23,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:33:23,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:33:23,007 INFO L87 Difference]: Start difference. First operand 661 states and 932 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 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:33:23,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:23,099 INFO L93 Difference]: Finished difference Result 1232 states and 1767 transitions. [2024-11-07 00:33:23,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:33:23,100 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-11-07 00:33:23,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:23,101 INFO L225 Difference]: With dead ends: 1232 [2024-11-07 00:33:23,101 INFO L226 Difference]: Without dead ends: 663 [2024-11-07 00:33:23,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-07 00:33:23,102 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 172 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:23,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 550 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:33:23,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2024-11-07 00:33:23,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 661. [2024-11-07 00:33:23,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 660 states have (on average 1.4045454545454545) internal successors, (927), 660 states have internal predecessors, (927), 0 states have call successors, (0), 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:33:23,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 927 transitions. [2024-11-07 00:33:23,108 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 927 transitions. Word has length 116 [2024-11-07 00:33:23,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:23,108 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 927 transitions. [2024-11-07 00:33:23,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 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:33:23,108 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 927 transitions. [2024-11-07 00:33:23,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-07 00:33:23,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:23,109 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:33:23,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-07 00:33:23,109 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:23,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:23,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1298275755, now seen corresponding path program 1 times [2024-11-07 00:33:23,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:23,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205130157] [2024-11-07 00:33:23,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:23,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:23,154 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:33:23,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:23,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205130157] [2024-11-07 00:33:23,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205130157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:23,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:23,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:33:23,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112483063] [2024-11-07 00:33:23,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:23,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:33:23,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:23,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:33:23,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:23,155 INFO L87 Difference]: Start difference. First operand 661 states and 927 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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:33:23,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:23,173 INFO L93 Difference]: Finished difference Result 1741 states and 2488 transitions. [2024-11-07 00:33:23,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:33:23,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-11-07 00:33:23,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:23,175 INFO L225 Difference]: With dead ends: 1741 [2024-11-07 00:33:23,175 INFO L226 Difference]: Without dead ends: 1172 [2024-11-07 00:33:23,176 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:33:23,176 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 82 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 449 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:33:23,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 449 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:33:23,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2024-11-07 00:33:23,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1170. [2024-11-07 00:33:23,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 1169 states have (on average 1.4029084687767321) internal successors, (1640), 1169 states have internal predecessors, (1640), 0 states have call successors, (0), 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:33:23,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1640 transitions. [2024-11-07 00:33:23,185 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1640 transitions. Word has length 116 [2024-11-07 00:33:23,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:23,185 INFO L471 AbstractCegarLoop]: Abstraction has 1170 states and 1640 transitions. [2024-11-07 00:33:23,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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:33:23,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1640 transitions. [2024-11-07 00:33:23,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-07 00:33:23,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:23,186 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:33:23,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-07 00:33:23,186 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:23,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:23,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1451686365, now seen corresponding path program 1 times [2024-11-07 00:33:23,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:23,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971343909] [2024-11-07 00:33:23,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:23,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:23,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:23,309 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:33:23,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:23,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971343909] [2024-11-07 00:33:23,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971343909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:23,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:23,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:33:23,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915682654] [2024-11-07 00:33:23,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:23,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:33:23,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:23,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:33:23,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:33:23,310 INFO L87 Difference]: Start difference. First operand 1170 states and 1640 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 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:33:23,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:23,400 INFO L93 Difference]: Finished difference Result 2377 states and 3366 transitions. [2024-11-07 00:33:23,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:33:23,400 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-11-07 00:33:23,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:23,403 INFO L225 Difference]: With dead ends: 2377 [2024-11-07 00:33:23,403 INFO L226 Difference]: Without dead ends: 2136 [2024-11-07 00:33:23,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:33:23,404 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 1025 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:23,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 1195 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:33:23,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2024-11-07 00:33:23,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 1409. [2024-11-07 00:33:23,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1409 states, 1408 states have (on average 1.4076704545454546) internal successors, (1982), 1408 states have internal predecessors, (1982), 0 states have call successors, (0), 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:33:23,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1409 states and 1982 transitions. [2024-11-07 00:33:23,417 INFO L78 Accepts]: Start accepts. Automaton has 1409 states and 1982 transitions. Word has length 116 [2024-11-07 00:33:23,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:23,417 INFO L471 AbstractCegarLoop]: Abstraction has 1409 states and 1982 transitions. [2024-11-07 00:33:23,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 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:33:23,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 1982 transitions. [2024-11-07 00:33:23,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-07 00:33:23,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:23,418 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:33:23,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-07 00:33:23,418 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:23,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:23,418 INFO L85 PathProgramCache]: Analyzing trace with hash -871511505, now seen corresponding path program 1 times [2024-11-07 00:33:23,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:23,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828784383] [2024-11-07 00:33:23,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:23,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:23,533 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:33:23,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:23,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828784383] [2024-11-07 00:33:23,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828784383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:23,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:23,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:33:23,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700633046] [2024-11-07 00:33:23,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:23,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:33:23,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:23,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:33:23,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:33:23,534 INFO L87 Difference]: Start difference. First operand 1409 states and 1982 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 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:33:23,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:23,628 INFO L93 Difference]: Finished difference Result 2616 states and 3708 transitions. [2024-11-07 00:33:23,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:33:23,628 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-11-07 00:33:23,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:23,631 INFO L225 Difference]: With dead ends: 2616 [2024-11-07 00:33:23,631 INFO L226 Difference]: Without dead ends: 2375 [2024-11-07 00:33:23,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:33:23,632 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 965 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:23,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 1326 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:33:23,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2375 states. [2024-11-07 00:33:23,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2375 to 1648. [2024-11-07 00:33:23,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1647 states have (on average 1.4110503946569521) internal successors, (2324), 1647 states have internal predecessors, (2324), 0 states have call successors, (0), 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:33:23,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2324 transitions. [2024-11-07 00:33:23,658 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2324 transitions. Word has length 116 [2024-11-07 00:33:23,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:23,658 INFO L471 AbstractCegarLoop]: Abstraction has 1648 states and 2324 transitions. [2024-11-07 00:33:23,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 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:33:23,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2324 transitions. [2024-11-07 00:33:23,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-07 00:33:23,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:23,659 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:33:23,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-07 00:33:23,659 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:23,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:23,660 INFO L85 PathProgramCache]: Analyzing trace with hash -389045736, now seen corresponding path program 1 times [2024-11-07 00:33:23,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:23,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414970928] [2024-11-07 00:33:23,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:23,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:23,764 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:33:23,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:23,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414970928] [2024-11-07 00:33:23,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414970928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:23,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:23,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:33:23,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309054248] [2024-11-07 00:33:23,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:23,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:33:23,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:23,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:33:23,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:23,765 INFO L87 Difference]: Start difference. First operand 1648 states and 2324 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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:33:23,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:23,780 INFO L93 Difference]: Finished difference Result 4123 states and 5839 transitions. [2024-11-07 00:33:23,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:33:23,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2024-11-07 00:33:23,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:23,783 INFO L225 Difference]: With dead ends: 4123 [2024-11-07 00:33:23,784 INFO L226 Difference]: Without dead ends: 2567 [2024-11-07 00:33:23,785 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:33:23,785 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 95 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 418 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:33:23,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 418 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:33:23,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2567 states. [2024-11-07 00:33:23,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 2461. [2024-11-07 00:33:23,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2461 states, 2460 states have (on average 1.4048780487804877) internal successors, (3456), 2460 states have internal predecessors, (3456), 0 states have call successors, (0), 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:33:23,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2461 states to 2461 states and 3456 transitions. [2024-11-07 00:33:23,806 INFO L78 Accepts]: Start accepts. Automaton has 2461 states and 3456 transitions. Word has length 117 [2024-11-07 00:33:23,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:23,806 INFO L471 AbstractCegarLoop]: Abstraction has 2461 states and 3456 transitions. [2024-11-07 00:33:23,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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:33:23,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 3456 transitions. [2024-11-07 00:33:23,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-07 00:33:23,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:23,807 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:33:23,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-07 00:33:23,807 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:23,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:23,807 INFO L85 PathProgramCache]: Analyzing trace with hash 966003247, now seen corresponding path program 1 times [2024-11-07 00:33:23,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:23,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418130377] [2024-11-07 00:33:23,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:23,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:23,875 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:33:23,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:23,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418130377] [2024-11-07 00:33:23,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418130377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:23,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:23,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:33:23,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641287227] [2024-11-07 00:33:23,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:23,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:33:23,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:23,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:33:23,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:23,876 INFO L87 Difference]: Start difference. First operand 2461 states and 3456 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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:33:23,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:23,896 INFO L93 Difference]: Finished difference Result 7043 states and 9899 transitions. [2024-11-07 00:33:23,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:33:23,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2024-11-07 00:33:23,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:23,902 INFO L225 Difference]: With dead ends: 7043 [2024-11-07 00:33:23,902 INFO L226 Difference]: Without dead ends: 4674 [2024-11-07 00:33:23,903 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:33:23,904 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 88 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 418 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:33:23,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 418 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:33:23,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4674 states. [2024-11-07 00:33:23,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4674 to 4516. [2024-11-07 00:33:23,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4516 states, 4515 states have (on average 1.3966777408637874) internal successors, (6306), 4515 states have internal predecessors, (6306), 0 states have call successors, (0), 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:33:23,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4516 states to 4516 states and 6306 transitions. [2024-11-07 00:33:23,963 INFO L78 Accepts]: Start accepts. Automaton has 4516 states and 6306 transitions. Word has length 118 [2024-11-07 00:33:23,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:23,964 INFO L471 AbstractCegarLoop]: Abstraction has 4516 states and 6306 transitions. [2024-11-07 00:33:23,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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:33:23,964 INFO L276 IsEmpty]: Start isEmpty. Operand 4516 states and 6306 transitions. [2024-11-07 00:33:23,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 00:33:23,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:23,964 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:33:23,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-11-07 00:33:23,965 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:23,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:23,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1314946245, now seen corresponding path program 1 times [2024-11-07 00:33:23,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:23,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381882065] [2024-11-07 00:33:23,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:23,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:24,068 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:33:24,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:24,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381882065] [2024-11-07 00:33:24,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381882065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:24,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:24,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:33:24,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894925187] [2024-11-07 00:33:24,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:24,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:33:24,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:24,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:33:24,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:24,071 INFO L87 Difference]: Start difference. First operand 4516 states and 6306 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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:33:24,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:24,109 INFO L93 Difference]: Finished difference Result 13052 states and 18176 transitions. [2024-11-07 00:33:24,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:33:24,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2024-11-07 00:33:24,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:24,125 INFO L225 Difference]: With dead ends: 13052 [2024-11-07 00:33:24,125 INFO L226 Difference]: Without dead ends: 8628 [2024-11-07 00:33:24,131 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:33:24,132 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 81 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 418 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:33:24,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 418 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:33:24,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8628 states. [2024-11-07 00:33:24,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8628 to 8314. [2024-11-07 00:33:24,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8314 states, 8313 states have (on average 1.3832551425478166) internal successors, (11499), 8313 states have internal predecessors, (11499), 0 states have call successors, (0), 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:33:24,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8314 states to 8314 states and 11499 transitions. [2024-11-07 00:33:24,229 INFO L78 Accepts]: Start accepts. Automaton has 8314 states and 11499 transitions. Word has length 119 [2024-11-07 00:33:24,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:24,229 INFO L471 AbstractCegarLoop]: Abstraction has 8314 states and 11499 transitions. [2024-11-07 00:33:24,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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:33:24,230 INFO L276 IsEmpty]: Start isEmpty. Operand 8314 states and 11499 transitions. [2024-11-07 00:33:24,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-07 00:33:24,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:24,231 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:33:24,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-11-07 00:33:24,231 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:24,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:24,231 INFO L85 PathProgramCache]: Analyzing trace with hash -590316034, now seen corresponding path program 1 times [2024-11-07 00:33:24,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:24,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304804705] [2024-11-07 00:33:24,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:24,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:24,328 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:33:24,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:24,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304804705] [2024-11-07 00:33:24,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304804705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:24,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:24,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:33:24,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885488654] [2024-11-07 00:33:24,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:24,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:33:24,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:24,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:33:24,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:24,331 INFO L87 Difference]: Start difference. First operand 8314 states and 11499 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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:33:24,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:24,413 INFO L93 Difference]: Finished difference Result 24134 states and 33209 transitions. [2024-11-07 00:33:24,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:33:24,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2024-11-07 00:33:24,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:24,442 INFO L225 Difference]: With dead ends: 24134 [2024-11-07 00:33:24,442 INFO L226 Difference]: Without dead ends: 15912 [2024-11-07 00:33:24,453 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:33:24,454 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 74 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 417 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:33:24,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 417 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:33:24,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15912 states. [2024-11-07 00:33:24,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15912 to 15286. [2024-11-07 00:33:24,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15286 states, 15285 states have (on average 1.3654563297350344) internal successors, (20871), 15285 states have internal predecessors, (20871), 0 states have call successors, (0), 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:33:24,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15286 states to 15286 states and 20871 transitions. [2024-11-07 00:33:24,620 INFO L78 Accepts]: Start accepts. Automaton has 15286 states and 20871 transitions. Word has length 120 [2024-11-07 00:33:24,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:24,620 INFO L471 AbstractCegarLoop]: Abstraction has 15286 states and 20871 transitions. [2024-11-07 00:33:24,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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:33:24,620 INFO L276 IsEmpty]: Start isEmpty. Operand 15286 states and 20871 transitions. [2024-11-07 00:33:24,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-07 00:33:24,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:24,621 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, 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:33:24,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-11-07 00:33:24,621 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:24,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:24,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1670009354, now seen corresponding path program 1 times [2024-11-07 00:33:24,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:24,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062594571] [2024-11-07 00:33:24,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:24,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:24,721 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:33:24,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:24,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062594571] [2024-11-07 00:33:24,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062594571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:24,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:24,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:33:24,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172468205] [2024-11-07 00:33:24,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:24,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:33:24,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:24,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:33:24,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:24,722 INFO L87 Difference]: Start difference. First operand 15286 states and 20871 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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:33:24,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:24,896 INFO L93 Difference]: Finished difference Result 44426 states and 60233 transitions. [2024-11-07 00:33:24,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:33:24,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2024-11-07 00:33:24,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:24,951 INFO L225 Difference]: With dead ends: 44426 [2024-11-07 00:33:24,951 INFO L226 Difference]: Without dead ends: 29232 [2024-11-07 00:33:24,968 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:33:24,969 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 64 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 415 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:33:24,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 415 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:33:24,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29232 states. [2024-11-07 00:33:25,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29232 to 27982. [2024-11-07 00:33:25,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27982 states, 27981 states have (on average 1.3433043851184732) internal successors, (37587), 27981 states have internal predecessors, (37587), 0 states have call successors, (0), 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:33:25,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27982 states to 27982 states and 37587 transitions. [2024-11-07 00:33:25,307 INFO L78 Accepts]: Start accepts. Automaton has 27982 states and 37587 transitions. Word has length 121 [2024-11-07 00:33:25,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:25,308 INFO L471 AbstractCegarLoop]: Abstraction has 27982 states and 37587 transitions. [2024-11-07 00:33:25,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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:33:25,308 INFO L276 IsEmpty]: Start isEmpty. Operand 27982 states and 37587 transitions. [2024-11-07 00:33:25,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-07 00:33:25,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:25,308 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, 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:33:25,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-11-07 00:33:25,308 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:25,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:25,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1801378661, now seen corresponding path program 1 times [2024-11-07 00:33:25,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:25,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672122244] [2024-11-07 00:33:25,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:25,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:25,667 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:33:25,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:25,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672122244] [2024-11-07 00:33:25,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672122244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:25,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:25,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:33:25,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467129769] [2024-11-07 00:33:25,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:25,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:33:25,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:25,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:33:25,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:33:25,668 INFO L87 Difference]: Start difference. First operand 27982 states and 37587 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 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:33:25,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:25,770 INFO L93 Difference]: Finished difference Result 28560 states and 38356 transitions. [2024-11-07 00:33:25,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:33:25,771 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2024-11-07 00:33:25,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:25,813 INFO L225 Difference]: With dead ends: 28560 [2024-11-07 00:33:25,813 INFO L226 Difference]: Without dead ends: 28558 [2024-11-07 00:33:25,827 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:33:25,827 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 0 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 928 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:33:25,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 928 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:33:25,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28558 states. [2024-11-07 00:33:26,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28558 to 28558. [2024-11-07 00:33:26,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28558 states, 28557 states have (on average 1.3285359106348706) internal successors, (37939), 28557 states have internal predecessors, (37939), 0 states have call successors, (0), 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:33:26,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28558 states to 28558 states and 37939 transitions. [2024-11-07 00:33:26,224 INFO L78 Accepts]: Start accepts. Automaton has 28558 states and 37939 transitions. Word has length 122 [2024-11-07 00:33:26,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:26,224 INFO L471 AbstractCegarLoop]: Abstraction has 28558 states and 37939 transitions. [2024-11-07 00:33:26,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 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:33:26,224 INFO L276 IsEmpty]: Start isEmpty. Operand 28558 states and 37939 transitions. [2024-11-07 00:33:26,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-07 00:33:26,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:26,225 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, 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:33:26,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-11-07 00:33:26,225 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:26,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:26,225 INFO L85 PathProgramCache]: Analyzing trace with hash -66701655, now seen corresponding path program 1 times [2024-11-07 00:33:26,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:26,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660600745] [2024-11-07 00:33:26,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:26,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:26,337 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:33:26,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:26,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660600745] [2024-11-07 00:33:26,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660600745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:26,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:26,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:33:26,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029484689] [2024-11-07 00:33:26,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:26,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:33:26,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:26,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:33:26,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:26,338 INFO L87 Difference]: Start difference. First operand 28558 states and 37939 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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:33:26,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:26,427 INFO L93 Difference]: Finished difference Result 57778 states and 76789 transitions. [2024-11-07 00:33:26,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:33:26,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2024-11-07 00:33:26,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:26,463 INFO L225 Difference]: With dead ends: 57778 [2024-11-07 00:33:26,464 INFO L226 Difference]: Without dead ends: 29312 [2024-11-07 00:33:26,493 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:33:26,494 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 107 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 345 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:33:26,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 345 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:33:26,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29312 states. [2024-11-07 00:33:26,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29312 to 29310. [2024-11-07 00:33:26,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29310 states, 29309 states have (on average 1.31410147053806) internal successors, (38515), 29309 states have internal predecessors, (38515), 0 states have call successors, (0), 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:33:26,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29310 states to 29310 states and 38515 transitions. [2024-11-07 00:33:26,764 INFO L78 Accepts]: Start accepts. Automaton has 29310 states and 38515 transitions. Word has length 122 [2024-11-07 00:33:26,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:26,764 INFO L471 AbstractCegarLoop]: Abstraction has 29310 states and 38515 transitions. [2024-11-07 00:33:26,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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:33:26,764 INFO L276 IsEmpty]: Start isEmpty. Operand 29310 states and 38515 transitions. [2024-11-07 00:33:26,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-07 00:33:26,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:26,767 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:26,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-11-07 00:33:26,767 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:26,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:26,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1114959982, now seen corresponding path program 1 times [2024-11-07 00:33:26,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:26,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940972533] [2024-11-07 00:33:26,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:26,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:27,175 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:33:27,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:27,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940972533] [2024-11-07 00:33:27,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940972533] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:33:27,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760360192] [2024-11-07 00:33:27,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:27,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:33:27,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:33:27,179 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:33:27,181 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:33:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:27,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-07 00:33:27,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:33:28,360 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:33:28,361 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:33:30,081 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:33:30,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760360192] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:33:30,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:33:30,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 27 [2024-11-07 00:33:30,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098386304] [2024-11-07 00:33:30,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:33:30,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-07 00:33:30,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:30,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-07 00:33:30,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:33:30,085 INFO L87 Difference]: Start difference. First operand 29310 states and 38515 transitions. Second operand has 28 states, 28 states have (on average 12.892857142857142) internal successors, (361), 27 states have internal predecessors, (361), 0 states have call successors, (0), 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:33:35,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:35,622 INFO L93 Difference]: Finished difference Result 280616 states and 367565 transitions. [2024-11-07 00:33:35,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2024-11-07 00:33:35,622 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 12.892857142857142) internal successors, (361), 27 states have internal predecessors, (361), 0 states have call successors, (0), 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 154 [2024-11-07 00:33:35,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:35,978 INFO L225 Difference]: With dead ends: 280616 [2024-11-07 00:33:35,978 INFO L226 Difference]: Without dead ends: 251398 [2024-11-07 00:33:36,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7082 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3035, Invalid=18135, Unknown=0, NotChecked=0, Total=21170 [2024-11-07 00:33:36,038 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 2918 mSDsluCounter, 4754 mSDsCounter, 0 mSdLazyCounter, 4594 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2918 SdHoareTripleChecker+Valid, 5017 SdHoareTripleChecker+Invalid, 4623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 4594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:36,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2918 Valid, 5017 Invalid, 4623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 4594 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-07 00:33:36,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251398 states. [2024-11-07 00:33:37,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251398 to 150728. [2024-11-07 00:33:37,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150728 states, 150727 states have (on average 1.3037212974450496) internal successors, (196506), 150727 states have internal predecessors, (196506), 0 states have call successors, (0), 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:33:38,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150728 states to 150728 states and 196506 transitions. [2024-11-07 00:33:38,503 INFO L78 Accepts]: Start accepts. Automaton has 150728 states and 196506 transitions. Word has length 154 [2024-11-07 00:33:38,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:38,503 INFO L471 AbstractCegarLoop]: Abstraction has 150728 states and 196506 transitions. [2024-11-07 00:33:38,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 12.892857142857142) internal successors, (361), 27 states have internal predecessors, (361), 0 states have call successors, (0), 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:33:38,503 INFO L276 IsEmpty]: Start isEmpty. Operand 150728 states and 196506 transitions. [2024-11-07 00:33:38,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 00:33:38,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:38,517 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:38,539 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:33:38,718 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,SelfDestructingSolverStorable57 [2024-11-07 00:33:38,719 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-07 00:33:38,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:38,720 INFO L85 PathProgramCache]: Analyzing trace with hash -157592162, now seen corresponding path program 1 times [2024-11-07 00:33:38,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:38,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038229271] [2024-11-07 00:33:38,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:38,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:39,159 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:33:39,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:39,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038229271] [2024-11-07 00:33:39,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038229271] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:33:39,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460407386] [2024-11-07 00:33:39,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:39,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:33:39,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:33:39,163 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:33:39,164 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:33:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:39,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-07 00:33:39,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:33:40,316 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:33:40,317 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:33:40,982 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:33:40,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460407386] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:33:40,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:33:40,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2024-11-07 00:33:40,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371536540] [2024-11-07 00:33:40,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:33:40,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-07 00:33:40,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:40,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-07 00:33:40,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2024-11-07 00:33:40,984 INFO L87 Difference]: Start difference. First operand 150728 states and 196506 transitions. Second operand has 25 states, 25 states have (on average 16.52) internal successors, (413), 25 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)