./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/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 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8381803db0f296b6c475c94ca7dd8f9a2c79c383b82b37638a653c8556f3f15c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 01:50:03,725 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:50:03,807 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:50:03,814 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:50:03,816 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:50:03,847 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:50:03,848 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:50:03,849 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:50:03,850 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:50:03,851 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:50:03,852 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:50:03,852 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:50:03,853 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:50:03,853 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:50:03,854 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:50:03,855 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:50:03,855 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:50:03,855 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:50:03,855 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:50:03,856 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:50:03,856 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:50:03,856 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:50:03,857 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:50:03,857 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:50:03,857 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:50:03,857 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:50:03,858 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:50:03,858 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:50:03,858 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:50:03,859 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:50:03,859 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:50:03,859 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:50:03,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:50:03,860 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:50:03,860 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:50:03,860 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:50:03,861 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:50:03,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:50:03,861 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:50:03,861 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:50:03,862 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:50:03,863 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:50:03,863 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8381803db0f296b6c475c94ca7dd8f9a2c79c383b82b37638a653c8556f3f15c [2024-10-24 01:50:04,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:50:04,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:50:04,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:50:04,177 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:50:04,178 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:50:04,179 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2024-10-24 01:50:05,695 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:50:06,043 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:50:06,045 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2024-10-24 01:50:06,067 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13194f05a/c3ec04665cb847dcaf174363a3fd5ad0/FLAGb56f70327 [2024-10-24 01:50:06,275 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13194f05a/c3ec04665cb847dcaf174363a3fd5ad0 [2024-10-24 01:50:06,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:50:06,279 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:50:06,282 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:50:06,283 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:50:06,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:50:06,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:50:06" (1/1) ... [2024-10-24 01:50:06,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@424ad85b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:06, skipping insertion in model container [2024-10-24 01:50:06,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:50:06" (1/1) ... [2024-10-24 01:50:06,431 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:50:06,763 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[11561,11574] [2024-10-24 01:50:06,802 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[15618,15631] [2024-10-24 01:50:06,818 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[16839,16852] [2024-10-24 01:50:06,823 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[17545,17558] [2024-10-24 01:50:06,841 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[19131,19144] [2024-10-24 01:50:06,848 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[19837,19850] [2024-10-24 01:50:06,862 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[20908,20921] [2024-10-24 01:50:06,884 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[23398,23411] [2024-10-24 01:50:06,893 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[24107,24120] [2024-10-24 01:50:06,902 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[25144,25157] [2024-10-24 01:50:06,920 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[27082,27095] [2024-10-24 01:50:06,942 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[31116,31129] [2024-10-24 01:50:06,947 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[31825,31838] [2024-10-24 01:50:06,951 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[32899,32912] [2024-10-24 01:50:06,965 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[34874,34887] [2024-10-24 01:50:06,983 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[38255,38268] [2024-10-24 01:50:07,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:50:07,150 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:50:07,240 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[11561,11574] [2024-10-24 01:50:07,259 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[15618,15631] [2024-10-24 01:50:07,296 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[16839,16852] [2024-10-24 01:50:07,303 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[17545,17558] [2024-10-24 01:50:07,315 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[19131,19144] [2024-10-24 01:50:07,319 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[19837,19850] [2024-10-24 01:50:07,325 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[20908,20921] [2024-10-24 01:50:07,333 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[23398,23411] [2024-10-24 01:50:07,336 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[24107,24120] [2024-10-24 01:50:07,339 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[25144,25157] [2024-10-24 01:50:07,345 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[27082,27095] [2024-10-24 01:50:07,358 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[31116,31129] [2024-10-24 01:50:07,363 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[31825,31838] [2024-10-24 01:50:07,370 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[32899,32912] [2024-10-24 01:50:07,376 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[34874,34887] [2024-10-24 01:50:07,384 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[38255,38268] [2024-10-24 01:50:07,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:50:07,492 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:50:07,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:07 WrapperNode [2024-10-24 01:50:07,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:50:07,494 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:50:07,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:50:07,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:50:07,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:07" (1/1) ... [2024-10-24 01:50:07,546 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:07" (1/1) ... [2024-10-24 01:50:07,632 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3756 [2024-10-24 01:50:07,633 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:50:07,633 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:50:07,634 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:50:07,634 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:50:07,644 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:07" (1/1) ... [2024-10-24 01:50:07,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:07" (1/1) ... [2024-10-24 01:50:07,655 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:07" (1/1) ... [2024-10-24 01:50:07,701 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-10-24 01:50:07,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:07" (1/1) ... [2024-10-24 01:50:07,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:07" (1/1) ... [2024-10-24 01:50:07,741 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:07" (1/1) ... [2024-10-24 01:50:07,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:07" (1/1) ... [2024-10-24 01:50:07,766 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:07" (1/1) ... [2024-10-24 01:50:07,781 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:07" (1/1) ... [2024-10-24 01:50:07,802 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:50:07,804 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:50:07,804 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:50:07,805 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:50:07,806 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:07" (1/1) ... [2024-10-24 01:50:07,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:50:07,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:50:07,839 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 01:50:07,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 01:50:07,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:50:07,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:50:07,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:50:07,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:50:08,112 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:50:08,114 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:50:10,070 INFO L? ?]: Removed 602 outVars from TransFormulas that were not future-live. [2024-10-24 01:50:10,070 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:50:10,143 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:50:10,147 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 01:50:10,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:50:10 BoogieIcfgContainer [2024-10-24 01:50:10,148 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:50:10,150 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:50:10,150 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:50:10,153 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:50:10,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:50:06" (1/3) ... [2024-10-24 01:50:10,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c27cc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:50:10, skipping insertion in model container [2024-10-24 01:50:10,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:50:07" (2/3) ... [2024-10-24 01:50:10,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c27cc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:50:10, skipping insertion in model container [2024-10-24 01:50:10,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:50:10" (3/3) ... [2024-10-24 01:50:10,156 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2024-10-24 01:50:10,174 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:50:10,174 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-10-24 01:50:10,293 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:50:10,299 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;@7ffa0e6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:50:10,300 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-24 01:50:10,311 INFO L276 IsEmpty]: Start isEmpty. Operand has 627 states, 610 states have (on average 1.8508196721311476) internal successors, (1129), 626 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:10,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-24 01:50:10,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:10,335 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:10,336 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-10-24 01:50:10,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:10,341 INFO L85 PathProgramCache]: Analyzing trace with hash 533676138, now seen corresponding path program 1 times [2024-10-24 01:50:10,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:10,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347002371] [2024-10-24 01:50:10,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:10,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:10,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:10,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:10,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347002371] [2024-10-24 01:50:10,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347002371] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:10,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:10,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:50:10,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153326460] [2024-10-24 01:50:10,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:10,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:50:10,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:10,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:50:10,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:50:10,988 INFO L87 Difference]: Start difference. First operand has 627 states, 610 states have (on average 1.8508196721311476) internal successors, (1129), 626 states have internal predecessors, (1129), 0 states have call successors, (0), 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.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:11,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:11,505 INFO L93 Difference]: Finished difference Result 971 states and 1687 transitions. [2024-10-24 01:50:11,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:50:11,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-10-24 01:50:11,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:11,526 INFO L225 Difference]: With dead ends: 971 [2024-10-24 01:50:11,526 INFO L226 Difference]: Without dead ends: 509 [2024-10-24 01:50:11,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:50:11,536 INFO L432 NwaCegarLoop]: 581 mSDtfsCounter, 2540 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2540 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:11,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2540 Valid, 621 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 01:50:11,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-10-24 01:50:11,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2024-10-24 01:50:11,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 493 states have (on average 1.3022312373225151) internal successors, (642), 508 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:11,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 642 transitions. [2024-10-24 01:50:11,600 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 642 transitions. Word has length 71 [2024-10-24 01:50:11,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:11,601 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 642 transitions. [2024-10-24 01:50:11,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:11,602 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 642 transitions. [2024-10-24 01:50:11,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-24 01:50:11,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:11,608 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-10-24 01:50:11,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:50:11,608 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-10-24 01:50:11,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:11,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1104820237, now seen corresponding path program 1 times [2024-10-24 01:50:11,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:11,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802922307] [2024-10-24 01:50:11,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:11,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:11,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:11,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:11,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802922307] [2024-10-24 01:50:11,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802922307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:11,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:11,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:50:11,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132056559] [2024-10-24 01:50:11,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:11,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:50:11,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:11,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:50:11,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:50:11,854 INFO L87 Difference]: Start difference. First operand 509 states and 642 transitions. 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-10-24 01:50:12,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:12,166 INFO L93 Difference]: Finished difference Result 847 states and 1098 transitions. [2024-10-24 01:50:12,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:50:12,166 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-10-24 01:50:12,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:12,170 INFO L225 Difference]: With dead ends: 847 [2024-10-24 01:50:12,171 INFO L226 Difference]: Without dead ends: 442 [2024-10-24 01:50:12,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:50:12,174 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 1655 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1655 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:12,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1655 Valid, 336 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:50:12,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-10-24 01:50:12,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2024-10-24 01:50:12,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 426 states have (on average 1.3286384976525822) internal successors, (566), 441 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:12,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 566 transitions. [2024-10-24 01:50:12,189 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 566 transitions. Word has length 72 [2024-10-24 01:50:12,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:12,190 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 566 transitions. [2024-10-24 01:50:12,190 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-10-24 01:50:12,190 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 566 transitions. [2024-10-24 01:50:12,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-24 01:50:12,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:12,192 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-10-24 01:50:12,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 01:50:12,192 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-10-24 01:50:12,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:12,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1559303919, now seen corresponding path program 1 times [2024-10-24 01:50:12,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:12,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345804717] [2024-10-24 01:50:12,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:12,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:12,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:12,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:12,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345804717] [2024-10-24 01:50:12,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345804717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:12,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:12,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:50:12,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999824925] [2024-10-24 01:50:12,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:12,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:50:12,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:12,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:50:12,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:50:12,384 INFO L87 Difference]: Start difference. First operand 442 states and 566 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-10-24 01:50:12,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:12,691 INFO L93 Difference]: Finished difference Result 780 states and 1021 transitions. [2024-10-24 01:50:12,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:50:12,692 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-10-24 01:50:12,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:12,696 INFO L225 Difference]: With dead ends: 780 [2024-10-24 01:50:12,696 INFO L226 Difference]: Without dead ends: 416 [2024-10-24 01:50:12,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:50:12,700 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 1523 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:12,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 317 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:50:12,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-10-24 01:50:12,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2024-10-24 01:50:12,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 400 states have (on average 1.3375) internal successors, (535), 415 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:12,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 535 transitions. [2024-10-24 01:50:12,728 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 535 transitions. Word has length 73 [2024-10-24 01:50:12,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:12,728 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 535 transitions. [2024-10-24 01:50:12,728 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-10-24 01:50:12,729 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 535 transitions. [2024-10-24 01:50:12,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-24 01:50:12,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:12,733 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-10-24 01:50:12,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 01:50:12,734 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-10-24 01:50:12,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:12,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1409781752, now seen corresponding path program 1 times [2024-10-24 01:50:12,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:12,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437820898] [2024-10-24 01:50:12,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:12,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:12,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:12,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:12,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437820898] [2024-10-24 01:50:12,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437820898] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:12,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:12,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:50:12,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677180293] [2024-10-24 01:50:12,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:12,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:50:12,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:12,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:50:12,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:50:12,955 INFO L87 Difference]: Start difference. First operand 416 states and 535 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-10-24 01:50:13,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:13,214 INFO L93 Difference]: Finished difference Result 754 states and 989 transitions. [2024-10-24 01:50:13,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:50:13,215 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-10-24 01:50:13,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:13,217 INFO L225 Difference]: With dead ends: 754 [2024-10-24 01:50:13,217 INFO L226 Difference]: Without dead ends: 397 [2024-10-24 01:50:13,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:50:13,219 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 1484 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:13,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 306 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:50:13,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-10-24 01:50:13,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2024-10-24 01:50:13,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.3464566929133859) internal successors, (513), 396 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:13,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 513 transitions. [2024-10-24 01:50:13,228 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 513 transitions. Word has length 74 [2024-10-24 01:50:13,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:13,229 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 513 transitions. [2024-10-24 01:50:13,230 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-10-24 01:50:13,230 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 513 transitions. [2024-10-24 01:50:13,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-24 01:50:13,231 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:13,232 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-10-24 01:50:13,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 01:50:13,232 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-10-24 01:50:13,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:13,233 INFO L85 PathProgramCache]: Analyzing trace with hash 254667180, now seen corresponding path program 1 times [2024-10-24 01:50:13,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:13,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498086103] [2024-10-24 01:50:13,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:13,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:13,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:13,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:13,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498086103] [2024-10-24 01:50:13,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498086103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:13,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:13,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:50:13,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001208505] [2024-10-24 01:50:13,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:13,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:50:13,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:13,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:50:13,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:50:13,395 INFO L87 Difference]: Start difference. First operand 397 states and 513 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-10-24 01:50:13,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:13,734 INFO L93 Difference]: Finished difference Result 735 states and 966 transitions. [2024-10-24 01:50:13,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:50:13,735 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-10-24 01:50:13,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:13,737 INFO L225 Difference]: With dead ends: 735 [2024-10-24 01:50:13,738 INFO L226 Difference]: Without dead ends: 392 [2024-10-24 01:50:13,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:50:13,739 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 1416 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1416 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:13,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1416 Valid, 281 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:50:13,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-24 01:50:13,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-24 01:50:13,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 376 states have (on average 1.3457446808510638) internal successors, (506), 391 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-10-24 01:50:13,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 506 transitions. [2024-10-24 01:50:13,749 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 506 transitions. Word has length 75 [2024-10-24 01:50:13,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:13,749 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 506 transitions. [2024-10-24 01:50:13,750 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-10-24 01:50:13,750 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 506 transitions. [2024-10-24 01:50:13,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 01:50:13,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:13,755 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-10-24 01:50:13,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 01:50:13,755 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-10-24 01:50:13,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:13,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1435179207, now seen corresponding path program 1 times [2024-10-24 01:50:13,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:13,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979069943] [2024-10-24 01:50:13,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:13,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:14,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:14,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:14,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979069943] [2024-10-24 01:50:14,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979069943] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:14,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:14,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:14,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509478749] [2024-10-24 01:50:14,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:14,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:14,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:14,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:14,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:14,199 INFO L87 Difference]: Start difference. First operand 392 states and 506 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 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-10-24 01:50:15,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:15,075 INFO L93 Difference]: Finished difference Result 694 states and 914 transitions. [2024-10-24 01:50:15,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:50:15,076 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 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-10-24 01:50:15,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:15,080 INFO L225 Difference]: With dead ends: 694 [2024-10-24 01:50:15,080 INFO L226 Difference]: Without dead ends: 604 [2024-10-24 01:50:15,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:50:15,083 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 1540 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1540 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:15,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1540 Valid, 1594 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 01:50:15,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-24 01:50:15,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 392. [2024-10-24 01:50:15,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 376 states have (on average 1.3430851063829787) internal successors, (505), 391 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-10-24 01:50:15,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 505 transitions. [2024-10-24 01:50:15,094 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 505 transitions. Word has length 76 [2024-10-24 01:50:15,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:15,095 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 505 transitions. [2024-10-24 01:50:15,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 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-10-24 01:50:15,096 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 505 transitions. [2024-10-24 01:50:15,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 01:50:15,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:15,099 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-10-24 01:50:15,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 01:50:15,100 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-10-24 01:50:15,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:15,100 INFO L85 PathProgramCache]: Analyzing trace with hash 980279151, now seen corresponding path program 1 times [2024-10-24 01:50:15,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:15,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288302649] [2024-10-24 01:50:15,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:15,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:15,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:15,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:15,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288302649] [2024-10-24 01:50:15,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288302649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:15,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:15,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:15,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071107608] [2024-10-24 01:50:15,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:15,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:15,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:15,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:15,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:15,543 INFO L87 Difference]: Start difference. First operand 392 states and 505 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 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-10-24 01:50:16,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:16,370 INFO L93 Difference]: Finished difference Result 737 states and 968 transitions. [2024-10-24 01:50:16,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:50:16,370 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 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-10-24 01:50:16,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:16,373 INFO L225 Difference]: With dead ends: 737 [2024-10-24 01:50:16,374 INFO L226 Difference]: Without dead ends: 608 [2024-10-24 01:50:16,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:50:16,375 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 1536 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1536 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:16,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1536 Valid, 1596 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 01:50:16,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-10-24 01:50:16,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 392. [2024-10-24 01:50:16,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 376 states have (on average 1.3404255319148937) internal successors, (504), 391 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-10-24 01:50:16,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 504 transitions. [2024-10-24 01:50:16,384 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 504 transitions. Word has length 76 [2024-10-24 01:50:16,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:16,384 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 504 transitions. [2024-10-24 01:50:16,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 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-10-24 01:50:16,385 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 504 transitions. [2024-10-24 01:50:16,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 01:50:16,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:16,386 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-10-24 01:50:16,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 01:50:16,386 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:16,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:16,387 INFO L85 PathProgramCache]: Analyzing trace with hash -612595194, now seen corresponding path program 1 times [2024-10-24 01:50:16,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:16,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678178283] [2024-10-24 01:50:16,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:16,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:16,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:16,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:16,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678178283] [2024-10-24 01:50:16,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678178283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:16,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:16,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:50:16,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54333707] [2024-10-24 01:50:16,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:16,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:50:16,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:16,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:50:16,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:50:16,760 INFO L87 Difference]: Start difference. First operand 392 states and 504 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 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-10-24 01:50:17,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:17,348 INFO L93 Difference]: Finished difference Result 759 states and 962 transitions. [2024-10-24 01:50:17,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 01:50:17,349 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 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-10-24 01:50:17,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:17,351 INFO L225 Difference]: With dead ends: 759 [2024-10-24 01:50:17,351 INFO L226 Difference]: Without dead ends: 546 [2024-10-24 01:50:17,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-10-24 01:50:17,353 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 1759 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1759 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:17,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1759 Valid, 900 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:50:17,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2024-10-24 01:50:17,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 392. [2024-10-24 01:50:17,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 376 states have (on average 1.3377659574468086) internal successors, (503), 391 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-10-24 01:50:17,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 503 transitions. [2024-10-24 01:50:17,365 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 503 transitions. Word has length 76 [2024-10-24 01:50:17,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:17,365 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 503 transitions. [2024-10-24 01:50:17,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 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-10-24 01:50:17,366 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 503 transitions. [2024-10-24 01:50:17,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 01:50:17,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:17,367 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] [2024-10-24 01:50:17,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 01:50:17,367 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:17,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:17,368 INFO L85 PathProgramCache]: Analyzing trace with hash -988049107, now seen corresponding path program 1 times [2024-10-24 01:50:17,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:17,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874710991] [2024-10-24 01:50:17,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:17,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:17,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-10-24 01:50:17,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:17,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874710991] [2024-10-24 01:50:17,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874710991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:17,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:17,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 01:50:17,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619093426] [2024-10-24 01:50:17,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:17,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 01:50:17,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:17,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 01:50:17,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:50:17,956 INFO L87 Difference]: Start difference. First operand 392 states and 503 transitions. Second operand has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:19,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:19,356 INFO L93 Difference]: Finished difference Result 951 states and 1280 transitions. [2024-10-24 01:50:19,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 01:50:19,356 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-24 01:50:19,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:19,360 INFO L225 Difference]: With dead ends: 951 [2024-10-24 01:50:19,360 INFO L226 Difference]: Without dead ends: 852 [2024-10-24 01:50:19,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-10-24 01:50:19,362 INFO L432 NwaCegarLoop]: 376 mSDtfsCounter, 3715 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 1495 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3715 SdHoareTripleChecker+Valid, 1814 SdHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:19,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3715 Valid, 1814 Invalid, 1636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1495 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 01:50:19,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2024-10-24 01:50:19,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 396. [2024-10-24 01:50:19,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 380 states have (on average 1.3342105263157895) internal successors, (507), 395 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-10-24 01:50:19,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 507 transitions. [2024-10-24 01:50:19,373 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 507 transitions. Word has length 78 [2024-10-24 01:50:19,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:19,374 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 507 transitions. [2024-10-24 01:50:19,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:19,374 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 507 transitions. [2024-10-24 01:50:19,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 01:50:19,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:19,375 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] [2024-10-24 01:50:19,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 01:50:19,376 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:19,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:19,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1396894335, now seen corresponding path program 1 times [2024-10-24 01:50:19,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:19,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283070854] [2024-10-24 01:50:19,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:19,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:19,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:19,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:19,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283070854] [2024-10-24 01:50:19,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283070854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:19,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:19,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:19,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741984901] [2024-10-24 01:50:19,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:19,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:19,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:19,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:19,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:19,748 INFO L87 Difference]: Start difference. First operand 396 states and 507 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:20,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:20,476 INFO L93 Difference]: Finished difference Result 677 states and 880 transitions. [2024-10-24 01:50:20,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:50:20,477 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-24 01:50:20,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:20,479 INFO L225 Difference]: With dead ends: 677 [2024-10-24 01:50:20,479 INFO L226 Difference]: Without dead ends: 600 [2024-10-24 01:50:20,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-24 01:50:20,480 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 2001 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2001 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:20,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2001 Valid, 1296 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 01:50:20,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-10-24 01:50:20,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 396. [2024-10-24 01:50:20,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 380 states have (on average 1.331578947368421) internal successors, (506), 395 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-10-24 01:50:20,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 506 transitions. [2024-10-24 01:50:20,488 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 506 transitions. Word has length 78 [2024-10-24 01:50:20,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:20,489 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 506 transitions. [2024-10-24 01:50:20,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:20,489 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 506 transitions. [2024-10-24 01:50:20,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 01:50:20,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:20,490 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] [2024-10-24 01:50:20,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 01:50:20,490 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:20,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:20,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1028792160, now seen corresponding path program 1 times [2024-10-24 01:50:20,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:20,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170351115] [2024-10-24 01:50:20,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:20,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:20,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:20,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:20,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170351115] [2024-10-24 01:50:20,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170351115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:20,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:20,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:20,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946631236] [2024-10-24 01:50:20,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:20,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:20,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:20,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:20,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:20,775 INFO L87 Difference]: Start difference. First operand 396 states and 506 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:21,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:21,459 INFO L93 Difference]: Finished difference Result 677 states and 878 transitions. [2024-10-24 01:50:21,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 01:50:21,460 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-24 01:50:21,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:21,463 INFO L225 Difference]: With dead ends: 677 [2024-10-24 01:50:21,463 INFO L226 Difference]: Without dead ends: 600 [2024-10-24 01:50:21,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-24 01:50:21,464 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 1996 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1996 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:21,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1996 Valid, 1281 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:50:21,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-10-24 01:50:21,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 396. [2024-10-24 01:50:21,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 380 states have (on average 1.3289473684210527) internal successors, (505), 395 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-10-24 01:50:21,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 505 transitions. [2024-10-24 01:50:21,472 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 505 transitions. Word has length 78 [2024-10-24 01:50:21,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:21,473 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 505 transitions. [2024-10-24 01:50:21,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:21,473 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 505 transitions. [2024-10-24 01:50:21,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 01:50:21,474 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:21,474 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] [2024-10-24 01:50:21,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 01:50:21,475 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:21,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:21,475 INFO L85 PathProgramCache]: Analyzing trace with hash -391975036, now seen corresponding path program 1 times [2024-10-24 01:50:21,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:21,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804296178] [2024-10-24 01:50:21,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:21,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:21,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:21,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:21,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804296178] [2024-10-24 01:50:21,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804296178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:21,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:21,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:21,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110591708] [2024-10-24 01:50:21,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:21,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:21,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:21,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:21,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:21,749 INFO L87 Difference]: Start difference. First operand 396 states and 505 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:22,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:22,516 INFO L93 Difference]: Finished difference Result 673 states and 873 transitions. [2024-10-24 01:50:22,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:50:22,518 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-24 01:50:22,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:22,520 INFO L225 Difference]: With dead ends: 673 [2024-10-24 01:50:22,520 INFO L226 Difference]: Without dead ends: 600 [2024-10-24 01:50:22,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-24 01:50:22,521 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 1996 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1996 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:22,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1996 Valid, 1296 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 01:50:22,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-10-24 01:50:22,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 396. [2024-10-24 01:50:22,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 380 states have (on average 1.3263157894736841) internal successors, (504), 395 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-10-24 01:50:22,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 504 transitions. [2024-10-24 01:50:22,528 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 504 transitions. Word has length 78 [2024-10-24 01:50:22,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:22,529 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 504 transitions. [2024-10-24 01:50:22,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:22,529 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 504 transitions. [2024-10-24 01:50:22,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 01:50:22,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:22,530 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] [2024-10-24 01:50:22,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 01:50:22,530 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:22,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:22,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1002682727, now seen corresponding path program 1 times [2024-10-24 01:50:22,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:22,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887933796] [2024-10-24 01:50:22,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:22,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:22,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:23,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:23,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:23,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887933796] [2024-10-24 01:50:23,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887933796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:23,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:23,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 01:50:23,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689377696] [2024-10-24 01:50:23,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:23,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 01:50:23,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:23,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 01:50:23,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-24 01:50:23,005 INFO L87 Difference]: Start difference. First operand 396 states and 504 transitions. Second operand has 10 states, 10 states have (on average 7.8) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:24,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:24,072 INFO L93 Difference]: Finished difference Result 832 states and 1090 transitions. [2024-10-24 01:50:24,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 01:50:24,073 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-24 01:50:24,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:24,075 INFO L225 Difference]: With dead ends: 832 [2024-10-24 01:50:24,075 INFO L226 Difference]: Without dead ends: 688 [2024-10-24 01:50:24,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2024-10-24 01:50:24,077 INFO L432 NwaCegarLoop]: 421 mSDtfsCounter, 1973 mSDsluCounter, 1747 mSDsCounter, 0 mSdLazyCounter, 1611 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1973 SdHoareTripleChecker+Valid, 2168 SdHoareTripleChecker+Invalid, 1622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:24,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1973 Valid, 2168 Invalid, 1622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1611 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 01:50:24,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2024-10-24 01:50:24,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 396. [2024-10-24 01:50:24,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 380 states have (on average 1.3236842105263158) internal successors, (503), 395 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-10-24 01:50:24,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 503 transitions. [2024-10-24 01:50:24,085 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 503 transitions. Word has length 78 [2024-10-24 01:50:24,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:24,086 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 503 transitions. [2024-10-24 01:50:24,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:24,086 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 503 transitions. [2024-10-24 01:50:24,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 01:50:24,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:24,087 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] [2024-10-24 01:50:24,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 01:50:24,088 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:24,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:24,088 INFO L85 PathProgramCache]: Analyzing trace with hash 423246883, now seen corresponding path program 1 times [2024-10-24 01:50:24,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:24,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316640529] [2024-10-24 01:50:24,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:24,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:24,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:24,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:24,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316640529] [2024-10-24 01:50:24,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316640529] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:24,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:24,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:24,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574445536] [2024-10-24 01:50:24,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:24,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:24,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:24,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:24,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:24,415 INFO L87 Difference]: Start difference. First operand 396 states and 503 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:25,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:25,091 INFO L93 Difference]: Finished difference Result 677 states and 874 transitions. [2024-10-24 01:50:25,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:50:25,091 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-24 01:50:25,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:25,093 INFO L225 Difference]: With dead ends: 677 [2024-10-24 01:50:25,093 INFO L226 Difference]: Without dead ends: 600 [2024-10-24 01:50:25,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-24 01:50:25,094 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 1988 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1988 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:25,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1988 Valid, 1296 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 984 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:50:25,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-10-24 01:50:25,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 396. [2024-10-24 01:50:25,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 380 states have (on average 1.3210526315789475) internal successors, (502), 395 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-10-24 01:50:25,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 502 transitions. [2024-10-24 01:50:25,102 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 502 transitions. Word has length 78 [2024-10-24 01:50:25,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:25,103 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 502 transitions. [2024-10-24 01:50:25,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:25,103 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 502 transitions. [2024-10-24 01:50:25,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 01:50:25,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:25,104 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:25,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 01:50:25,105 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:25,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:25,105 INFO L85 PathProgramCache]: Analyzing trace with hash 832092111, now seen corresponding path program 1 times [2024-10-24 01:50:25,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:25,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947674044] [2024-10-24 01:50:25,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:25,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:25,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:25,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:25,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947674044] [2024-10-24 01:50:25,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947674044] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:25,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:25,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:25,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628096817] [2024-10-24 01:50:25,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:25,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:25,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:25,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:25,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:25,343 INFO L87 Difference]: Start difference. First operand 396 states and 502 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:25,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:25,939 INFO L93 Difference]: Finished difference Result 589 states and 741 transitions. [2024-10-24 01:50:25,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:50:25,939 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-24 01:50:25,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:25,941 INFO L225 Difference]: With dead ends: 589 [2024-10-24 01:50:25,942 INFO L226 Difference]: Without dead ends: 584 [2024-10-24 01:50:25,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-24 01:50:25,942 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 1276 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1276 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:25,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1276 Valid, 1289 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:50:25,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2024-10-24 01:50:25,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 396. [2024-10-24 01:50:25,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 380 states have (on average 1.318421052631579) internal successors, (501), 395 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-10-24 01:50:25,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 501 transitions. [2024-10-24 01:50:25,950 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 501 transitions. Word has length 78 [2024-10-24 01:50:25,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:25,950 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 501 transitions. [2024-10-24 01:50:25,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:25,950 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 501 transitions. [2024-10-24 01:50:25,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 01:50:25,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:25,951 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] [2024-10-24 01:50:25,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 01:50:25,952 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:25,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:25,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1550678083, now seen corresponding path program 1 times [2024-10-24 01:50:25,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:25,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598176162] [2024-10-24 01:50:25,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:25,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:26,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:26,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:26,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598176162] [2024-10-24 01:50:26,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598176162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:26,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:26,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:26,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065077805] [2024-10-24 01:50:26,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:26,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:26,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:26,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:26,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:26,313 INFO L87 Difference]: Start difference. First operand 396 states and 501 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:26,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:26,952 INFO L93 Difference]: Finished difference Result 703 states and 909 transitions. [2024-10-24 01:50:26,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:50:26,953 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-24 01:50:26,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:26,954 INFO L225 Difference]: With dead ends: 703 [2024-10-24 01:50:26,955 INFO L226 Difference]: Without dead ends: 604 [2024-10-24 01:50:26,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:50:26,956 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 1507 mSDsluCounter, 1571 mSDsCounter, 0 mSdLazyCounter, 1305 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1996 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:26,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 1996 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1305 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:50:26,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-24 01:50:26,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 396. [2024-10-24 01:50:26,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 380 states have (on average 1.3157894736842106) internal successors, (500), 395 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-10-24 01:50:26,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 500 transitions. [2024-10-24 01:50:26,963 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 500 transitions. Word has length 78 [2024-10-24 01:50:26,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:26,964 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 500 transitions. [2024-10-24 01:50:26,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:26,964 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 500 transitions. [2024-10-24 01:50:26,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 01:50:26,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:26,965 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-10-24 01:50:26,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 01:50:26,966 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-10-24 01:50:26,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:26,966 INFO L85 PathProgramCache]: Analyzing trace with hash -508022715, now seen corresponding path program 1 times [2024-10-24 01:50:26,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:26,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26232075] [2024-10-24 01:50:26,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:26,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:27,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:27,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:27,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26232075] [2024-10-24 01:50:27,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26232075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:27,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:27,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:27,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860612311] [2024-10-24 01:50:27,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:27,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:27,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:27,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:27,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:27,254 INFO L87 Difference]: Start difference. First operand 396 states and 500 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-10-24 01:50:27,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:27,801 INFO L93 Difference]: Finished difference Result 703 states and 911 transitions. [2024-10-24 01:50:27,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:50:27,801 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-10-24 01:50:27,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:27,803 INFO L225 Difference]: With dead ends: 703 [2024-10-24 01:50:27,803 INFO L226 Difference]: Without dead ends: 604 [2024-10-24 01:50:27,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:50:27,804 INFO L432 NwaCegarLoop]: 541 mSDtfsCounter, 1469 mSDsluCounter, 1432 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1469 SdHoareTripleChecker+Valid, 1973 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:27,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1469 Valid, 1973 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1246 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:50:27,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-24 01:50:27,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 392. [2024-10-24 01:50:27,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 376 states have (on average 1.3164893617021276) internal successors, (495), 391 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-10-24 01:50:27,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 495 transitions. [2024-10-24 01:50:27,811 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 495 transitions. Word has length 79 [2024-10-24 01:50:27,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:27,812 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 495 transitions. [2024-10-24 01:50:27,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-10-24 01:50:27,812 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 495 transitions. [2024-10-24 01:50:27,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 01:50:27,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:27,813 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-10-24 01:50:27,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 01:50:27,813 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-10-24 01:50:27,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:27,814 INFO L85 PathProgramCache]: Analyzing trace with hash 380495892, now seen corresponding path program 1 times [2024-10-24 01:50:27,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:27,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805358696] [2024-10-24 01:50:27,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:27,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:28,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:28,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:28,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805358696] [2024-10-24 01:50:28,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805358696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:28,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:28,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:28,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61347434] [2024-10-24 01:50:28,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:28,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:28,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:28,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:28,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:28,090 INFO L87 Difference]: Start difference. First operand 392 states and 495 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 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-10-24 01:50:28,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:28,727 INFO L93 Difference]: Finished difference Result 650 states and 830 transitions. [2024-10-24 01:50:28,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:50:28,727 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 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-10-24 01:50:28,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:28,728 INFO L225 Difference]: With dead ends: 650 [2024-10-24 01:50:28,728 INFO L226 Difference]: Without dead ends: 580 [2024-10-24 01:50:28,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:50:28,729 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 1557 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1557 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:28,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1557 Valid, 1598 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:50:28,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-10-24 01:50:28,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 392. [2024-10-24 01:50:28,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 376 states have (on average 1.3138297872340425) internal successors, (494), 391 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:28,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 494 transitions. [2024-10-24 01:50:28,736 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 494 transitions. Word has length 80 [2024-10-24 01:50:28,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:28,736 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 494 transitions. [2024-10-24 01:50:28,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 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-10-24 01:50:28,737 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 494 transitions. [2024-10-24 01:50:28,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 01:50:28,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:28,738 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-10-24 01:50:28,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 01:50:28,738 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-10-24 01:50:28,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:28,739 INFO L85 PathProgramCache]: Analyzing trace with hash -2002274302, now seen corresponding path program 1 times [2024-10-24 01:50:28,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:28,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542127094] [2024-10-24 01:50:28,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:28,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:28,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:28,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:28,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542127094] [2024-10-24 01:50:28,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542127094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:28,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:28,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:28,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889032491] [2024-10-24 01:50:28,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:28,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:28,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:28,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:28,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:28,984 INFO L87 Difference]: Start difference. First operand 392 states and 494 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 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-10-24 01:50:29,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:29,620 INFO L93 Difference]: Finished difference Result 678 states and 868 transitions. [2024-10-24 01:50:29,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:50:29,620 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 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-10-24 01:50:29,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:29,622 INFO L225 Difference]: With dead ends: 678 [2024-10-24 01:50:29,622 INFO L226 Difference]: Without dead ends: 596 [2024-10-24 01:50:29,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:50:29,623 INFO L432 NwaCegarLoop]: 384 mSDtfsCounter, 1032 mSDsluCounter, 1450 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 1834 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:29,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1032 Valid, 1834 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:50:29,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2024-10-24 01:50:29,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 392. [2024-10-24 01:50:29,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 376 states have (on average 1.3111702127659575) internal successors, (493), 391 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:29,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 493 transitions. [2024-10-24 01:50:29,630 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 493 transitions. Word has length 80 [2024-10-24 01:50:29,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:29,630 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 493 transitions. [2024-10-24 01:50:29,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 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-10-24 01:50:29,631 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 493 transitions. [2024-10-24 01:50:29,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 01:50:29,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:29,632 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-10-24 01:50:29,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 01:50:29,632 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-10-24 01:50:29,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:29,633 INFO L85 PathProgramCache]: Analyzing trace with hash 891103228, now seen corresponding path program 1 times [2024-10-24 01:50:29,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:29,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335983822] [2024-10-24 01:50:29,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:29,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:29,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:29,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:29,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335983822] [2024-10-24 01:50:29,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335983822] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:29,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:29,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:29,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075831303] [2024-10-24 01:50:29,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:29,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:29,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:29,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:29,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:29,859 INFO L87 Difference]: Start difference. First operand 392 states and 493 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 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-10-24 01:50:30,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:30,563 INFO L93 Difference]: Finished difference Result 647 states and 825 transitions. [2024-10-24 01:50:30,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:50:30,563 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 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-10-24 01:50:30,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:30,565 INFO L225 Difference]: With dead ends: 647 [2024-10-24 01:50:30,565 INFO L226 Difference]: Without dead ends: 580 [2024-10-24 01:50:30,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-24 01:50:30,566 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 1713 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1713 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:30,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1713 Valid, 1491 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 01:50:30,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-10-24 01:50:30,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 392. [2024-10-24 01:50:30,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 376 states have (on average 1.3085106382978724) internal successors, (492), 391 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-10-24 01:50:30,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 492 transitions. [2024-10-24 01:50:30,575 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 492 transitions. Word has length 80 [2024-10-24 01:50:30,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:30,575 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 492 transitions. [2024-10-24 01:50:30,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 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-10-24 01:50:30,575 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 492 transitions. [2024-10-24 01:50:30,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 01:50:30,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:30,576 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-10-24 01:50:30,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 01:50:30,576 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-10-24 01:50:30,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:30,577 INFO L85 PathProgramCache]: Analyzing trace with hash -374640683, now seen corresponding path program 1 times [2024-10-24 01:50:30,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:30,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192744833] [2024-10-24 01:50:30,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:30,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:30,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:30,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:30,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192744833] [2024-10-24 01:50:30,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192744833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:30,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:30,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:30,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680788298] [2024-10-24 01:50:30,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:30,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:30,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:30,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:30,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:30,789 INFO L87 Difference]: Start difference. First operand 392 states and 492 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 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-10-24 01:50:31,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:31,472 INFO L93 Difference]: Finished difference Result 650 states and 827 transitions. [2024-10-24 01:50:31,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 01:50:31,473 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 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-10-24 01:50:31,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:31,475 INFO L225 Difference]: With dead ends: 650 [2024-10-24 01:50:31,475 INFO L226 Difference]: Without dead ends: 580 [2024-10-24 01:50:31,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-24 01:50:31,476 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 1866 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1866 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:31,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1866 Valid, 1326 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 01:50:31,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-10-24 01:50:31,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 392. [2024-10-24 01:50:31,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 376 states have (on average 1.3058510638297873) internal successors, (491), 391 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:31,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 491 transitions. [2024-10-24 01:50:31,484 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 491 transitions. Word has length 80 [2024-10-24 01:50:31,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:31,484 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 491 transitions. [2024-10-24 01:50:31,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 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-10-24 01:50:31,485 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 491 transitions. [2024-10-24 01:50:31,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 01:50:31,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:31,486 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:31,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 01:50:31,486 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-10-24 01:50:31,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:31,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1845105563, now seen corresponding path program 1 times [2024-10-24 01:50:31,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:31,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050547642] [2024-10-24 01:50:31,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:31,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:31,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-10-24 01:50:31,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:31,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050547642] [2024-10-24 01:50:31,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050547642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:31,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:31,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:31,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760081300] [2024-10-24 01:50:31,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:31,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:31,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:31,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:31,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:31,767 INFO L87 Difference]: Start difference. First operand 392 states and 491 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 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-10-24 01:50:32,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:32,436 INFO L93 Difference]: Finished difference Result 647 states and 822 transitions. [2024-10-24 01:50:32,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:50:32,437 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 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-10-24 01:50:32,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:32,438 INFO L225 Difference]: With dead ends: 647 [2024-10-24 01:50:32,439 INFO L226 Difference]: Without dead ends: 580 [2024-10-24 01:50:32,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:50:32,439 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 1543 mSDsluCounter, 1455 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1543 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:32,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1543 Valid, 1874 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 01:50:32,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-10-24 01:50:32,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 392. [2024-10-24 01:50:32,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 376 states have (on average 1.303191489361702) internal successors, (490), 391 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:32,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 490 transitions. [2024-10-24 01:50:32,446 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 490 transitions. Word has length 80 [2024-10-24 01:50:32,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:32,446 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 490 transitions. [2024-10-24 01:50:32,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 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-10-24 01:50:32,447 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 490 transitions. [2024-10-24 01:50:32,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 01:50:32,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:32,448 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-10-24 01:50:32,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 01:50:32,448 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-10-24 01:50:32,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:32,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1184234996, now seen corresponding path program 1 times [2024-10-24 01:50:32,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:32,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668015508] [2024-10-24 01:50:32,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:32,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:32,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:32,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:32,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668015508] [2024-10-24 01:50:32,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668015508] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:32,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:32,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:32,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902304138] [2024-10-24 01:50:32,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:32,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:32,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:32,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:32,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:32,692 INFO L87 Difference]: Start difference. First operand 392 states and 490 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 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-10-24 01:50:33,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:33,375 INFO L93 Difference]: Finished difference Result 585 states and 728 transitions. [2024-10-24 01:50:33,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:50:33,376 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 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-10-24 01:50:33,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:33,377 INFO L225 Difference]: With dead ends: 585 [2024-10-24 01:50:33,378 INFO L226 Difference]: Without dead ends: 580 [2024-10-24 01:50:33,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:50:33,378 INFO L432 NwaCegarLoop]: 414 mSDtfsCounter, 1508 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:33,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 1569 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 01:50:33,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-10-24 01:50:33,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 392. [2024-10-24 01:50:33,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 376 states have (on average 1.300531914893617) internal successors, (489), 391 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:33,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 489 transitions. [2024-10-24 01:50:33,386 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 489 transitions. Word has length 80 [2024-10-24 01:50:33,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:33,387 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 489 transitions. [2024-10-24 01:50:33,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 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-10-24 01:50:33,387 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 489 transitions. [2024-10-24 01:50:33,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 01:50:33,388 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:33,388 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-10-24 01:50:33,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 01:50:33,388 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-10-24 01:50:33,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:33,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1196411487, now seen corresponding path program 1 times [2024-10-24 01:50:33,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:33,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809794833] [2024-10-24 01:50:33,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:33,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:33,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:33,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:33,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809794833] [2024-10-24 01:50:33,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809794833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:33,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:33,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:33,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671558753] [2024-10-24 01:50:33,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:33,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:33,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:33,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:33,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:33,617 INFO L87 Difference]: Start difference. First operand 392 states and 489 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 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-10-24 01:50:34,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:34,290 INFO L93 Difference]: Finished difference Result 647 states and 819 transitions. [2024-10-24 01:50:34,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 01:50:34,291 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 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-10-24 01:50:34,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:34,293 INFO L225 Difference]: With dead ends: 647 [2024-10-24 01:50:34,293 INFO L226 Difference]: Without dead ends: 580 [2024-10-24 01:50:34,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-24 01:50:34,294 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 1858 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1858 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:34,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1858 Valid, 1326 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:50:34,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-10-24 01:50:34,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 392. [2024-10-24 01:50:34,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 376 states have (on average 1.297872340425532) internal successors, (488), 391 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:34,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 488 transitions. [2024-10-24 01:50:34,303 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 488 transitions. Word has length 80 [2024-10-24 01:50:34,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:34,303 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 488 transitions. [2024-10-24 01:50:34,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 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-10-24 01:50:34,303 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 488 transitions. [2024-10-24 01:50:34,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 01:50:34,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:34,304 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-10-24 01:50:34,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-24 01:50:34,305 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-10-24 01:50:34,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:34,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1992159898, now seen corresponding path program 1 times [2024-10-24 01:50:34,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:34,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018209692] [2024-10-24 01:50:34,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:34,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:34,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:34,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:34,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:34,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018209692] [2024-10-24 01:50:34,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018209692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:34,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:34,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:34,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501912005] [2024-10-24 01:50:34,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:34,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:34,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:34,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:34,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:34,565 INFO L87 Difference]: Start difference. First operand 392 states and 488 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 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-10-24 01:50:35,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:35,128 INFO L93 Difference]: Finished difference Result 645 states and 815 transitions. [2024-10-24 01:50:35,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:50:35,128 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 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-10-24 01:50:35,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:35,130 INFO L225 Difference]: With dead ends: 645 [2024-10-24 01:50:35,130 INFO L226 Difference]: Without dead ends: 580 [2024-10-24 01:50:35,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-24 01:50:35,130 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 1856 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1856 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:35,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1856 Valid, 1337 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 01:50:35,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-10-24 01:50:35,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 392. [2024-10-24 01:50:35,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 376 states have (on average 1.2952127659574468) internal successors, (487), 391 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-10-24 01:50:35,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 487 transitions. [2024-10-24 01:50:35,142 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 487 transitions. Word has length 80 [2024-10-24 01:50:35,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:35,142 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 487 transitions. [2024-10-24 01:50:35,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 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-10-24 01:50:35,143 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 487 transitions. [2024-10-24 01:50:35,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 01:50:35,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:35,151 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-10-24 01:50:35,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-24 01:50:35,152 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-10-24 01:50:35,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:35,152 INFO L85 PathProgramCache]: Analyzing trace with hash -144938974, now seen corresponding path program 1 times [2024-10-24 01:50:35,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:35,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069345745] [2024-10-24 01:50:35,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:35,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:35,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:35,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:35,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069345745] [2024-10-24 01:50:35,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069345745] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:35,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:35,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:35,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960443076] [2024-10-24 01:50:35,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:35,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:35,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:35,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:35,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:35,427 INFO L87 Difference]: Start difference. First operand 392 states and 487 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 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-10-24 01:50:36,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:36,019 INFO L93 Difference]: Finished difference Result 678 states and 858 transitions. [2024-10-24 01:50:36,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:50:36,020 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 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-10-24 01:50:36,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:36,021 INFO L225 Difference]: With dead ends: 678 [2024-10-24 01:50:36,021 INFO L226 Difference]: Without dead ends: 596 [2024-10-24 01:50:36,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-24 01:50:36,022 INFO L432 NwaCegarLoop]: 362 mSDtfsCounter, 1759 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1759 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:36,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1759 Valid, 1544 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:50:36,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2024-10-24 01:50:36,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 392. [2024-10-24 01:50:36,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 376 states have (on average 1.2925531914893618) internal successors, (486), 391 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:36,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 486 transitions. [2024-10-24 01:50:36,028 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 486 transitions. Word has length 80 [2024-10-24 01:50:36,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:36,029 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 486 transitions. [2024-10-24 01:50:36,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 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-10-24 01:50:36,029 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 486 transitions. [2024-10-24 01:50:36,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 01:50:36,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:36,030 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-10-24 01:50:36,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-24 01:50:36,031 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-10-24 01:50:36,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:36,031 INFO L85 PathProgramCache]: Analyzing trace with hash -2057136076, now seen corresponding path program 1 times [2024-10-24 01:50:36,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:36,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870316422] [2024-10-24 01:50:36,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:36,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:36,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:36,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-10-24 01:50:36,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:36,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870316422] [2024-10-24 01:50:36,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870316422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:36,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:36,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:36,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308354586] [2024-10-24 01:50:36,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:36,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:36,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:36,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:36,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:36,339 INFO L87 Difference]: Start difference. First operand 392 states and 486 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 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-10-24 01:50:36,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:36,903 INFO L93 Difference]: Finished difference Result 650 states and 818 transitions. [2024-10-24 01:50:36,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:50:36,903 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 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-10-24 01:50:36,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:36,905 INFO L225 Difference]: With dead ends: 650 [2024-10-24 01:50:36,905 INFO L226 Difference]: Without dead ends: 580 [2024-10-24 01:50:36,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:50:36,906 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 1526 mSDsluCounter, 1355 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:36,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 1707 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:50:36,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-10-24 01:50:36,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 392. [2024-10-24 01:50:36,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 376 states have (on average 1.2898936170212767) internal successors, (485), 391 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:36,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 485 transitions. [2024-10-24 01:50:36,913 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 485 transitions. Word has length 80 [2024-10-24 01:50:36,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:36,913 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 485 transitions. [2024-10-24 01:50:36,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 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-10-24 01:50:36,914 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 485 transitions. [2024-10-24 01:50:36,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 01:50:36,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:36,915 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-10-24 01:50:36,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-24 01:50:36,915 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-10-24 01:50:36,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:36,916 INFO L85 PathProgramCache]: Analyzing trace with hash -2041843904, now seen corresponding path program 1 times [2024-10-24 01:50:36,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:36,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279692253] [2024-10-24 01:50:36,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:36,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:37,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:37,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:37,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279692253] [2024-10-24 01:50:37,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279692253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:37,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:37,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 01:50:37,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607324521] [2024-10-24 01:50:37,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:37,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 01:50:37,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:37,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 01:50:37,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:50:37,416 INFO L87 Difference]: Start difference. First operand 392 states and 485 transitions. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 10 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-10-24 01:50:38,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:38,313 INFO L93 Difference]: Finished difference Result 957 states and 1259 transitions. [2024-10-24 01:50:38,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 01:50:38,314 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 10 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-10-24 01:50:38,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:38,316 INFO L225 Difference]: With dead ends: 957 [2024-10-24 01:50:38,316 INFO L226 Difference]: Without dead ends: 852 [2024-10-24 01:50:38,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-10-24 01:50:38,317 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 3953 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3953 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 1388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:38,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3953 Valid, 1752 Invalid, 1388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1259 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 01:50:38,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2024-10-24 01:50:38,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 396. [2024-10-24 01:50:38,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 380 states have (on average 1.2868421052631578) internal successors, (489), 395 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:38,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 489 transitions. [2024-10-24 01:50:38,325 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 489 transitions. Word has length 80 [2024-10-24 01:50:38,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:38,325 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 489 transitions. [2024-10-24 01:50:38,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 10 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-10-24 01:50:38,325 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 489 transitions. [2024-10-24 01:50:38,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 01:50:38,326 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:38,326 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-10-24 01:50:38,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-24 01:50:38,327 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:38,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:38,327 INFO L85 PathProgramCache]: Analyzing trace with hash -898261756, now seen corresponding path program 1 times [2024-10-24 01:50:38,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:38,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061747776] [2024-10-24 01:50:38,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:38,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:38,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:38,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:38,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061747776] [2024-10-24 01:50:38,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061747776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:38,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:38,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 01:50:38,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156776757] [2024-10-24 01:50:38,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:38,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 01:50:38,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:38,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 01:50:38,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:50:38,764 INFO L87 Difference]: Start difference. First operand 396 states and 489 transitions. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 10 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-10-24 01:50:39,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:39,739 INFO L93 Difference]: Finished difference Result 825 states and 1064 transitions. [2024-10-24 01:50:39,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 01:50:39,740 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 10 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-10-24 01:50:39,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:39,742 INFO L225 Difference]: With dead ends: 825 [2024-10-24 01:50:39,742 INFO L226 Difference]: Without dead ends: 808 [2024-10-24 01:50:39,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-10-24 01:50:39,743 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 3983 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3983 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:39,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3983 Valid, 1607 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 01:50:39,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2024-10-24 01:50:39,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 400. [2024-10-24 01:50:39,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 384 states have (on average 1.2838541666666667) internal successors, (493), 399 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:39,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 493 transitions. [2024-10-24 01:50:39,750 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 493 transitions. Word has length 80 [2024-10-24 01:50:39,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:39,751 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 493 transitions. [2024-10-24 01:50:39,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 10 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-10-24 01:50:39,751 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 493 transitions. [2024-10-24 01:50:39,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 01:50:39,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:39,752 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-10-24 01:50:39,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-24 01:50:39,752 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:39,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:39,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1995378919, now seen corresponding path program 1 times [2024-10-24 01:50:39,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:39,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642814054] [2024-10-24 01:50:39,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:39,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:40,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:40,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:40,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642814054] [2024-10-24 01:50:40,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642814054] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:40,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:40,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:40,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962154425] [2024-10-24 01:50:40,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:40,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:40,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:40,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:40,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:40,030 INFO L87 Difference]: Start difference. First operand 400 states and 493 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 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-10-24 01:50:40,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:40,675 INFO L93 Difference]: Finished difference Result 655 states and 822 transitions. [2024-10-24 01:50:40,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:50:40,675 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 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-10-24 01:50:40,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:40,677 INFO L225 Difference]: With dead ends: 655 [2024-10-24 01:50:40,677 INFO L226 Difference]: Without dead ends: 588 [2024-10-24 01:50:40,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:50:40,678 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 1524 mSDsluCounter, 1355 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 1155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:40,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 1707 Invalid, 1155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:50:40,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-10-24 01:50:40,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 400. [2024-10-24 01:50:40,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 384 states have (on average 1.28125) internal successors, (492), 399 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-10-24 01:50:40,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 492 transitions. [2024-10-24 01:50:40,684 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 492 transitions. Word has length 80 [2024-10-24 01:50:40,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:40,684 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 492 transitions. [2024-10-24 01:50:40,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 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-10-24 01:50:40,684 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 492 transitions. [2024-10-24 01:50:40,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 01:50:40,685 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:40,685 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-10-24 01:50:40,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-24 01:50:40,685 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:40,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:40,686 INFO L85 PathProgramCache]: Analyzing trace with hash 729371863, now seen corresponding path program 1 times [2024-10-24 01:50:40,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:40,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134916501] [2024-10-24 01:50:40,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:40,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:41,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-10-24 01:50:41,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:41,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134916501] [2024-10-24 01:50:41,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134916501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:41,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:41,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 01:50:41,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168621585] [2024-10-24 01:50:41,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:41,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 01:50:41,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:41,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 01:50:41,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:50:41,072 INFO L87 Difference]: Start difference. First operand 400 states and 492 transitions. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 10 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-10-24 01:50:41,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:41,900 INFO L93 Difference]: Finished difference Result 761 states and 968 transitions. [2024-10-24 01:50:41,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 01:50:41,900 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 10 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-10-24 01:50:41,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:41,903 INFO L225 Difference]: With dead ends: 761 [2024-10-24 01:50:41,903 INFO L226 Difference]: Without dead ends: 756 [2024-10-24 01:50:41,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-10-24 01:50:41,904 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 3995 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3995 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:41,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3995 Valid, 1429 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 01:50:41,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2024-10-24 01:50:41,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 404. [2024-10-24 01:50:41,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 388 states have (on average 1.2783505154639174) internal successors, (496), 403 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-10-24 01:50:41,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 496 transitions. [2024-10-24 01:50:41,911 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 496 transitions. Word has length 80 [2024-10-24 01:50:41,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:41,911 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 496 transitions. [2024-10-24 01:50:41,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 10 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-10-24 01:50:41,911 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 496 transitions. [2024-10-24 01:50:41,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 01:50:41,912 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:41,912 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-10-24 01:50:41,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-24 01:50:41,913 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:41,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:41,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1069510264, now seen corresponding path program 1 times [2024-10-24 01:50:41,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:41,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399380550] [2024-10-24 01:50:41,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:41,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:42,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:42,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:42,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399380550] [2024-10-24 01:50:42,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399380550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:42,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:42,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:42,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800612798] [2024-10-24 01:50:42,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:42,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:42,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:42,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:42,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:42,128 INFO L87 Difference]: Start difference. First operand 404 states and 496 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 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-10-24 01:50:42,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:42,689 INFO L93 Difference]: Finished difference Result 717 states and 905 transitions. [2024-10-24 01:50:42,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:50:42,690 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 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-10-24 01:50:42,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:42,691 INFO L225 Difference]: With dead ends: 717 [2024-10-24 01:50:42,691 INFO L226 Difference]: Without dead ends: 612 [2024-10-24 01:50:42,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:50:42,692 INFO L432 NwaCegarLoop]: 534 mSDtfsCounter, 991 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 2130 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:42,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 2130 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:50:42,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-10-24 01:50:42,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 400. [2024-10-24 01:50:42,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 384 states have (on average 1.2786458333333333) internal successors, (491), 399 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:42,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 491 transitions. [2024-10-24 01:50:42,699 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 491 transitions. Word has length 81 [2024-10-24 01:50:42,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:42,699 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 491 transitions. [2024-10-24 01:50:42,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 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-10-24 01:50:42,699 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 491 transitions. [2024-10-24 01:50:42,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 01:50:42,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:42,701 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-10-24 01:50:42,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-24 01:50:42,702 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:42,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:42,702 INFO L85 PathProgramCache]: Analyzing trace with hash 869523368, now seen corresponding path program 1 times [2024-10-24 01:50:42,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:42,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508980912] [2024-10-24 01:50:42,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:42,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:42,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:42,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:42,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:42,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508980912] [2024-10-24 01:50:42,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508980912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:42,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:42,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:42,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55010461] [2024-10-24 01:50:42,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:42,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:42,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:42,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:42,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:42,913 INFO L87 Difference]: Start difference. First operand 400 states and 491 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 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-10-24 01:50:43,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:43,487 INFO L93 Difference]: Finished difference Result 589 states and 722 transitions. [2024-10-24 01:50:43,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 01:50:43,488 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 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-10-24 01:50:43,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:43,489 INFO L225 Difference]: With dead ends: 589 [2024-10-24 01:50:43,489 INFO L226 Difference]: Without dead ends: 584 [2024-10-24 01:50:43,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-24 01:50:43,490 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 1119 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1119 SdHoareTripleChecker+Valid, 1532 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:43,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1119 Valid, 1532 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:50:43,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2024-10-24 01:50:43,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 396. [2024-10-24 01:50:43,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 380 states have (on average 1.2789473684210526) internal successors, (486), 395 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:43,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 486 transitions. [2024-10-24 01:50:43,495 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 486 transitions. Word has length 81 [2024-10-24 01:50:43,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:43,495 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 486 transitions. [2024-10-24 01:50:43,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 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-10-24 01:50:43,495 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 486 transitions. [2024-10-24 01:50:43,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 01:50:43,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:43,496 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-10-24 01:50:43,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-24 01:50:43,496 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:43,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:43,497 INFO L85 PathProgramCache]: Analyzing trace with hash -29974665, now seen corresponding path program 1 times [2024-10-24 01:50:43,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:43,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477791507] [2024-10-24 01:50:43,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:43,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:43,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:43,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:43,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477791507] [2024-10-24 01:50:43,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477791507] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:43,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:43,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:43,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906214609] [2024-10-24 01:50:43,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:43,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:43,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:43,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:43,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:43,704 INFO L87 Difference]: Start difference. First operand 396 states and 486 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 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-10-24 01:50:44,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:44,360 INFO L93 Difference]: Finished difference Result 613 states and 756 transitions. [2024-10-24 01:50:44,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 01:50:44,360 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 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-10-24 01:50:44,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:44,362 INFO L225 Difference]: With dead ends: 613 [2024-10-24 01:50:44,362 INFO L226 Difference]: Without dead ends: 596 [2024-10-24 01:50:44,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-24 01:50:44,362 INFO L432 NwaCegarLoop]: 433 mSDtfsCounter, 1010 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:44,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 1823 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1251 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 01:50:44,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2024-10-24 01:50:44,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 392. [2024-10-24 01:50:44,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 376 states have (on average 1.2792553191489362) internal successors, (481), 391 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:44,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 481 transitions. [2024-10-24 01:50:44,368 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 481 transitions. Word has length 81 [2024-10-24 01:50:44,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:44,369 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 481 transitions. [2024-10-24 01:50:44,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 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-10-24 01:50:44,369 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 481 transitions. [2024-10-24 01:50:44,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-24 01:50:44,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:44,370 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-10-24 01:50:44,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-24 01:50:44,371 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:44,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:44,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1274155887, now seen corresponding path program 1 times [2024-10-24 01:50:44,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:44,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776844340] [2024-10-24 01:50:44,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:44,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:44,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:44,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:44,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776844340] [2024-10-24 01:50:44,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776844340] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:44,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:44,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 01:50:44,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91285923] [2024-10-24 01:50:44,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:44,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 01:50:44,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:44,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 01:50:44,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:50:44,842 INFO L87 Difference]: Start difference. First operand 392 states and 481 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 10 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-10-24 01:50:45,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:45,321 INFO L93 Difference]: Finished difference Result 905 states and 1132 transitions. [2024-10-24 01:50:45,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 01:50:45,322 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 10 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-10-24 01:50:45,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:45,324 INFO L225 Difference]: With dead ends: 905 [2024-10-24 01:50:45,324 INFO L226 Difference]: Without dead ends: 722 [2024-10-24 01:50:45,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-10-24 01:50:45,325 INFO L432 NwaCegarLoop]: 545 mSDtfsCounter, 1582 mSDsluCounter, 1851 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1582 SdHoareTripleChecker+Valid, 2396 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:45,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1582 Valid, 2396 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:50:45,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2024-10-24 01:50:45,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 274. [2024-10-24 01:50:45,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 263 states have (on average 1.2661596958174905) internal successors, (333), 273 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:45,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 333 transitions. [2024-10-24 01:50:45,329 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 333 transitions. Word has length 82 [2024-10-24 01:50:45,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:45,330 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 333 transitions. [2024-10-24 01:50:45,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 10 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-10-24 01:50:45,330 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 333 transitions. [2024-10-24 01:50:45,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-24 01:50:45,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:45,330 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-10-24 01:50:45,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-24 01:50:45,331 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:45,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:45,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1213653297, now seen corresponding path program 1 times [2024-10-24 01:50:45,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:45,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875411228] [2024-10-24 01:50:45,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:45,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:45,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:45,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:45,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875411228] [2024-10-24 01:50:45,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875411228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:45,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:45,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 01:50:45,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263124501] [2024-10-24 01:50:45,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:45,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 01:50:45,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:45,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 01:50:45,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 01:50:45,811 INFO L87 Difference]: Start difference. First operand 274 states and 333 transitions. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 11 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-10-24 01:50:46,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:46,290 INFO L93 Difference]: Finished difference Result 451 states and 579 transitions. [2024-10-24 01:50:46,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 01:50:46,291 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 11 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-10-24 01:50:46,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:46,292 INFO L225 Difference]: With dead ends: 451 [2024-10-24 01:50:46,292 INFO L226 Difference]: Without dead ends: 353 [2024-10-24 01:50:46,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-10-24 01:50:46,293 INFO L432 NwaCegarLoop]: 375 mSDtfsCounter, 1397 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1397 SdHoareTripleChecker+Valid, 2059 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:46,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1397 Valid, 2059 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:50:46,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-10-24 01:50:46,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 241. [2024-10-24 01:50:46,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 233 states have (on average 1.257510729613734) internal successors, (293), 240 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:46,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 293 transitions. [2024-10-24 01:50:46,296 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 293 transitions. Word has length 82 [2024-10-24 01:50:46,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:46,296 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 293 transitions. [2024-10-24 01:50:46,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 11 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-10-24 01:50:46,296 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 293 transitions. [2024-10-24 01:50:46,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-24 01:50:46,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:46,297 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-10-24 01:50:46,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-24 01:50:46,297 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:46,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:46,297 INFO L85 PathProgramCache]: Analyzing trace with hash -910264626, now seen corresponding path program 1 times [2024-10-24 01:50:46,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:46,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907266661] [2024-10-24 01:50:46,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:46,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:46,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:46,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:46,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907266661] [2024-10-24 01:50:46,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907266661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:46,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:46,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 01:50:46,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384162231] [2024-10-24 01:50:46,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:46,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 01:50:46,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:46,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 01:50:46,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 01:50:46,800 INFO L87 Difference]: Start difference. First operand 241 states and 293 transitions. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 11 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-10-24 01:50:47,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:47,364 INFO L93 Difference]: Finished difference Result 421 states and 537 transitions. [2024-10-24 01:50:47,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:50:47,364 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 11 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-10-24 01:50:47,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:47,365 INFO L225 Difference]: With dead ends: 421 [2024-10-24 01:50:47,365 INFO L226 Difference]: Without dead ends: 352 [2024-10-24 01:50:47,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-10-24 01:50:47,366 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 1558 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1558 SdHoareTripleChecker+Valid, 1368 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:47,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1558 Valid, 1368 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:50:47,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-10-24 01:50:47,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 237. [2024-10-24 01:50:47,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 230 states have (on average 1.2521739130434784) internal successors, (288), 236 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:47,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 288 transitions. [2024-10-24 01:50:47,370 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 288 transitions. Word has length 82 [2024-10-24 01:50:47,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:47,370 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 288 transitions. [2024-10-24 01:50:47,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 11 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-10-24 01:50:47,370 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 288 transitions. [2024-10-24 01:50:47,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-24 01:50:47,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:47,371 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-10-24 01:50:47,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-24 01:50:47,371 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:47,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:47,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1175029773, now seen corresponding path program 1 times [2024-10-24 01:50:47,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:47,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597709421] [2024-10-24 01:50:47,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:47,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:47,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:47,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:47,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597709421] [2024-10-24 01:50:47,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597709421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:47,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:47,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 01:50:47,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6194372] [2024-10-24 01:50:47,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:47,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 01:50:47,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:47,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 01:50:47,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-24 01:50:47,891 INFO L87 Difference]: Start difference. First operand 237 states and 288 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 12 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-10-24 01:50:48,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:48,563 INFO L93 Difference]: Finished difference Result 632 states and 826 transitions. [2024-10-24 01:50:48,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 01:50:48,563 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 12 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-10-24 01:50:48,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:48,564 INFO L225 Difference]: With dead ends: 632 [2024-10-24 01:50:48,564 INFO L226 Difference]: Without dead ends: 504 [2024-10-24 01:50:48,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-10-24 01:50:48,565 INFO L432 NwaCegarLoop]: 593 mSDtfsCounter, 998 mSDsluCounter, 4331 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 4924 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:48,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [998 Valid, 4924 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:50:48,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2024-10-24 01:50:48,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 174. [2024-10-24 01:50:48,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 171 states have (on average 1.2456140350877194) internal successors, (213), 173 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:48,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 213 transitions. [2024-10-24 01:50:48,569 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 213 transitions. Word has length 82 [2024-10-24 01:50:48,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:48,569 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 213 transitions. [2024-10-24 01:50:48,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 12 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-10-24 01:50:48,569 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 213 transitions. [2024-10-24 01:50:48,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-24 01:50:48,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:48,570 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-10-24 01:50:48,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-24 01:50:48,570 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:48,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:48,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1732888836, now seen corresponding path program 1 times [2024-10-24 01:50:48,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:48,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981153507] [2024-10-24 01:50:48,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:48,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:48,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:48,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:48,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:48,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981153507] [2024-10-24 01:50:48,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981153507] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:48,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:48,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:48,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801141] [2024-10-24 01:50:48,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:48,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:48,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:48,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:48,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:48,806 INFO L87 Difference]: Start difference. First operand 174 states and 213 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 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-10-24 01:50:49,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:49,123 INFO L93 Difference]: Finished difference Result 267 states and 337 transitions. [2024-10-24 01:50:49,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:50:49,124 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 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-10-24 01:50:49,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:49,125 INFO L225 Difference]: With dead ends: 267 [2024-10-24 01:50:49,125 INFO L226 Difference]: Without dead ends: 260 [2024-10-24 01:50:49,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:50:49,125 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 633 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:49,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 667 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:50:49,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-10-24 01:50:49,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 174. [2024-10-24 01:50:49,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 171 states have (on average 1.239766081871345) internal successors, (212), 173 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:49,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 212 transitions. [2024-10-24 01:50:49,129 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 212 transitions. Word has length 83 [2024-10-24 01:50:49,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:49,129 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 212 transitions. [2024-10-24 01:50:49,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 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-10-24 01:50:49,129 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 212 transitions. [2024-10-24 01:50:49,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-24 01:50:49,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:49,130 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-10-24 01:50:49,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-24 01:50:49,130 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-10-24 01:50:49,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:49,131 INFO L85 PathProgramCache]: Analyzing trace with hash 956701402, now seen corresponding path program 1 times [2024-10-24 01:50:49,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:49,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611866932] [2024-10-24 01:50:49,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:49,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:49,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:49,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:49,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611866932] [2024-10-24 01:50:49,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611866932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:49,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:49,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:49,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479257819] [2024-10-24 01:50:49,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:49,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:50:49,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:49,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:50:49,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:50:49,329 INFO L87 Difference]: Start difference. First operand 174 states and 212 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 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-10-24 01:50:49,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:49,623 INFO L93 Difference]: Finished difference Result 361 states and 466 transitions. [2024-10-24 01:50:49,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 01:50:49,624 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 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-10-24 01:50:49,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:49,626 INFO L225 Difference]: With dead ends: 361 [2024-10-24 01:50:49,626 INFO L226 Difference]: Without dead ends: 278 [2024-10-24 01:50:49,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:50:49,626 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 435 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:49,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 993 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:50:49,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-10-24 01:50:49,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 174. [2024-10-24 01:50:49,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 171 states have (on average 1.2339181286549707) internal successors, (211), 173 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:49,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 211 transitions. [2024-10-24 01:50:49,630 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 211 transitions. Word has length 83 [2024-10-24 01:50:49,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:49,630 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 211 transitions. [2024-10-24 01:50:49,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 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-10-24 01:50:49,631 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 211 transitions. [2024-10-24 01:50:49,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-24 01:50:49,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:49,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, 1, 1, 1, 1, 1, 1] [2024-10-24 01:50:49,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-24 01:50:49,632 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:49,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:49,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1737767892, now seen corresponding path program 1 times [2024-10-24 01:50:49,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:49,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248945351] [2024-10-24 01:50:49,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:49,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:50,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:50,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:50,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248945351] [2024-10-24 01:50:50,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248945351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:50,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:50,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2024-10-24 01:50:50,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592298261] [2024-10-24 01:50:50,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:50,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 01:50:50,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:50,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 01:50:50,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2024-10-24 01:50:50,859 INFO L87 Difference]: Start difference. First operand 174 states and 211 transitions. Second operand has 26 states, 26 states have (on average 3.269230769230769) internal successors, (85), 26 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:54,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:54,009 INFO L93 Difference]: Finished difference Result 689 states and 895 transitions. [2024-10-24 01:50:54,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-24 01:50:54,010 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.269230769230769) internal successors, (85), 26 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-10-24 01:50:54,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:54,012 INFO L225 Difference]: With dead ends: 689 [2024-10-24 01:50:54,012 INFO L226 Difference]: Without dead ends: 681 [2024-10-24 01:50:54,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=314, Invalid=1848, Unknown=0, NotChecked=0, Total=2162 [2024-10-24 01:50:54,013 INFO L432 NwaCegarLoop]: 605 mSDtfsCounter, 1226 mSDsluCounter, 9447 mSDsCounter, 0 mSdLazyCounter, 4808 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1226 SdHoareTripleChecker+Valid, 10052 SdHoareTripleChecker+Invalid, 4809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:54,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1226 Valid, 10052 Invalid, 4809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4808 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-24 01:50:54,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2024-10-24 01:50:54,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 193. [2024-10-24 01:50:54,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 190 states have (on average 1.231578947368421) internal successors, (234), 192 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:54,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 234 transitions. [2024-10-24 01:50:54,016 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 234 transitions. Word has length 85 [2024-10-24 01:50:54,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:54,016 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 234 transitions. [2024-10-24 01:50:54,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.269230769230769) internal successors, (85), 26 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:54,016 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 234 transitions. [2024-10-24 01:50:54,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-24 01:50:54,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:54,017 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] [2024-10-24 01:50:54,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-24 01:50:54,017 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-10-24 01:50:54,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:54,017 INFO L85 PathProgramCache]: Analyzing trace with hash 2073632219, now seen corresponding path program 1 times [2024-10-24 01:50:54,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:54,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820618987] [2024-10-24 01:50:54,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:54,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:54,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:54,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:54,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820618987] [2024-10-24 01:50:54,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820618987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:54,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:54,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 01:50:54,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714485677] [2024-10-24 01:50:54,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:54,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 01:50:54,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:54,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 01:50:54,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 01:50:54,506 INFO L87 Difference]: Start difference. First operand 193 states and 234 transitions. Second operand has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:55,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:55,038 INFO L93 Difference]: Finished difference Result 271 states and 345 transitions. [2024-10-24 01:50:55,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 01:50:55,039 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-10-24 01:50:55,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:55,039 INFO L225 Difference]: With dead ends: 271 [2024-10-24 01:50:55,039 INFO L226 Difference]: Without dead ends: 265 [2024-10-24 01:50:55,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-10-24 01:50:55,040 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 893 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 893 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:55,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [893 Valid, 1446 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:50:55,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-24 01:50:55,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 187. [2024-10-24 01:50:55,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 185 states have (on average 1.2324324324324325) internal successors, (228), 186 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:55,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 228 transitions. [2024-10-24 01:50:55,044 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 228 transitions. Word has length 85 [2024-10-24 01:50:55,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:55,044 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 228 transitions. [2024-10-24 01:50:55,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:55,044 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 228 transitions. [2024-10-24 01:50:55,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-24 01:50:55,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:55,045 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-10-24 01:50:55,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-24 01:50:55,046 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-24 01:50:55,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:55,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1205220568, now seen corresponding path program 1 times [2024-10-24 01:50:55,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:55,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922265250] [2024-10-24 01:50:55,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:55,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:55,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:55,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:55,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922265250] [2024-10-24 01:50:55,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922265250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:55,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:55,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 01:50:55,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355652816] [2024-10-24 01:50:55,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:55,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 01:50:55,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:55,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 01:50:55,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-24 01:50:55,612 INFO L87 Difference]: Start difference. First operand 187 states and 228 transitions. Second operand has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 12 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-10-24 01:50:56,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:56,365 INFO L93 Difference]: Finished difference Result 427 states and 566 transitions. [2024-10-24 01:50:56,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 01:50:56,366 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 12 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-10-24 01:50:56,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:56,367 INFO L225 Difference]: With dead ends: 427 [2024-10-24 01:50:56,367 INFO L226 Difference]: Without dead ends: 412 [2024-10-24 01:50:56,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-10-24 01:50:56,368 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 863 mSDsluCounter, 2926 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 3393 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:56,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 3393 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:50:56,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-10-24 01:50:56,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 156. [2024-10-24 01:50:56,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.238709677419355) internal successors, (192), 155 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:56,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 192 transitions. [2024-10-24 01:50:56,371 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 192 transitions. Word has length 86 [2024-10-24 01:50:56,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:56,371 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 192 transitions. [2024-10-24 01:50:56,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 12 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-10-24 01:50:56,372 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 192 transitions. [2024-10-24 01:50:56,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-24 01:50:56,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:56,372 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] [2024-10-24 01:50:56,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-24 01:50:56,373 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-10-24 01:50:56,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:56,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1814457043, now seen corresponding path program 1 times [2024-10-24 01:50:56,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:56,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930507342] [2024-10-24 01:50:56,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:56,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:56,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:56,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:56,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:56,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930507342] [2024-10-24 01:50:56,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930507342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:56,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:56,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:56,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390350043] [2024-10-24 01:50:56,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:56,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:50:56,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:56,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:50:56,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:50:56,506 INFO L87 Difference]: Start difference. First operand 156 states and 192 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:56,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:56,646 INFO L93 Difference]: Finished difference Result 806 states and 1142 transitions. [2024-10-24 01:50:56,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:50:56,647 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2024-10-24 01:50:56,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:56,648 INFO L225 Difference]: With dead ends: 806 [2024-10-24 01:50:56,648 INFO L226 Difference]: Without dead ends: 741 [2024-10-24 01:50:56,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-10-24 01:50:56,649 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 1268 mSDsluCounter, 1954 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1268 SdHoareTripleChecker+Valid, 2155 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:56,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1268 Valid, 2155 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:50:56,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2024-10-24 01:50:56,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 219. [2024-10-24 01:50:56,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.3027522935779816) internal successors, (284), 218 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:56,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 284 transitions. [2024-10-24 01:50:56,656 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 284 transitions. Word has length 113 [2024-10-24 01:50:56,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:56,656 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 284 transitions. [2024-10-24 01:50:56,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:56,657 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 284 transitions. [2024-10-24 01:50:56,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 01:50:56,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:56,658 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] [2024-10-24 01:50:56,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-10-24 01:50:56,658 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-10-24 01:50:56,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:56,658 INFO L85 PathProgramCache]: Analyzing trace with hash -905960125, now seen corresponding path program 1 times [2024-10-24 01:50:56,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:56,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700322838] [2024-10-24 01:50:56,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:56,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:56,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:56,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:56,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700322838] [2024-10-24 01:50:56,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700322838] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:56,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:56,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:56,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290365045] [2024-10-24 01:50:56,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:56,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:50:56,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:56,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:50:56,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:50:56,829 INFO L87 Difference]: Start difference. First operand 219 states and 284 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:56,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:56,946 INFO L93 Difference]: Finished difference Result 924 states and 1312 transitions. [2024-10-24 01:50:56,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:50:56,947 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2024-10-24 01:50:56,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:56,949 INFO L225 Difference]: With dead ends: 924 [2024-10-24 01:50:56,949 INFO L226 Difference]: Without dead ends: 796 [2024-10-24 01:50:56,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:50:56,950 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 1034 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1034 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:56,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1034 Valid, 1199 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:50:56,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2024-10-24 01:50:56,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 345. [2024-10-24 01:50:56,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 344 states have (on average 1.3633720930232558) internal successors, (469), 344 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:56,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 469 transitions. [2024-10-24 01:50:56,956 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 469 transitions. Word has length 115 [2024-10-24 01:50:56,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:56,956 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 469 transitions. [2024-10-24 01:50:56,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:56,957 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 469 transitions. [2024-10-24 01:50:56,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 01:50:56,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:56,957 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] [2024-10-24 01:50:56,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-10-24 01:50:56,958 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-10-24 01:50:56,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:56,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1541513731, now seen corresponding path program 1 times [2024-10-24 01:50:56,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:56,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511760537] [2024-10-24 01:50:56,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:56,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:57,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:57,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:57,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511760537] [2024-10-24 01:50:57,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511760537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:57,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:57,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:57,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044282211] [2024-10-24 01:50:57,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:57,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:50:57,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:57,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:50:57,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:50:57,100 INFO L87 Difference]: Start difference. First operand 345 states and 469 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:57,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:57,227 INFO L93 Difference]: Finished difference Result 1050 states and 1497 transitions. [2024-10-24 01:50:57,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:50:57,227 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2024-10-24 01:50:57,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:57,230 INFO L225 Difference]: With dead ends: 1050 [2024-10-24 01:50:57,230 INFO L226 Difference]: Without dead ends: 922 [2024-10-24 01:50:57,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:50:57,231 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 1033 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:57,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1033 Valid, 1149 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:50:57,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-10-24 01:50:57,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 534. [2024-10-24 01:50:57,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 1.399624765478424) internal successors, (746), 533 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:57,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 746 transitions. [2024-10-24 01:50:57,241 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 746 transitions. Word has length 115 [2024-10-24 01:50:57,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:57,241 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 746 transitions. [2024-10-24 01:50:57,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:57,241 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 746 transitions. [2024-10-24 01:50:57,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 01:50:57,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:57,242 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] [2024-10-24 01:50:57,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-10-24 01:50:57,243 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-10-24 01:50:57,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:57,243 INFO L85 PathProgramCache]: Analyzing trace with hash 416762097, now seen corresponding path program 1 times [2024-10-24 01:50:57,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:57,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935675646] [2024-10-24 01:50:57,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:57,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:57,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:57,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:57,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935675646] [2024-10-24 01:50:57,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935675646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:57,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:57,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:57,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554905705] [2024-10-24 01:50:57,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:57,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:50:57,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:57,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:50:57,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:50:57,386 INFO L87 Difference]: Start difference. First operand 534 states and 746 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:57,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:57,481 INFO L93 Difference]: Finished difference Result 1176 states and 1682 transitions. [2024-10-24 01:50:57,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:50:57,481 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2024-10-24 01:50:57,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:57,484 INFO L225 Difference]: With dead ends: 1176 [2024-10-24 01:50:57,484 INFO L226 Difference]: Without dead ends: 1048 [2024-10-24 01:50:57,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:50:57,485 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 1109 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:57,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1109 Valid, 1154 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:50:57,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2024-10-24 01:50:57,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 660. [2024-10-24 01:50:57,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 659 states have (on average 1.4127465857359636) internal successors, (931), 659 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:57,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 931 transitions. [2024-10-24 01:50:57,498 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 931 transitions. Word has length 115 [2024-10-24 01:50:57,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:57,499 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 931 transitions. [2024-10-24 01:50:57,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:57,499 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 931 transitions. [2024-10-24 01:50:57,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 01:50:57,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:57,500 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:50:57,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-10-24 01:50:57,501 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-10-24 01:50:57,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:57,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1355182732, now seen corresponding path program 1 times [2024-10-24 01:50:57,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:57,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572495583] [2024-10-24 01:50:57,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:57,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:57,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:57,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:57,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:57,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572495583] [2024-10-24 01:50:57,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572495583] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:57,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:57,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:57,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511385300] [2024-10-24 01:50:57,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:57,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:50:57,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:57,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:50:57,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:50:57,732 INFO L87 Difference]: Start difference. First operand 660 states and 931 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:57,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:57,867 INFO L93 Difference]: Finished difference Result 1231 states and 1766 transitions. [2024-10-24 01:50:57,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:50:57,868 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2024-10-24 01:50:57,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:57,869 INFO L225 Difference]: With dead ends: 1231 [2024-10-24 01:50:57,869 INFO L226 Difference]: Without dead ends: 662 [2024-10-24 01:50:57,870 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-10-24 01:50:57,870 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 98 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:57,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 640 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:50:57,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2024-10-24 01:50:57,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 660. [2024-10-24 01:50:57,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 659 states have (on average 1.4051593323216995) internal successors, (926), 659 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:57,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 926 transitions. [2024-10-24 01:50:57,879 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 926 transitions. Word has length 115 [2024-10-24 01:50:57,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:57,879 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 926 transitions. [2024-10-24 01:50:57,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:57,880 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 926 transitions. [2024-10-24 01:50:57,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 01:50:57,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:57,881 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] [2024-10-24 01:50:57,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-10-24 01:50:57,881 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-10-24 01:50:57,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:57,881 INFO L85 PathProgramCache]: Analyzing trace with hash -2124475725, now seen corresponding path program 1 times [2024-10-24 01:50:57,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:57,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169453525] [2024-10-24 01:50:57,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:57,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:57,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:57,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:57,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169453525] [2024-10-24 01:50:57,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169453525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:57,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:57,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:50:57,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310405451] [2024-10-24 01:50:57,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:57,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:50:57,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:57,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:50:57,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:50:57,934 INFO L87 Difference]: Start difference. First operand 660 states and 926 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:57,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:57,953 INFO L93 Difference]: Finished difference Result 1740 states and 2487 transitions. [2024-10-24 01:50:57,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:50:57,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2024-10-24 01:50:57,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:57,955 INFO L225 Difference]: With dead ends: 1740 [2024-10-24 01:50:57,955 INFO L226 Difference]: Without dead ends: 1171 [2024-10-24 01:50:57,956 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-10-24 01:50:57,956 INFO L432 NwaCegarLoop]: 269 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, 447 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-10-24 01:50:57,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 447 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:50:57,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2024-10-24 01:50:57,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1169. [2024-10-24 01:50:57,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 1168 states have (on average 1.4032534246575343) internal successors, (1639), 1168 states have internal predecessors, (1639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:57,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1639 transitions. [2024-10-24 01:50:57,970 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1639 transitions. Word has length 115 [2024-10-24 01:50:57,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:57,970 INFO L471 AbstractCegarLoop]: Abstraction has 1169 states and 1639 transitions. [2024-10-24 01:50:57,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:57,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1639 transitions. [2024-10-24 01:50:57,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 01:50:57,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:57,971 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] [2024-10-24 01:50:57,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-10-24 01:50:57,972 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-10-24 01:50:57,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:57,972 INFO L85 PathProgramCache]: Analyzing trace with hash -579470549, now seen corresponding path program 1 times [2024-10-24 01:50:57,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:57,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678079816] [2024-10-24 01:50:57,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:57,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:58,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:58,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:58,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678079816] [2024-10-24 01:50:58,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678079816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:58,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:58,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:58,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57980475] [2024-10-24 01:50:58,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:58,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:50:58,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:58,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:50:58,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:50:58,123 INFO L87 Difference]: Start difference. First operand 1169 states and 1639 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:58,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:58,227 INFO L93 Difference]: Finished difference Result 2376 states and 3365 transitions. [2024-10-24 01:50:58,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:50:58,227 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2024-10-24 01:50:58,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:58,230 INFO L225 Difference]: With dead ends: 2376 [2024-10-24 01:50:58,231 INFO L226 Difference]: Without dead ends: 2135 [2024-10-24 01:50:58,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:50:58,232 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 1025 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:58,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 1193 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:50:58,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2135 states. [2024-10-24 01:50:58,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2135 to 1408. [2024-10-24 01:50:58,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1408 states, 1407 states have (on average 1.407960199004975) internal successors, (1981), 1407 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:58,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 1981 transitions. [2024-10-24 01:50:58,255 INFO L78 Accepts]: Start accepts. Automaton has 1408 states and 1981 transitions. Word has length 115 [2024-10-24 01:50:58,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:58,256 INFO L471 AbstractCegarLoop]: Abstraction has 1408 states and 1981 transitions. [2024-10-24 01:50:58,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:58,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 1981 transitions. [2024-10-24 01:50:58,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 01:50:58,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:58,257 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] [2024-10-24 01:50:58,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-10-24 01:50:58,257 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-10-24 01:50:58,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:58,258 INFO L85 PathProgramCache]: Analyzing trace with hash 704311, now seen corresponding path program 1 times [2024-10-24 01:50:58,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:58,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239556355] [2024-10-24 01:50:58,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:58,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:58,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:58,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:58,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239556355] [2024-10-24 01:50:58,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239556355] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:58,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:58,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:50:58,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227701028] [2024-10-24 01:50:58,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:58,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:50:58,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:58,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:50:58,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:50:58,384 INFO L87 Difference]: Start difference. First operand 1408 states and 1981 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:58,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:58,501 INFO L93 Difference]: Finished difference Result 2615 states and 3707 transitions. [2024-10-24 01:50:58,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:50:58,502 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2024-10-24 01:50:58,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:58,505 INFO L225 Difference]: With dead ends: 2615 [2024-10-24 01:50:58,505 INFO L226 Difference]: Without dead ends: 2374 [2024-10-24 01:50:58,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:50:58,506 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 965 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:58,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 1324 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:50:58,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2374 states. [2024-10-24 01:50:58,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2374 to 1647. [2024-10-24 01:50:58,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1646 states have (on average 1.411300121506683) internal successors, (2323), 1646 states have internal predecessors, (2323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:58,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2323 transitions. [2024-10-24 01:50:58,531 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2323 transitions. Word has length 115 [2024-10-24 01:50:58,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:58,531 INFO L471 AbstractCegarLoop]: Abstraction has 1647 states and 2323 transitions. [2024-10-24 01:50:58,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:58,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2323 transitions. [2024-10-24 01:50:58,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 01:50:58,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:58,533 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-10-24 01:50:58,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-10-24 01:50:58,533 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-10-24 01:50:58,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:58,533 INFO L85 PathProgramCache]: Analyzing trace with hash 879840784, now seen corresponding path program 1 times [2024-10-24 01:50:58,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:58,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627364876] [2024-10-24 01:50:58,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:58,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:58,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:58,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:58,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627364876] [2024-10-24 01:50:58,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627364876] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:58,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:58,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:50:58,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215415666] [2024-10-24 01:50:58,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:58,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:50:58,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:58,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:50:58,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:50:58,648 INFO L87 Difference]: Start difference. First operand 1647 states and 2323 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-10-24 01:50:58,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:58,672 INFO L93 Difference]: Finished difference Result 4122 states and 5838 transitions. [2024-10-24 01:50:58,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:50:58,672 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-10-24 01:50:58,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:58,676 INFO L225 Difference]: With dead ends: 4122 [2024-10-24 01:50:58,676 INFO L226 Difference]: Without dead ends: 2566 [2024-10-24 01:50:58,678 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-10-24 01:50:58,678 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 95 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:58,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 416 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:50:58,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2024-10-24 01:50:58,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2460. [2024-10-24 01:50:58,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2460 states, 2459 states have (on average 1.4050427002846686) internal successors, (3455), 2459 states have internal predecessors, (3455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:58,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2460 states to 2460 states and 3455 transitions. [2024-10-24 01:50:58,701 INFO L78 Accepts]: Start accepts. Automaton has 2460 states and 3455 transitions. Word has length 116 [2024-10-24 01:50:58,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:58,702 INFO L471 AbstractCegarLoop]: Abstraction has 2460 states and 3455 transitions. [2024-10-24 01:50:58,702 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-10-24 01:50:58,702 INFO L276 IsEmpty]: Start isEmpty. Operand 2460 states and 3455 transitions. [2024-10-24 01:50:58,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 01:50:58,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:58,703 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:50:58,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-10-24 01:50:58,703 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-10-24 01:50:58,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:58,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1646779703, now seen corresponding path program 1 times [2024-10-24 01:50:58,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:58,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514658391] [2024-10-24 01:50:58,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:58,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:58,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:58,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:58,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514658391] [2024-10-24 01:50:58,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514658391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:58,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:58,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:50:58,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902319409] [2024-10-24 01:50:58,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:58,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:50:58,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:58,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:50:58,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:50:58,804 INFO L87 Difference]: Start difference. First operand 2460 states and 3455 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-10-24 01:50:58,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:58,833 INFO L93 Difference]: Finished difference Result 7042 states and 9898 transitions. [2024-10-24 01:50:58,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:50:58,834 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-10-24 01:50:58,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:58,841 INFO L225 Difference]: With dead ends: 7042 [2024-10-24 01:50:58,842 INFO L226 Difference]: Without dead ends: 4673 [2024-10-24 01:50:58,846 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-10-24 01:50:58,846 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 88 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:58,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 416 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:50:58,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4673 states. [2024-10-24 01:50:58,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4673 to 4515. [2024-10-24 01:50:58,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4515 states, 4514 states have (on average 1.3967656180770935) internal successors, (6305), 4514 states have internal predecessors, (6305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:58,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4515 states to 4515 states and 6305 transitions. [2024-10-24 01:50:58,895 INFO L78 Accepts]: Start accepts. Automaton has 4515 states and 6305 transitions. Word has length 117 [2024-10-24 01:50:58,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:58,896 INFO L471 AbstractCegarLoop]: Abstraction has 4515 states and 6305 transitions. [2024-10-24 01:50:58,896 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-10-24 01:50:58,896 INFO L276 IsEmpty]: Start isEmpty. Operand 4515 states and 6305 transitions. [2024-10-24 01:50:58,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 01:50:58,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:58,897 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-10-24 01:50:58,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-10-24 01:50:58,897 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-10-24 01:50:58,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:58,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1685712589, now seen corresponding path program 1 times [2024-10-24 01:50:58,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:58,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667447868] [2024-10-24 01:50:58,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:58,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:58,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:59,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:59,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667447868] [2024-10-24 01:50:59,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667447868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:59,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:59,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:50:59,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753460813] [2024-10-24 01:50:59,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:59,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:50:59,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:59,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:50:59,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:50:59,002 INFO L87 Difference]: Start difference. First operand 4515 states and 6305 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-10-24 01:50:59,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:59,068 INFO L93 Difference]: Finished difference Result 13051 states and 18175 transitions. [2024-10-24 01:50:59,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:50:59,068 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-10-24 01:50:59,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:59,080 INFO L225 Difference]: With dead ends: 13051 [2024-10-24 01:50:59,080 INFO L226 Difference]: Without dead ends: 8627 [2024-10-24 01:50:59,085 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-10-24 01:50:59,086 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 81 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:59,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 416 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:50:59,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8627 states. [2024-10-24 01:50:59,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8627 to 8313. [2024-10-24 01:50:59,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8313 states, 8312 states have (on average 1.3833012512030798) internal successors, (11498), 8312 states have internal predecessors, (11498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:59,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8313 states to 8313 states and 11498 transitions. [2024-10-24 01:50:59,185 INFO L78 Accepts]: Start accepts. Automaton has 8313 states and 11498 transitions. Word has length 118 [2024-10-24 01:50:59,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:59,186 INFO L471 AbstractCegarLoop]: Abstraction has 8313 states and 11498 transitions. [2024-10-24 01:50:59,186 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-10-24 01:50:59,186 INFO L276 IsEmpty]: Start isEmpty. Operand 8313 states and 11498 transitions. [2024-10-24 01:50:59,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 01:50:59,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:59,187 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-10-24 01:50:59,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-10-24 01:50:59,187 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-10-24 01:50:59,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:59,188 INFO L85 PathProgramCache]: Analyzing trace with hash 800829190, now seen corresponding path program 1 times [2024-10-24 01:50:59,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:59,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270064872] [2024-10-24 01:50:59,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:59,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:59,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:59,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-10-24 01:50:59,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:59,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270064872] [2024-10-24 01:50:59,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270064872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:59,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:59,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:50:59,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975843010] [2024-10-24 01:50:59,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:59,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:50:59,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:59,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:50:59,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:50:59,305 INFO L87 Difference]: Start difference. First operand 8313 states and 11498 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-10-24 01:50:59,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:59,368 INFO L93 Difference]: Finished difference Result 24133 states and 33208 transitions. [2024-10-24 01:50:59,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:50:59,369 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-10-24 01:50:59,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:59,392 INFO L225 Difference]: With dead ends: 24133 [2024-10-24 01:50:59,393 INFO L226 Difference]: Without dead ends: 15911 [2024-10-24 01:50:59,404 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-10-24 01:50:59,404 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 74 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:59,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 415 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:50:59,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15911 states. [2024-10-24 01:50:59,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15911 to 15285. [2024-10-24 01:50:59,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15285 states, 15284 states have (on average 1.3654802407746662) internal successors, (20870), 15284 states have internal predecessors, (20870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:50:59,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15285 states to 15285 states and 20870 transitions. [2024-10-24 01:50:59,591 INFO L78 Accepts]: Start accepts. Automaton has 15285 states and 20870 transitions. Word has length 119 [2024-10-24 01:50:59,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:50:59,592 INFO L471 AbstractCegarLoop]: Abstraction has 15285 states and 20870 transitions. [2024-10-24 01:50:59,592 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-10-24 01:50:59,592 INFO L276 IsEmpty]: Start isEmpty. Operand 15285 states and 20870 transitions. [2024-10-24 01:50:59,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 01:50:59,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:50:59,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:50:59,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-10-24 01:50:59,593 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-10-24 01:50:59,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:50:59,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1494180370, now seen corresponding path program 1 times [2024-10-24 01:50:59,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:50:59,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717928769] [2024-10-24 01:50:59,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:50:59,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:50:59,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:50:59,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:50:59,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:50:59,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717928769] [2024-10-24 01:50:59,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717928769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:50:59,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:50:59,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:50:59,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284052757] [2024-10-24 01:50:59,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:50:59,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:50:59,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:50:59,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:50:59,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:50:59,766 INFO L87 Difference]: Start difference. First operand 15285 states and 20870 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-10-24 01:50:59,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:50:59,864 INFO L93 Difference]: Finished difference Result 44425 states and 60232 transitions. [2024-10-24 01:50:59,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:50:59,864 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-10-24 01:50:59,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:50:59,914 INFO L225 Difference]: With dead ends: 44425 [2024-10-24 01:50:59,914 INFO L226 Difference]: Without dead ends: 29231 [2024-10-24 01:50:59,936 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-10-24 01:50:59,937 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 64 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:50:59,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 413 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:50:59,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29231 states. [2024-10-24 01:51:00,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29231 to 27981. [2024-10-24 01:51:00,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27981 states, 27980 states have (on average 1.3433166547533952) internal successors, (37586), 27980 states have internal predecessors, (37586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:00,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27981 states to 27981 states and 37586 transitions. [2024-10-24 01:51:00,457 INFO L78 Accepts]: Start accepts. Automaton has 27981 states and 37586 transitions. Word has length 120 [2024-10-24 01:51:00,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:51:00,458 INFO L471 AbstractCegarLoop]: Abstraction has 27981 states and 37586 transitions. [2024-10-24 01:51:00,458 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-10-24 01:51:00,458 INFO L276 IsEmpty]: Start isEmpty. Operand 27981 states and 37586 transitions. [2024-10-24 01:51:00,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 01:51:00,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:51:00,459 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-10-24 01:51:00,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-10-24 01:51:00,459 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-10-24 01:51:00,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:51:00,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1337857427, now seen corresponding path program 1 times [2024-10-24 01:51:00,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:51:00,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683232227] [2024-10-24 01:51:00,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:51:00,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:51:00,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:51:00,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:51:00,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:51:00,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683232227] [2024-10-24 01:51:00,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683232227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:51:00,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:51:00,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:51:00,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124751965] [2024-10-24 01:51:00,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:51:00,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:51:00,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:51:00,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:51:00,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:51:00,699 INFO L87 Difference]: Start difference. First operand 27981 states and 37586 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 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-10-24 01:51:00,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:51:00,970 INFO L93 Difference]: Finished difference Result 28559 states and 38355 transitions. [2024-10-24 01:51:00,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 01:51:00,971 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 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-10-24 01:51:00,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:51:01,021 INFO L225 Difference]: With dead ends: 28559 [2024-10-24 01:51:01,022 INFO L226 Difference]: Without dead ends: 28557 [2024-10-24 01:51:01,037 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-10-24 01:51:01,038 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:51:01,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 921 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:51:01,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28557 states. [2024-10-24 01:51:01,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28557 to 28557. [2024-10-24 01:51:01,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28557 states, 28556 states have (on average 1.3285474156044264) internal successors, (37938), 28556 states have internal predecessors, (37938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:01,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28557 states to 28557 states and 37938 transitions. [2024-10-24 01:51:01,605 INFO L78 Accepts]: Start accepts. Automaton has 28557 states and 37938 transitions. Word has length 121 [2024-10-24 01:51:01,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:51:01,606 INFO L471 AbstractCegarLoop]: Abstraction has 28557 states and 37938 transitions. [2024-10-24 01:51:01,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 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-10-24 01:51:01,606 INFO L276 IsEmpty]: Start isEmpty. Operand 28557 states and 37938 transitions. [2024-10-24 01:51:01,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 01:51:01,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:51:01,607 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-10-24 01:51:01,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-10-24 01:51:01,607 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-10-24 01:51:01,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:51:01,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1089029553, now seen corresponding path program 1 times [2024-10-24 01:51:01,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:51:01,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487841933] [2024-10-24 01:51:01,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:51:01,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:51:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:51:01,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:51:01,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:51:01,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487841933] [2024-10-24 01:51:01,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487841933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:51:01,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:51:01,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:51:01,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481333408] [2024-10-24 01:51:01,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:51:01,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:51:01,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:51:01,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:51:01,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:51:01,790 INFO L87 Difference]: Start difference. First operand 28557 states and 37938 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-10-24 01:51:01,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:51:01,938 INFO L93 Difference]: Finished difference Result 57777 states and 76788 transitions. [2024-10-24 01:51:01,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:51:01,938 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-10-24 01:51:01,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:51:02,186 INFO L225 Difference]: With dead ends: 57777 [2024-10-24 01:51:02,186 INFO L226 Difference]: Without dead ends: 29311 [2024-10-24 01:51:02,234 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-10-24 01:51:02,234 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 107 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:51:02,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 343 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:51:02,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29311 states. [2024-10-24 01:51:02,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29311 to 29309. [2024-10-24 01:51:02,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29309 states, 29308 states have (on average 1.3141121877985533) internal successors, (38514), 29308 states have internal predecessors, (38514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:51:02,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29309 states to 29309 states and 38514 transitions. [2024-10-24 01:51:02,904 INFO L78 Accepts]: Start accepts. Automaton has 29309 states and 38514 transitions. Word has length 121 [2024-10-24 01:51:02,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:51:02,904 INFO L471 AbstractCegarLoop]: Abstraction has 29309 states and 38514 transitions. [2024-10-24 01:51:02,904 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-10-24 01:51:02,904 INFO L276 IsEmpty]: Start isEmpty. Operand 29309 states and 38514 transitions. [2024-10-24 01:51:02,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-24 01:51:02,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:51:02,923 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] [2024-10-24 01:51:02,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-10-24 01:51:02,924 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-10-24 01:51:02,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:51:02,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1227882138, now seen corresponding path program 1 times [2024-10-24 01:51:02,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:51:02,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697062133] [2024-10-24 01:51:02,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:51:02,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:51:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:51:03,640 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:51:03,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:51:03,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697062133] [2024-10-24 01:51:03,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697062133] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:51:03,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518622894] [2024-10-24 01:51:03,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:51:03,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:51:03,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:51:03,643 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:51:03,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 01:51:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:51:04,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 01:51:04,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:51:05,123 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:51:05,123 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:51:06,621 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:51:06,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518622894] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:51:06,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:51:06,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2024-10-24 01:51:06,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652108469] [2024-10-24 01:51:06,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:51:06,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-24 01:51:06,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:51:06,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-24 01:51:06,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=766, Unknown=0, NotChecked=0, Total=870 [2024-10-24 01:51:06,624 INFO L87 Difference]: Start difference. First operand 29309 states and 38514 transitions. Second operand has 30 states, 30 states have (on average 13.833333333333334) internal successors, (415), 29 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)