./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 61a67961 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-wip.fs.cvc5-61a6796-m [2024-10-14 03:57:56,485 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:57:56,585 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:57:56,595 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:57:56,596 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:57:56,623 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:57:56,624 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:57:56,624 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:57:56,625 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:57:56,625 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:57:56,625 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:57:56,626 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:57:56,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:57:56,627 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:57:56,627 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:57:56,627 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:57:56,628 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:57:56,628 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:57:56,628 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:57:56,629 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:57:56,629 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:57:56,630 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:57:56,630 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:57:56,630 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:57:56,631 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:57:56,631 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:57:56,631 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:57:56,631 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:57:56,632 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:57:56,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:57:56,632 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:57:56,633 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:57:56,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:57:56,633 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:57:56,634 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:57:56,634 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:57:56,634 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:57:56,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:57:56,635 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:57:56,635 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:57:56,635 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:57:56,636 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:57:56,636 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-14 03:57:56,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:57:56,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:57:56,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:57:56,906 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:57:56,906 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:57:56,907 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-14 03:57:58,387 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:57:58,735 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:57:58,736 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-14 03:57:58,760 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b0c1ca00/d100c2e622044d95bfbd07a8fcf6bd42/FLAGf373de732 [2024-10-14 03:57:58,774 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b0c1ca00/d100c2e622044d95bfbd07a8fcf6bd42 [2024-10-14 03:57:58,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:57:58,778 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:57:58,780 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:57:58,782 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:57:58,786 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:57:58,787 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:57:58" (1/1) ... [2024-10-14 03:57:58,788 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cb564f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:57:58, skipping insertion in model container [2024-10-14 03:57:58,788 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:57:58" (1/1) ... [2024-10-14 03:57:58,889 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:57:59,237 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-14 03:57:59,258 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-14 03:57:59,269 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-14 03:57:59,274 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-14 03:57:59,287 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-14 03:57:59,298 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-14 03:57:59,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[20908,20921] [2024-10-14 03:57:59,317 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-14 03:57:59,321 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-14 03:57:59,327 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-14 03:57:59,338 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-14 03:57:59,354 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-14 03:57:59,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-14 03:57:59,372 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-14 03:57:59,386 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-14 03:57:59,407 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-14 03:57:59,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:57:59,604 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:57:59,682 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-14 03:57:59,692 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-14 03:57:59,697 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-14 03:57:59,700 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-14 03:57:59,709 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-14 03:57:59,712 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-14 03:57:59,720 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-14 03:57:59,727 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-14 03:57:59,730 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-14 03:57:59,734 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-14 03:57:59,742 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-14 03:57:59,752 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-14 03:57:59,759 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-14 03:57:59,766 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-14 03:57:59,777 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-14 03:57:59,790 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-14 03:57:59,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:57:59,922 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:57:59,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:57:59 WrapperNode [2024-10-14 03:57:59,923 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:57:59,924 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:57:59,924 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:57:59,924 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:57:59,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:57:59" (1/1) ... [2024-10-14 03:57:59,976 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:57:59" (1/1) ... [2024-10-14 03:58:00,074 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3756 [2024-10-14 03:58:00,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:58:00,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:58:00,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:58:00,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:58:00,086 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:57:59" (1/1) ... [2024-10-14 03:58:00,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:57:59" (1/1) ... [2024-10-14 03:58:00,099 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:57:59" (1/1) ... [2024-10-14 03:58:00,194 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-14 03:58:00,194 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:57:59" (1/1) ... [2024-10-14 03:58:00,215 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:57:59" (1/1) ... [2024-10-14 03:58:00,286 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:57:59" (1/1) ... [2024-10-14 03:58:00,310 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:57:59" (1/1) ... [2024-10-14 03:58:00,321 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:57:59" (1/1) ... [2024-10-14 03:58:00,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:57:59" (1/1) ... [2024-10-14 03:58:00,356 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:58:00,358 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:58:00,358 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:58:00,358 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:58:00,360 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:57:59" (1/1) ... [2024-10-14 03:58:00,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:58:00,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:58:00,398 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-14 03:58:00,403 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-14 03:58:00,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:58:00,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:58:00,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:58:00,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:58:00,670 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:58:00,671 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:58:02,549 INFO L? ?]: Removed 602 outVars from TransFormulas that were not future-live. [2024-10-14 03:58:02,549 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:58:02,626 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:58:02,630 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 03:58:02,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:58:02 BoogieIcfgContainer [2024-10-14 03:58:02,631 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:58:02,632 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:58:02,633 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:58:02,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:58:02,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:57:58" (1/3) ... [2024-10-14 03:58:02,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a319fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:58:02, skipping insertion in model container [2024-10-14 03:58:02,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:57:59" (2/3) ... [2024-10-14 03:58:02,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a319fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:58:02, skipping insertion in model container [2024-10-14 03:58:02,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:58:02" (3/3) ... [2024-10-14 03:58:02,639 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2024-10-14 03:58:02,656 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:58:02,656 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-10-14 03:58:02,751 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:58:02,758 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;@4f4e7c65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:58:02,759 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-14 03:58:02,769 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-14 03:58:02,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 03:58:02,791 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:02,795 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-14 03:58:02,796 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-14 03:58:02,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:02,800 INFO L85 PathProgramCache]: Analyzing trace with hash 533676138, now seen corresponding path program 1 times [2024-10-14 03:58:02,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:02,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339427387] [2024-10-14 03:58:02,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:02,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:03,509 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-14 03:58:03,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:03,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339427387] [2024-10-14 03:58:03,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339427387] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:03,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:03,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:58:03,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967404629] [2024-10-14 03:58:03,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:03,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:58:03,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:03,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:58:03,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:58:03,551 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-14 03:58:04,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:04,169 INFO L93 Difference]: Finished difference Result 971 states and 1687 transitions. [2024-10-14 03:58:04,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:58:04,172 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-14 03:58:04,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:04,189 INFO L225 Difference]: With dead ends: 971 [2024-10-14 03:58:04,189 INFO L226 Difference]: Without dead ends: 509 [2024-10-14 03:58:04,195 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-14 03:58:04,200 INFO L432 NwaCegarLoop]: 581 mSDtfsCounter, 2540 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:04,201 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.5s Time] [2024-10-14 03:58:04,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-10-14 03:58:04,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2024-10-14 03:58:04,265 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-14 03:58:04,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 642 transitions. [2024-10-14 03:58:04,270 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 642 transitions. Word has length 71 [2024-10-14 03:58:04,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:04,271 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 642 transitions. [2024-10-14 03:58:04,271 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-14 03:58:04,271 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 642 transitions. [2024-10-14 03:58:04,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 03:58:04,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:04,277 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-14 03:58:04,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:58:04,277 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-14 03:58:04,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:04,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1104820237, now seen corresponding path program 1 times [2024-10-14 03:58:04,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:04,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942987832] [2024-10-14 03:58:04,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:04,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:04,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:04,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:04,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942987832] [2024-10-14 03:58:04,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942987832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:04,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:04,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:58:04,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124223221] [2024-10-14 03:58:04,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:04,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:58:04,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:04,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:58:04,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:58:04,525 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-14 03:58:04,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:04,840 INFO L93 Difference]: Finished difference Result 847 states and 1098 transitions. [2024-10-14 03:58:04,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:58:04,841 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-14 03:58:04,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:04,844 INFO L225 Difference]: With dead ends: 847 [2024-10-14 03:58:04,844 INFO L226 Difference]: Without dead ends: 442 [2024-10-14 03:58:04,845 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-14 03:58:04,846 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-14 03:58:04,847 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-14 03:58:04,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-10-14 03:58:04,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2024-10-14 03:58:04,876 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-14 03:58:04,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 566 transitions. [2024-10-14 03:58:04,878 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 566 transitions. Word has length 72 [2024-10-14 03:58:04,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:04,880 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 566 transitions. [2024-10-14 03:58:04,882 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-14 03:58:04,882 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 566 transitions. [2024-10-14 03:58:04,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-14 03:58:04,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:04,884 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-14 03:58:04,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:58:04,884 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-14 03:58:04,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:04,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1559303919, now seen corresponding path program 1 times [2024-10-14 03:58:04,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:04,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213574329] [2024-10-14 03:58:04,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:04,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:05,101 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-14 03:58:05,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:05,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213574329] [2024-10-14 03:58:05,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213574329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:05,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:05,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:58:05,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257377398] [2024-10-14 03:58:05,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:05,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:58:05,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:05,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:58:05,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:58:05,105 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-14 03:58:05,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:05,387 INFO L93 Difference]: Finished difference Result 780 states and 1021 transitions. [2024-10-14 03:58:05,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:58:05,388 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-14 03:58:05,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:05,390 INFO L225 Difference]: With dead ends: 780 [2024-10-14 03:58:05,390 INFO L226 Difference]: Without dead ends: 416 [2024-10-14 03:58:05,391 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-14 03:58:05,392 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-14 03:58:05,392 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-14 03:58:05,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-10-14 03:58:05,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2024-10-14 03:58:05,405 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-14 03:58:05,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 535 transitions. [2024-10-14 03:58:05,410 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 535 transitions. Word has length 73 [2024-10-14 03:58:05,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:05,411 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 535 transitions. [2024-10-14 03:58:05,411 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-14 03:58:05,411 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 535 transitions. [2024-10-14 03:58:05,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 03:58:05,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:05,412 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-14 03:58:05,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:58:05,413 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-14 03:58:05,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:05,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1409781752, now seen corresponding path program 1 times [2024-10-14 03:58:05,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:05,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212028273] [2024-10-14 03:58:05,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:05,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:05,589 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-14 03:58:05,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:05,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212028273] [2024-10-14 03:58:05,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212028273] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:05,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:05,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:58:05,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610242784] [2024-10-14 03:58:05,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:05,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:58:05,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:05,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:58:05,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:58:05,594 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-14 03:58:05,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:05,859 INFO L93 Difference]: Finished difference Result 754 states and 989 transitions. [2024-10-14 03:58:05,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:58:05,860 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-14 03:58:05,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:05,862 INFO L225 Difference]: With dead ends: 754 [2024-10-14 03:58:05,862 INFO L226 Difference]: Without dead ends: 397 [2024-10-14 03:58:05,863 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-14 03:58:05,864 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-14 03:58:05,868 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-14 03:58:05,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-10-14 03:58:05,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2024-10-14 03:58:05,878 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-14 03:58:05,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 513 transitions. [2024-10-14 03:58:05,879 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 513 transitions. Word has length 74 [2024-10-14 03:58:05,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:05,879 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 513 transitions. [2024-10-14 03:58:05,879 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-14 03:58:05,879 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 513 transitions. [2024-10-14 03:58:05,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 03:58:05,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:05,880 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-14 03:58:05,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:58:05,881 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-14 03:58:05,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:05,882 INFO L85 PathProgramCache]: Analyzing trace with hash 254667180, now seen corresponding path program 1 times [2024-10-14 03:58:05,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:05,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954923584] [2024-10-14 03:58:05,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:05,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:06,072 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-14 03:58:06,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:06,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954923584] [2024-10-14 03:58:06,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954923584] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:06,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:06,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:58:06,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030720731] [2024-10-14 03:58:06,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:06,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:58:06,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:06,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:58:06,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:58:06,075 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-14 03:58:06,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:06,374 INFO L93 Difference]: Finished difference Result 735 states and 966 transitions. [2024-10-14 03:58:06,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:58:06,374 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-14 03:58:06,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:06,378 INFO L225 Difference]: With dead ends: 735 [2024-10-14 03:58:06,378 INFO L226 Difference]: Without dead ends: 392 [2024-10-14 03:58:06,379 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-14 03:58:06,380 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 1416 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-14 03:58:06,380 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-14 03:58:06,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-14 03:58:06,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-14 03:58:06,390 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-14 03:58:06,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 506 transitions. [2024-10-14 03:58:06,391 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 506 transitions. Word has length 75 [2024-10-14 03:58:06,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:06,391 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 506 transitions. [2024-10-14 03:58:06,392 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-14 03:58:06,392 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 506 transitions. [2024-10-14 03:58:06,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 03:58:06,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:06,394 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-14 03:58:06,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:58:06,395 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-14 03:58:06,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:06,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1435179207, now seen corresponding path program 1 times [2024-10-14 03:58:06,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:06,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856188144] [2024-10-14 03:58:06,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:06,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:06,858 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-14 03:58:06,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:06,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856188144] [2024-10-14 03:58:06,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856188144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:06,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:06,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:06,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4649055] [2024-10-14 03:58:06,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:06,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:58:06,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:06,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:58:06,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:58:06,863 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-14 03:58:07,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:07,698 INFO L93 Difference]: Finished difference Result 694 states and 914 transitions. [2024-10-14 03:58:07,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:58:07,698 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-14 03:58:07,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:07,701 INFO L225 Difference]: With dead ends: 694 [2024-10-14 03:58:07,701 INFO L226 Difference]: Without dead ends: 604 [2024-10-14 03:58:07,703 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-14 03:58:07,704 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-14 03:58:07,705 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-14 03:58:07,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-14 03:58:07,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 392. [2024-10-14 03:58:07,715 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-14 03:58:07,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 505 transitions. [2024-10-14 03:58:07,716 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 505 transitions. Word has length 76 [2024-10-14 03:58:07,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:07,717 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 505 transitions. [2024-10-14 03:58:07,717 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-14 03:58:07,717 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 505 transitions. [2024-10-14 03:58:07,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 03:58:07,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:07,718 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-14 03:58:07,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:58:07,719 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-14 03:58:07,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:07,719 INFO L85 PathProgramCache]: Analyzing trace with hash 980279151, now seen corresponding path program 1 times [2024-10-14 03:58:07,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:07,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287328822] [2024-10-14 03:58:07,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:07,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:07,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:08,155 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-14 03:58:08,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:08,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287328822] [2024-10-14 03:58:08,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287328822] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:08,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:08,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:08,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797924549] [2024-10-14 03:58:08,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:08,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:58:08,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:08,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:58:08,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:58:08,157 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-14 03:58:09,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:09,022 INFO L93 Difference]: Finished difference Result 737 states and 968 transitions. [2024-10-14 03:58:09,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:58:09,023 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-14 03:58:09,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:09,025 INFO L225 Difference]: With dead ends: 737 [2024-10-14 03:58:09,026 INFO L226 Difference]: Without dead ends: 608 [2024-10-14 03:58:09,026 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-14 03:58:09,027 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-14 03:58:09,027 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-14 03:58:09,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-10-14 03:58:09,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 392. [2024-10-14 03:58:09,034 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-14 03:58:09,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 504 transitions. [2024-10-14 03:58:09,035 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 504 transitions. Word has length 76 [2024-10-14 03:58:09,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:09,035 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 504 transitions. [2024-10-14 03:58:09,036 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-14 03:58:09,036 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 504 transitions. [2024-10-14 03:58:09,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 03:58:09,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:09,037 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-14 03:58:09,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:58:09,037 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-14 03:58:09,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:09,038 INFO L85 PathProgramCache]: Analyzing trace with hash -612595194, now seen corresponding path program 1 times [2024-10-14 03:58:09,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:09,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980336755] [2024-10-14 03:58:09,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:09,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:09,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:09,371 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-14 03:58:09,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:09,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980336755] [2024-10-14 03:58:09,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980336755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:09,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:09,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:58:09,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191214355] [2024-10-14 03:58:09,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:09,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:58:09,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:09,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:58:09,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:58:09,374 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-14 03:58:10,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:10,023 INFO L93 Difference]: Finished difference Result 759 states and 962 transitions. [2024-10-14 03:58:10,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 03:58:10,023 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-14 03:58:10,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:10,026 INFO L225 Difference]: With dead ends: 759 [2024-10-14 03:58:10,026 INFO L226 Difference]: Without dead ends: 546 [2024-10-14 03:58:10,028 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-14 03:58:10,029 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-14 03:58:10,031 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-14 03:58:10,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2024-10-14 03:58:10,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 392. [2024-10-14 03:58:10,041 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-14 03:58:10,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 503 transitions. [2024-10-14 03:58:10,042 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 503 transitions. Word has length 76 [2024-10-14 03:58:10,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:10,043 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 503 transitions. [2024-10-14 03:58:10,044 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-14 03:58:10,044 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 503 transitions. [2024-10-14 03:58:10,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 03:58:10,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:10,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] [2024-10-14 03:58:10,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:58:10,045 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-14 03:58:10,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:10,046 INFO L85 PathProgramCache]: Analyzing trace with hash -988049107, now seen corresponding path program 1 times [2024-10-14 03:58:10,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:10,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821635103] [2024-10-14 03:58:10,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:10,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:10,737 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-14 03:58:10,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:10,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821635103] [2024-10-14 03:58:10,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821635103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:10,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:10,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 03:58:10,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266399226] [2024-10-14 03:58:10,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:10,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 03:58:10,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:10,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 03:58:10,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:58:10,740 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-14 03:58:12,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:12,206 INFO L93 Difference]: Finished difference Result 951 states and 1280 transitions. [2024-10-14 03:58:12,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 03:58:12,207 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-14 03:58:12,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:12,210 INFO L225 Difference]: With dead ends: 951 [2024-10-14 03:58:12,210 INFO L226 Difference]: Without dead ends: 852 [2024-10-14 03:58:12,211 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-14 03:58:12,213 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.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:12,213 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.1s Time] [2024-10-14 03:58:12,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2024-10-14 03:58:12,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 396. [2024-10-14 03:58:12,224 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-14 03:58:12,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 507 transitions. [2024-10-14 03:58:12,225 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 507 transitions. Word has length 78 [2024-10-14 03:58:12,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:12,225 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 507 transitions. [2024-10-14 03:58:12,225 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-14 03:58:12,226 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 507 transitions. [2024-10-14 03:58:12,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 03:58:12,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:12,227 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-14 03:58:12,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:58:12,227 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-14 03:58:12,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:12,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1396894335, now seen corresponding path program 1 times [2024-10-14 03:58:12,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:12,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086044608] [2024-10-14 03:58:12,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:12,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:12,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:12,580 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-14 03:58:12,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:12,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086044608] [2024-10-14 03:58:12,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086044608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:12,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:12,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:12,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364532989] [2024-10-14 03:58:12,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:12,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:58:12,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:12,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:58:12,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:58:12,582 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-14 03:58:13,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:13,334 INFO L93 Difference]: Finished difference Result 677 states and 880 transitions. [2024-10-14 03:58:13,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:58:13,334 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-14 03:58:13,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:13,337 INFO L225 Difference]: With dead ends: 677 [2024-10-14 03:58:13,337 INFO L226 Difference]: Without dead ends: 600 [2024-10-14 03:58:13,337 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-14 03:58:13,338 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-14 03:58:13,338 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-14 03:58:13,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-10-14 03:58:13,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 396. [2024-10-14 03:58:13,346 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-14 03:58:13,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 506 transitions. [2024-10-14 03:58:13,347 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 506 transitions. Word has length 78 [2024-10-14 03:58:13,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:13,348 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 506 transitions. [2024-10-14 03:58:13,348 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-14 03:58:13,348 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 506 transitions. [2024-10-14 03:58:13,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 03:58:13,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:13,349 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-14 03:58:13,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:58:13,349 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-14 03:58:13,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:13,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1028792160, now seen corresponding path program 1 times [2024-10-14 03:58:13,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:13,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378895544] [2024-10-14 03:58:13,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:13,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:13,613 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-14 03:58:13,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:13,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378895544] [2024-10-14 03:58:13,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378895544] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:13,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:13,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:13,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970946027] [2024-10-14 03:58:13,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:13,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:58:13,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:13,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:58:13,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:58:13,616 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-14 03:58:14,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:14,347 INFO L93 Difference]: Finished difference Result 677 states and 878 transitions. [2024-10-14 03:58:14,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:58:14,348 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-14 03:58:14,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:14,350 INFO L225 Difference]: With dead ends: 677 [2024-10-14 03:58:14,350 INFO L226 Difference]: Without dead ends: 600 [2024-10-14 03:58:14,351 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-14 03:58:14,351 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.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:14,351 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.6s Time] [2024-10-14 03:58:14,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-10-14 03:58:14,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 396. [2024-10-14 03:58:14,359 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-14 03:58:14,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 505 transitions. [2024-10-14 03:58:14,360 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 505 transitions. Word has length 78 [2024-10-14 03:58:14,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:14,361 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 505 transitions. [2024-10-14 03:58:14,361 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-14 03:58:14,361 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 505 transitions. [2024-10-14 03:58:14,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 03:58:14,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:14,362 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-14 03:58:14,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:58:14,363 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-14 03:58:14,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:14,363 INFO L85 PathProgramCache]: Analyzing trace with hash -391975036, now seen corresponding path program 1 times [2024-10-14 03:58:14,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:14,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811010087] [2024-10-14 03:58:14,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:14,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:14,668 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-14 03:58:14,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:14,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811010087] [2024-10-14 03:58:14,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811010087] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:14,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:14,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:14,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230672746] [2024-10-14 03:58:14,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:14,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:58:14,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:14,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:58:14,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:58:14,670 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-14 03:58:15,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:15,398 INFO L93 Difference]: Finished difference Result 673 states and 873 transitions. [2024-10-14 03:58:15,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:58:15,399 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-14 03:58:15,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:15,401 INFO L225 Difference]: With dead ends: 673 [2024-10-14 03:58:15,401 INFO L226 Difference]: Without dead ends: 600 [2024-10-14 03:58:15,402 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-14 03:58:15,402 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-14 03:58:15,402 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-14 03:58:15,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-10-14 03:58:15,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 396. [2024-10-14 03:58:15,409 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-14 03:58:15,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 504 transitions. [2024-10-14 03:58:15,410 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 504 transitions. Word has length 78 [2024-10-14 03:58:15,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:15,411 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 504 transitions. [2024-10-14 03:58:15,411 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-14 03:58:15,411 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 504 transitions. [2024-10-14 03:58:15,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 03:58:15,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:15,412 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-14 03:58:15,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:58:15,413 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-14 03:58:15,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:15,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1002682727, now seen corresponding path program 1 times [2024-10-14 03:58:15,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:15,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887115672] [2024-10-14 03:58:15,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:15,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:15,874 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-14 03:58:15,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:15,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887115672] [2024-10-14 03:58:15,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887115672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:15,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:15,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 03:58:15,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654876110] [2024-10-14 03:58:15,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:15,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 03:58:15,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:15,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 03:58:15,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 03:58:15,877 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-14 03:58:16,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:16,984 INFO L93 Difference]: Finished difference Result 832 states and 1090 transitions. [2024-10-14 03:58:16,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:58:16,984 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-14 03:58:16,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:16,987 INFO L225 Difference]: With dead ends: 832 [2024-10-14 03:58:16,987 INFO L226 Difference]: Without dead ends: 688 [2024-10-14 03:58:16,988 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-14 03:58:16,989 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.9s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:16,989 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.9s Time] [2024-10-14 03:58:16,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2024-10-14 03:58:16,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 396. [2024-10-14 03:58:16,996 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-14 03:58:16,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 503 transitions. [2024-10-14 03:58:16,997 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 503 transitions. Word has length 78 [2024-10-14 03:58:16,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:16,998 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 503 transitions. [2024-10-14 03:58:16,998 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-14 03:58:16,998 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 503 transitions. [2024-10-14 03:58:16,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 03:58:16,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:16,999 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-14 03:58:16,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 03:58:17,000 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-14 03:58:17,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:17,001 INFO L85 PathProgramCache]: Analyzing trace with hash 423246883, now seen corresponding path program 1 times [2024-10-14 03:58:17,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:17,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605928146] [2024-10-14 03:58:17,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:17,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:17,307 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-14 03:58:17,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:17,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605928146] [2024-10-14 03:58:17,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605928146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:17,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:17,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:17,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006131062] [2024-10-14 03:58:17,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:17,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:58:17,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:17,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:58:17,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:58:17,310 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-14 03:58:18,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:18,013 INFO L93 Difference]: Finished difference Result 677 states and 874 transitions. [2024-10-14 03:58:18,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:58:18,014 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-14 03:58:18,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:18,016 INFO L225 Difference]: With dead ends: 677 [2024-10-14 03:58:18,016 INFO L226 Difference]: Without dead ends: 600 [2024-10-14 03:58:18,016 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-14 03:58:18,017 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 1988 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:18,017 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.6s Time] [2024-10-14 03:58:18,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-10-14 03:58:18,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 396. [2024-10-14 03:58:18,024 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-14 03:58:18,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 502 transitions. [2024-10-14 03:58:18,026 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 502 transitions. Word has length 78 [2024-10-14 03:58:18,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:18,026 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 502 transitions. [2024-10-14 03:58:18,026 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-14 03:58:18,026 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 502 transitions. [2024-10-14 03:58:18,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 03:58:18,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:18,027 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:58:18,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:58:18,028 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-14 03:58:18,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:18,028 INFO L85 PathProgramCache]: Analyzing trace with hash 832092111, now seen corresponding path program 1 times [2024-10-14 03:58:18,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:18,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377304102] [2024-10-14 03:58:18,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:18,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:18,270 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-14 03:58:18,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:18,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377304102] [2024-10-14 03:58:18,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377304102] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:18,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:18,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:18,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014220832] [2024-10-14 03:58:18,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:18,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:58:18,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:18,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:58:18,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:58:18,272 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-14 03:58:18,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:18,931 INFO L93 Difference]: Finished difference Result 589 states and 741 transitions. [2024-10-14 03:58:18,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:58:18,931 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-14 03:58:18,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:18,933 INFO L225 Difference]: With dead ends: 589 [2024-10-14 03:58:18,934 INFO L226 Difference]: Without dead ends: 584 [2024-10-14 03:58:18,934 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-14 03:58:18,935 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 1276 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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-14 03:58:18,935 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-14 03:58:18,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2024-10-14 03:58:18,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 396. [2024-10-14 03:58:18,942 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-14 03:58:18,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 501 transitions. [2024-10-14 03:58:18,943 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 501 transitions. Word has length 78 [2024-10-14 03:58:18,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:18,943 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 501 transitions. [2024-10-14 03:58:18,943 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-14 03:58:18,944 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 501 transitions. [2024-10-14 03:58:18,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 03:58:18,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:18,945 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-14 03:58:18,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 03:58:18,945 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-14 03:58:18,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:18,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1550678083, now seen corresponding path program 1 times [2024-10-14 03:58:18,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:18,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224078720] [2024-10-14 03:58:18,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:18,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:19,243 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-14 03:58:19,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:19,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224078720] [2024-10-14 03:58:19,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224078720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:19,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:19,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:19,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818203835] [2024-10-14 03:58:19,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:19,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:58:19,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:19,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:58:19,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:58:19,248 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-14 03:58:19,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:19,997 INFO L93 Difference]: Finished difference Result 703 states and 909 transitions. [2024-10-14 03:58:19,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:58:19,998 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-14 03:58:19,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:20,000 INFO L225 Difference]: With dead ends: 703 [2024-10-14 03:58:20,000 INFO L226 Difference]: Without dead ends: 604 [2024-10-14 03:58:20,000 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-14 03:58:20,001 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 1507 mSDsluCounter, 1571 mSDsCounter, 0 mSdLazyCounter, 1305 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:20,001 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.6s Time] [2024-10-14 03:58:20,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-14 03:58:20,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 396. [2024-10-14 03:58:20,008 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-14 03:58:20,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 500 transitions. [2024-10-14 03:58:20,009 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 500 transitions. Word has length 78 [2024-10-14 03:58:20,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:20,009 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 500 transitions. [2024-10-14 03:58:20,009 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-14 03:58:20,009 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 500 transitions. [2024-10-14 03:58:20,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 03:58:20,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:20,011 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-14 03:58:20,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 03:58:20,012 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-14 03:58:20,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:20,013 INFO L85 PathProgramCache]: Analyzing trace with hash -508022715, now seen corresponding path program 1 times [2024-10-14 03:58:20,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:20,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069718030] [2024-10-14 03:58:20,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:20,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:20,273 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-14 03:58:20,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:20,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069718030] [2024-10-14 03:58:20,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069718030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:20,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:20,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:20,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889372985] [2024-10-14 03:58:20,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:20,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:58:20,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:20,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:58:20,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:58:20,275 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-14 03:58:21,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:21,002 INFO L93 Difference]: Finished difference Result 703 states and 911 transitions. [2024-10-14 03:58:21,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:58:21,003 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-14 03:58:21,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:21,006 INFO L225 Difference]: With dead ends: 703 [2024-10-14 03:58:21,006 INFO L226 Difference]: Without dead ends: 604 [2024-10-14 03:58:21,007 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-14 03:58:21,007 INFO L432 NwaCegarLoop]: 541 mSDtfsCounter, 1469 mSDsluCounter, 1432 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:21,007 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.6s Time] [2024-10-14 03:58:21,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-14 03:58:21,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 392. [2024-10-14 03:58:21,015 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-14 03:58:21,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 495 transitions. [2024-10-14 03:58:21,016 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 495 transitions. Word has length 79 [2024-10-14 03:58:21,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:21,017 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 495 transitions. [2024-10-14 03:58:21,017 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-14 03:58:21,017 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 495 transitions. [2024-10-14 03:58:21,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 03:58:21,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:21,018 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:58:21,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 03:58:21,019 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-14 03:58:21,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:21,019 INFO L85 PathProgramCache]: Analyzing trace with hash 380495892, now seen corresponding path program 1 times [2024-10-14 03:58:21,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:21,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962573549] [2024-10-14 03:58:21,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:21,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:21,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:21,300 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-14 03:58:21,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:21,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962573549] [2024-10-14 03:58:21,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962573549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:21,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:21,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:21,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827534554] [2024-10-14 03:58:21,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:21,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:58:21,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:21,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:58:21,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:58:21,302 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-14 03:58:21,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:21,947 INFO L93 Difference]: Finished difference Result 650 states and 830 transitions. [2024-10-14 03:58:21,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:58:21,947 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-14 03:58:21,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:21,949 INFO L225 Difference]: With dead ends: 650 [2024-10-14 03:58:21,949 INFO L226 Difference]: Without dead ends: 580 [2024-10-14 03:58:21,950 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-14 03:58:21,950 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-14 03:58:21,950 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-14 03:58:21,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-10-14 03:58:21,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 392. [2024-10-14 03:58:21,956 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-14 03:58:21,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 494 transitions. [2024-10-14 03:58:21,957 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 494 transitions. Word has length 80 [2024-10-14 03:58:21,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:21,957 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 494 transitions. [2024-10-14 03:58:21,958 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-14 03:58:21,958 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 494 transitions. [2024-10-14 03:58:21,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 03:58:21,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:21,959 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-14 03:58:21,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 03:58:21,959 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-14 03:58:21,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:21,960 INFO L85 PathProgramCache]: Analyzing trace with hash -2002274302, now seen corresponding path program 1 times [2024-10-14 03:58:21,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:21,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282211145] [2024-10-14 03:58:21,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:21,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:22,214 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-14 03:58:22,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:22,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282211145] [2024-10-14 03:58:22,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282211145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:22,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:22,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:22,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371987821] [2024-10-14 03:58:22,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:22,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:58:22,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:22,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:58:22,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:58:22,218 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-14 03:58:22,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:22,826 INFO L93 Difference]: Finished difference Result 678 states and 868 transitions. [2024-10-14 03:58:22,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:58:22,826 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-14 03:58:22,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:22,828 INFO L225 Difference]: With dead ends: 678 [2024-10-14 03:58:22,828 INFO L226 Difference]: Without dead ends: 596 [2024-10-14 03:58:22,828 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-14 03:58:22,829 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-14 03:58:22,829 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-14 03:58:22,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2024-10-14 03:58:22,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 392. [2024-10-14 03:58:22,834 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-14 03:58:22,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 493 transitions. [2024-10-14 03:58:22,835 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 493 transitions. Word has length 80 [2024-10-14 03:58:22,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:22,835 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 493 transitions. [2024-10-14 03:58:22,836 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-14 03:58:22,836 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 493 transitions. [2024-10-14 03:58:22,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 03:58:22,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:22,837 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-14 03:58:22,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 03:58:22,837 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-14 03:58:22,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:22,840 INFO L85 PathProgramCache]: Analyzing trace with hash 891103228, now seen corresponding path program 1 times [2024-10-14 03:58:22,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:22,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196045296] [2024-10-14 03:58:22,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:22,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:23,060 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-14 03:58:23,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:23,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196045296] [2024-10-14 03:58:23,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196045296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:23,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:23,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:23,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139084631] [2024-10-14 03:58:23,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:23,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:58:23,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:23,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:58:23,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:58:23,063 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-14 03:58:23,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:23,642 INFO L93 Difference]: Finished difference Result 647 states and 825 transitions. [2024-10-14 03:58:23,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:58:23,642 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-14 03:58:23,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:23,644 INFO L225 Difference]: With dead ends: 647 [2024-10-14 03:58:23,644 INFO L226 Difference]: Without dead ends: 580 [2024-10-14 03:58:23,645 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-14 03:58:23,645 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 1713 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:23,645 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.5s Time] [2024-10-14 03:58:23,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-10-14 03:58:23,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 392. [2024-10-14 03:58:23,652 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-14 03:58:23,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 492 transitions. [2024-10-14 03:58:23,653 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 492 transitions. Word has length 80 [2024-10-14 03:58:23,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:23,653 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 492 transitions. [2024-10-14 03:58:23,653 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-14 03:58:23,653 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 492 transitions. [2024-10-14 03:58:23,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 03:58:23,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:23,654 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-14 03:58:23,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 03:58:23,655 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-14 03:58:23,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:23,655 INFO L85 PathProgramCache]: Analyzing trace with hash -374640683, now seen corresponding path program 1 times [2024-10-14 03:58:23,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:23,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060342780] [2024-10-14 03:58:23,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:23,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:23,899 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-14 03:58:23,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:23,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060342780] [2024-10-14 03:58:23,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060342780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:23,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:23,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:23,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485228005] [2024-10-14 03:58:23,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:23,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:58:23,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:23,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:58:23,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:58:23,901 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-14 03:58:24,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:24,548 INFO L93 Difference]: Finished difference Result 650 states and 827 transitions. [2024-10-14 03:58:24,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:58:24,549 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-14 03:58:24,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:24,550 INFO L225 Difference]: With dead ends: 650 [2024-10-14 03:58:24,550 INFO L226 Difference]: Without dead ends: 580 [2024-10-14 03:58:24,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:58:24,551 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 1866 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:24,551 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.5s Time] [2024-10-14 03:58:24,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-10-14 03:58:24,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 392. [2024-10-14 03:58:24,559 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-14 03:58:24,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 491 transitions. [2024-10-14 03:58:24,560 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 491 transitions. Word has length 80 [2024-10-14 03:58:24,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:24,561 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 491 transitions. [2024-10-14 03:58:24,561 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-14 03:58:24,561 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 491 transitions. [2024-10-14 03:58:24,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 03:58:24,562 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:24,562 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-14 03:58:24,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 03:58:24,562 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-14 03:58:24,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:24,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1845105563, now seen corresponding path program 1 times [2024-10-14 03:58:24,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:24,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263260197] [2024-10-14 03:58:24,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:24,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:24,861 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-14 03:58:24,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:24,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263260197] [2024-10-14 03:58:24,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263260197] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:24,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:24,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:24,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342925314] [2024-10-14 03:58:24,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:24,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:58:24,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:24,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:58:24,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:58:24,863 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-14 03:58:25,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:25,474 INFO L93 Difference]: Finished difference Result 647 states and 822 transitions. [2024-10-14 03:58:25,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:58:25,475 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-14 03:58:25,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:25,477 INFO L225 Difference]: With dead ends: 647 [2024-10-14 03:58:25,477 INFO L226 Difference]: Without dead ends: 580 [2024-10-14 03:58:25,477 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-14 03:58:25,478 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 1543 mSDsluCounter, 1455 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:25,478 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.5s Time] [2024-10-14 03:58:25,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-10-14 03:58:25,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 392. [2024-10-14 03:58:25,484 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-14 03:58:25,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 490 transitions. [2024-10-14 03:58:25,485 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 490 transitions. Word has length 80 [2024-10-14 03:58:25,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:25,485 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 490 transitions. [2024-10-14 03:58:25,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-14 03:58:25,486 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 490 transitions. [2024-10-14 03:58:25,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 03:58:25,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:25,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-14 03:58:25,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 03:58:25,487 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-14 03:58:25,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:25,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1184234996, now seen corresponding path program 1 times [2024-10-14 03:58:25,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:25,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041445281] [2024-10-14 03:58:25,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:25,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:25,732 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-14 03:58:25,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:25,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041445281] [2024-10-14 03:58:25,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041445281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:25,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:25,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:25,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772440307] [2024-10-14 03:58:25,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:25,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:58:25,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:25,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:58:25,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:58:25,735 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-14 03:58:26,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:26,291 INFO L93 Difference]: Finished difference Result 585 states and 728 transitions. [2024-10-14 03:58:26,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:58:26,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-14 03:58:26,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:26,293 INFO L225 Difference]: With dead ends: 585 [2024-10-14 03:58:26,293 INFO L226 Difference]: Without dead ends: 580 [2024-10-14 03:58:26,293 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-14 03:58:26,294 INFO L432 NwaCegarLoop]: 414 mSDtfsCounter, 1508 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:26,294 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.5s Time] [2024-10-14 03:58:26,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-10-14 03:58:26,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 392. [2024-10-14 03:58:26,299 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-14 03:58:26,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 489 transitions. [2024-10-14 03:58:26,300 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 489 transitions. Word has length 80 [2024-10-14 03:58:26,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:26,300 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 489 transitions. [2024-10-14 03:58:26,301 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-14 03:58:26,301 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 489 transitions. [2024-10-14 03:58:26,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 03:58:26,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:26,301 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-14 03:58:26,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 03:58:26,302 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-14 03:58:26,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:26,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1196411487, now seen corresponding path program 1 times [2024-10-14 03:58:26,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:26,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118249909] [2024-10-14 03:58:26,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:26,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:26,587 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-14 03:58:26,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:26,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118249909] [2024-10-14 03:58:26,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118249909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:26,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:26,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:26,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17315439] [2024-10-14 03:58:26,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:26,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:58:26,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:26,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:58:26,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:58:26,591 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-14 03:58:27,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:27,109 INFO L93 Difference]: Finished difference Result 647 states and 819 transitions. [2024-10-14 03:58:27,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:58:27,109 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-14 03:58:27,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:27,111 INFO L225 Difference]: With dead ends: 647 [2024-10-14 03:58:27,111 INFO L226 Difference]: Without dead ends: 580 [2024-10-14 03:58:27,111 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-14 03:58:27,112 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 1858 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:27,112 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.4s Time] [2024-10-14 03:58:27,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-10-14 03:58:27,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 392. [2024-10-14 03:58:27,117 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-14 03:58:27,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 488 transitions. [2024-10-14 03:58:27,118 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 488 transitions. Word has length 80 [2024-10-14 03:58:27,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:27,118 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 488 transitions. [2024-10-14 03:58:27,118 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-14 03:58:27,118 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 488 transitions. [2024-10-14 03:58:27,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 03:58:27,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:27,119 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-14 03:58:27,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 03:58:27,119 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-14 03:58:27,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:27,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1992159898, now seen corresponding path program 1 times [2024-10-14 03:58:27,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:27,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878877564] [2024-10-14 03:58:27,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:27,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:27,371 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-14 03:58:27,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:27,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878877564] [2024-10-14 03:58:27,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878877564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:27,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:27,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:27,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407724956] [2024-10-14 03:58:27,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:27,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:58:27,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:27,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:58:27,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:58:27,374 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-14 03:58:27,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:27,966 INFO L93 Difference]: Finished difference Result 645 states and 815 transitions. [2024-10-14 03:58:27,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:58:27,967 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-14 03:58:27,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:27,968 INFO L225 Difference]: With dead ends: 645 [2024-10-14 03:58:27,969 INFO L226 Difference]: Without dead ends: 580 [2024-10-14 03:58:27,969 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-14 03:58:27,970 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.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:27,970 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.5s Time] [2024-10-14 03:58:27,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-10-14 03:58:27,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 392. [2024-10-14 03:58:27,976 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-14 03:58:27,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 487 transitions. [2024-10-14 03:58:27,978 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 487 transitions. Word has length 80 [2024-10-14 03:58:27,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:27,978 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 487 transitions. [2024-10-14 03:58:27,978 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-14 03:58:27,978 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 487 transitions. [2024-10-14 03:58:27,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 03:58:27,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:27,980 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-14 03:58:27,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 03:58:27,980 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-14 03:58:27,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:27,981 INFO L85 PathProgramCache]: Analyzing trace with hash -144938974, now seen corresponding path program 1 times [2024-10-14 03:58:27,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:27,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442764321] [2024-10-14 03:58:27,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:27,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:28,221 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-14 03:58:28,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:28,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442764321] [2024-10-14 03:58:28,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442764321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:28,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:28,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:28,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72724091] [2024-10-14 03:58:28,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:28,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:58:28,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:28,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:58:28,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:58:28,223 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-14 03:58:28,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:28,768 INFO L93 Difference]: Finished difference Result 678 states and 858 transitions. [2024-10-14 03:58:28,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:58:28,768 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-14 03:58:28,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:28,770 INFO L225 Difference]: With dead ends: 678 [2024-10-14 03:58:28,770 INFO L226 Difference]: Without dead ends: 596 [2024-10-14 03:58:28,770 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-14 03:58:28,771 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.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:28,771 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.4s Time] [2024-10-14 03:58:28,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2024-10-14 03:58:28,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 392. [2024-10-14 03:58:28,776 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-14 03:58:28,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 486 transitions. [2024-10-14 03:58:28,777 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 486 transitions. Word has length 80 [2024-10-14 03:58:28,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:28,777 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 486 transitions. [2024-10-14 03:58:28,777 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-14 03:58:28,777 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 486 transitions. [2024-10-14 03:58:28,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 03:58:28,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:28,778 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-14 03:58:28,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 03:58:28,778 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-14 03:58:28,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:28,779 INFO L85 PathProgramCache]: Analyzing trace with hash -2057136076, now seen corresponding path program 1 times [2024-10-14 03:58:28,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:28,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390804842] [2024-10-14 03:58:28,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:28,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:29,022 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-14 03:58:29,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:29,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390804842] [2024-10-14 03:58:29,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390804842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:29,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:29,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:29,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867427585] [2024-10-14 03:58:29,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:29,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:58:29,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:29,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:58:29,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:58:29,024 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-14 03:58:29,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:29,592 INFO L93 Difference]: Finished difference Result 650 states and 818 transitions. [2024-10-14 03:58:29,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:58:29,593 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-14 03:58:29,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:29,594 INFO L225 Difference]: With dead ends: 650 [2024-10-14 03:58:29,594 INFO L226 Difference]: Without dead ends: 580 [2024-10-14 03:58:29,595 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-14 03:58:29,595 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-14 03:58:29,595 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-14 03:58:29,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-10-14 03:58:29,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 392. [2024-10-14 03:58:29,600 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-14 03:58:29,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 485 transitions. [2024-10-14 03:58:29,600 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 485 transitions. Word has length 80 [2024-10-14 03:58:29,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:29,601 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 485 transitions. [2024-10-14 03:58:29,601 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-14 03:58:29,601 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 485 transitions. [2024-10-14 03:58:29,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 03:58:29,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:29,602 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-14 03:58:29,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-14 03:58:29,602 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-14 03:58:29,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:29,602 INFO L85 PathProgramCache]: Analyzing trace with hash -2041843904, now seen corresponding path program 1 times [2024-10-14 03:58:29,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:29,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098426028] [2024-10-14 03:58:29,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:29,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:30,038 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-14 03:58:30,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:30,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098426028] [2024-10-14 03:58:30,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098426028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:30,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:30,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 03:58:30,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889119943] [2024-10-14 03:58:30,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:30,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 03:58:30,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:30,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 03:58:30,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:58:30,040 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-14 03:58:30,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:30,976 INFO L93 Difference]: Finished difference Result 957 states and 1259 transitions. [2024-10-14 03:58:30,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 03:58:30,977 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-14 03:58:30,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:30,979 INFO L225 Difference]: With dead ends: 957 [2024-10-14 03:58:30,979 INFO L226 Difference]: Without dead ends: 852 [2024-10-14 03:58:30,980 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-14 03:58:30,980 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-14 03:58:30,980 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-14 03:58:30,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2024-10-14 03:58:30,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 396. [2024-10-14 03:58:30,986 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-14 03:58:30,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 489 transitions. [2024-10-14 03:58:30,987 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 489 transitions. Word has length 80 [2024-10-14 03:58:30,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:30,988 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 489 transitions. [2024-10-14 03:58:30,988 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-14 03:58:30,988 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 489 transitions. [2024-10-14 03:58:30,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 03:58:30,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:30,989 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-14 03:58:30,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-14 03:58:30,989 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-14 03:58:30,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:30,989 INFO L85 PathProgramCache]: Analyzing trace with hash -898261756, now seen corresponding path program 1 times [2024-10-14 03:58:30,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:30,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538566109] [2024-10-14 03:58:30,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:30,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:31,376 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-14 03:58:31,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:31,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538566109] [2024-10-14 03:58:31,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538566109] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:31,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:31,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 03:58:31,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381302742] [2024-10-14 03:58:31,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:31,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 03:58:31,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:31,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 03:58:31,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:58:31,378 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-14 03:58:32,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:32,257 INFO L93 Difference]: Finished difference Result 825 states and 1064 transitions. [2024-10-14 03:58:32,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 03:58:32,257 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-14 03:58:32,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:32,259 INFO L225 Difference]: With dead ends: 825 [2024-10-14 03:58:32,260 INFO L226 Difference]: Without dead ends: 808 [2024-10-14 03:58:32,260 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-14 03:58:32,261 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 3983 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:32,261 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.6s Time] [2024-10-14 03:58:32,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2024-10-14 03:58:32,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 400. [2024-10-14 03:58:32,267 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-14 03:58:32,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 493 transitions. [2024-10-14 03:58:32,268 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 493 transitions. Word has length 80 [2024-10-14 03:58:32,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:32,268 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 493 transitions. [2024-10-14 03:58:32,268 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-14 03:58:32,268 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 493 transitions. [2024-10-14 03:58:32,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 03:58:32,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:32,269 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-14 03:58:32,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-14 03:58:32,269 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-14 03:58:32,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:32,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1995378919, now seen corresponding path program 1 times [2024-10-14 03:58:32,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:32,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512207890] [2024-10-14 03:58:32,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:32,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:32,510 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-14 03:58:32,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:32,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512207890] [2024-10-14 03:58:32,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512207890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:32,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:32,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:32,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895437117] [2024-10-14 03:58:32,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:32,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:58:32,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:32,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:58:32,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:58:32,511 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-14 03:58:33,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:33,068 INFO L93 Difference]: Finished difference Result 655 states and 822 transitions. [2024-10-14 03:58:33,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:58:33,068 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-14 03:58:33,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:33,070 INFO L225 Difference]: With dead ends: 655 [2024-10-14 03:58:33,070 INFO L226 Difference]: Without dead ends: 588 [2024-10-14 03:58:33,070 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-14 03:58:33,071 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-14 03:58:33,071 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-14 03:58:33,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-10-14 03:58:33,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 400. [2024-10-14 03:58:33,076 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-14 03:58:33,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 492 transitions. [2024-10-14 03:58:33,077 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 492 transitions. Word has length 80 [2024-10-14 03:58:33,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:33,077 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 492 transitions. [2024-10-14 03:58:33,077 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-14 03:58:33,077 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 492 transitions. [2024-10-14 03:58:33,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 03:58:33,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:33,078 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-14 03:58:33,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-14 03:58:33,078 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-14 03:58:33,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:33,079 INFO L85 PathProgramCache]: Analyzing trace with hash 729371863, now seen corresponding path program 1 times [2024-10-14 03:58:33,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:33,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315422480] [2024-10-14 03:58:33,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:33,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:33,448 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-14 03:58:33,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:33,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315422480] [2024-10-14 03:58:33,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315422480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:33,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:33,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 03:58:33,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620609809] [2024-10-14 03:58:33,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:33,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 03:58:33,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:33,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 03:58:33,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:58:33,451 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-14 03:58:34,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:34,323 INFO L93 Difference]: Finished difference Result 761 states and 968 transitions. [2024-10-14 03:58:34,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 03:58:34,323 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-14 03:58:34,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:34,326 INFO L225 Difference]: With dead ends: 761 [2024-10-14 03:58:34,326 INFO L226 Difference]: Without dead ends: 756 [2024-10-14 03:58:34,326 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-14 03:58:34,327 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-14 03:58:34,327 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-14 03:58:34,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2024-10-14 03:58:34,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 404. [2024-10-14 03:58:34,334 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-14 03:58:34,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 496 transitions. [2024-10-14 03:58:34,334 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 496 transitions. Word has length 80 [2024-10-14 03:58:34,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:34,335 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 496 transitions. [2024-10-14 03:58:34,335 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-14 03:58:34,335 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 496 transitions. [2024-10-14 03:58:34,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 03:58:34,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:34,336 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-14 03:58:34,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-14 03:58:34,336 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-14 03:58:34,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:34,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1069510264, now seen corresponding path program 1 times [2024-10-14 03:58:34,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:34,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126811660] [2024-10-14 03:58:34,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:34,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:34,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-14 03:58:34,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:34,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126811660] [2024-10-14 03:58:34,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126811660] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:34,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:34,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:34,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378025864] [2024-10-14 03:58:34,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:34,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:58:34,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:34,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:58:34,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:58:34,544 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-14 03:58:35,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:35,170 INFO L93 Difference]: Finished difference Result 717 states and 905 transitions. [2024-10-14 03:58:35,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:58:35,170 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-14 03:58:35,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:35,172 INFO L225 Difference]: With dead ends: 717 [2024-10-14 03:58:35,172 INFO L226 Difference]: Without dead ends: 612 [2024-10-14 03:58:35,172 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-14 03:58:35,172 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-14 03:58:35,173 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-14 03:58:35,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-10-14 03:58:35,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 400. [2024-10-14 03:58:35,178 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-14 03:58:35,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 491 transitions. [2024-10-14 03:58:35,179 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 491 transitions. Word has length 81 [2024-10-14 03:58:35,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:35,180 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 491 transitions. [2024-10-14 03:58:35,180 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-14 03:58:35,180 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 491 transitions. [2024-10-14 03:58:35,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 03:58:35,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:35,181 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-14 03:58:35,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-14 03:58:35,181 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-14 03:58:35,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:35,182 INFO L85 PathProgramCache]: Analyzing trace with hash 869523368, now seen corresponding path program 1 times [2024-10-14 03:58:35,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:35,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846608566] [2024-10-14 03:58:35,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:35,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:35,379 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-14 03:58:35,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:35,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846608566] [2024-10-14 03:58:35,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846608566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:35,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:35,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:35,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192762809] [2024-10-14 03:58:35,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:35,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:58:35,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:35,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:58:35,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:58:35,382 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-14 03:58:35,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:35,941 INFO L93 Difference]: Finished difference Result 589 states and 722 transitions. [2024-10-14 03:58:35,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:58:35,942 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-14 03:58:35,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:35,943 INFO L225 Difference]: With dead ends: 589 [2024-10-14 03:58:35,943 INFO L226 Difference]: Without dead ends: 584 [2024-10-14 03:58:35,944 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-14 03:58:35,944 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-14 03:58:35,944 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-14 03:58:35,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2024-10-14 03:58:35,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 396. [2024-10-14 03:58:35,948 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-14 03:58:35,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 486 transitions. [2024-10-14 03:58:35,949 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 486 transitions. Word has length 81 [2024-10-14 03:58:35,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:35,949 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 486 transitions. [2024-10-14 03:58:35,949 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-14 03:58:35,949 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 486 transitions. [2024-10-14 03:58:35,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 03:58:35,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:35,950 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-14 03:58:35,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-14 03:58:35,950 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-14 03:58:35,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:35,950 INFO L85 PathProgramCache]: Analyzing trace with hash -29974665, now seen corresponding path program 1 times [2024-10-14 03:58:35,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:35,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544197859] [2024-10-14 03:58:35,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:35,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:35,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:36,112 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-14 03:58:36,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:36,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544197859] [2024-10-14 03:58:36,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544197859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:36,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:36,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:36,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479096287] [2024-10-14 03:58:36,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:36,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:58:36,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:36,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:58:36,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:58:36,114 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-14 03:58:36,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:36,669 INFO L93 Difference]: Finished difference Result 613 states and 756 transitions. [2024-10-14 03:58:36,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:58:36,669 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-14 03:58:36,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:36,671 INFO L225 Difference]: With dead ends: 613 [2024-10-14 03:58:36,671 INFO L226 Difference]: Without dead ends: 596 [2024-10-14 03:58:36,671 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-14 03:58:36,672 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-14 03:58:36,672 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-14 03:58:36,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2024-10-14 03:58:36,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 392. [2024-10-14 03:58:36,677 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-14 03:58:36,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 481 transitions. [2024-10-14 03:58:36,678 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 481 transitions. Word has length 81 [2024-10-14 03:58:36,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:36,679 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 481 transitions. [2024-10-14 03:58:36,679 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-14 03:58:36,679 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 481 transitions. [2024-10-14 03:58:36,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 03:58:36,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:36,680 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-14 03:58:36,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-14 03:58:36,680 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-14 03:58:36,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:36,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1274155887, now seen corresponding path program 1 times [2024-10-14 03:58:36,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:36,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873294965] [2024-10-14 03:58:36,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:36,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:37,172 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-14 03:58:37,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:37,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873294965] [2024-10-14 03:58:37,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873294965] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:37,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:37,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 03:58:37,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411152925] [2024-10-14 03:58:37,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:37,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 03:58:37,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:37,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 03:58:37,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:58:37,174 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-14 03:58:37,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:37,629 INFO L93 Difference]: Finished difference Result 905 states and 1132 transitions. [2024-10-14 03:58:37,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:58:37,629 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-14 03:58:37,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:37,631 INFO L225 Difference]: With dead ends: 905 [2024-10-14 03:58:37,631 INFO L226 Difference]: Without dead ends: 722 [2024-10-14 03:58:37,631 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-14 03:58:37,632 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-14 03:58:37,632 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-14 03:58:37,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2024-10-14 03:58:37,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 274. [2024-10-14 03:58:37,635 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-14 03:58:37,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 333 transitions. [2024-10-14 03:58:37,636 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 333 transitions. Word has length 82 [2024-10-14 03:58:37,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:37,636 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 333 transitions. [2024-10-14 03:58:37,636 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-14 03:58:37,636 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 333 transitions. [2024-10-14 03:58:37,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 03:58:37,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:37,637 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:58:37,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-14 03:58:37,638 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-14 03:58:37,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:37,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1213653297, now seen corresponding path program 1 times [2024-10-14 03:58:37,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:37,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015987540] [2024-10-14 03:58:37,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:37,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:38,125 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-14 03:58:38,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:38,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015987540] [2024-10-14 03:58:38,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015987540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:38,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:38,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 03:58:38,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529478807] [2024-10-14 03:58:38,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:38,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 03:58:38,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:38,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 03:58:38,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:58:38,126 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-14 03:58:38,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:38,657 INFO L93 Difference]: Finished difference Result 451 states and 579 transitions. [2024-10-14 03:58:38,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:58:38,658 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-14 03:58:38,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:38,659 INFO L225 Difference]: With dead ends: 451 [2024-10-14 03:58:38,659 INFO L226 Difference]: Without dead ends: 353 [2024-10-14 03:58:38,659 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-14 03:58:38,659 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-14 03:58:38,660 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-14 03:58:38,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-10-14 03:58:38,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 241. [2024-10-14 03:58:38,662 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-14 03:58:38,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 293 transitions. [2024-10-14 03:58:38,663 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 293 transitions. Word has length 82 [2024-10-14 03:58:38,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:38,663 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 293 transitions. [2024-10-14 03:58:38,663 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-14 03:58:38,663 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 293 transitions. [2024-10-14 03:58:38,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 03:58:38,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:38,664 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-14 03:58:38,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-14 03:58:38,664 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-14 03:58:38,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:38,665 INFO L85 PathProgramCache]: Analyzing trace with hash -910264626, now seen corresponding path program 1 times [2024-10-14 03:58:38,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:38,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945059652] [2024-10-14 03:58:38,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:38,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:39,141 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-14 03:58:39,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:39,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945059652] [2024-10-14 03:58:39,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945059652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:39,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:39,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 03:58:39,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828287352] [2024-10-14 03:58:39,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:39,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 03:58:39,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:39,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 03:58:39,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:58:39,143 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-14 03:58:39,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:39,731 INFO L93 Difference]: Finished difference Result 421 states and 537 transitions. [2024-10-14 03:58:39,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:58:39,732 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-14 03:58:39,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:39,733 INFO L225 Difference]: With dead ends: 421 [2024-10-14 03:58:39,733 INFO L226 Difference]: Without dead ends: 352 [2024-10-14 03:58:39,733 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-14 03:58:39,734 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.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:39,734 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.3s Time] [2024-10-14 03:58:39,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-10-14 03:58:39,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 237. [2024-10-14 03:58:39,736 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-14 03:58:39,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 288 transitions. [2024-10-14 03:58:39,737 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 288 transitions. Word has length 82 [2024-10-14 03:58:39,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:39,737 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 288 transitions. [2024-10-14 03:58:39,737 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-14 03:58:39,737 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 288 transitions. [2024-10-14 03:58:39,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 03:58:39,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:39,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, 1, 1] [2024-10-14 03:58:39,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-14 03:58:39,739 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-14 03:58:39,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:39,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1175029773, now seen corresponding path program 1 times [2024-10-14 03:58:39,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:39,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795523997] [2024-10-14 03:58:39,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:39,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:40,279 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-14 03:58:40,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:40,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795523997] [2024-10-14 03:58:40,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795523997] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:40,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:40,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 03:58:40,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40911409] [2024-10-14 03:58:40,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:40,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 03:58:40,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:40,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 03:58:40,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:58:40,281 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-14 03:58:40,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:40,921 INFO L93 Difference]: Finished difference Result 632 states and 826 transitions. [2024-10-14 03:58:40,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:58:40,921 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-14 03:58:40,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:40,923 INFO L225 Difference]: With dead ends: 632 [2024-10-14 03:58:40,923 INFO L226 Difference]: Without dead ends: 504 [2024-10-14 03:58:40,923 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-14 03:58:40,924 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-14 03:58:40,924 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-14 03:58:40,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2024-10-14 03:58:40,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 174. [2024-10-14 03:58:40,927 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-14 03:58:40,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 213 transitions. [2024-10-14 03:58:40,928 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 213 transitions. Word has length 82 [2024-10-14 03:58:40,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:40,928 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 213 transitions. [2024-10-14 03:58:40,928 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-14 03:58:40,929 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 213 transitions. [2024-10-14 03:58:40,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-14 03:58:40,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:40,929 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-14 03:58:40,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-14 03:58:40,930 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-14 03:58:40,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:40,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1732888836, now seen corresponding path program 1 times [2024-10-14 03:58:40,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:40,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259845880] [2024-10-14 03:58:40,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:40,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:41,145 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-14 03:58:41,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:41,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259845880] [2024-10-14 03:58:41,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259845880] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:41,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:41,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:41,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914421599] [2024-10-14 03:58:41,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:41,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:58:41,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:41,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:58:41,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:58:41,146 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-14 03:58:41,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:41,414 INFO L93 Difference]: Finished difference Result 267 states and 337 transitions. [2024-10-14 03:58:41,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:58:41,415 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-14 03:58:41,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:41,415 INFO L225 Difference]: With dead ends: 267 [2024-10-14 03:58:41,415 INFO L226 Difference]: Without dead ends: 260 [2024-10-14 03:58:41,416 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-14 03:58:41,416 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-14 03:58:41,416 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-14 03:58:41,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-10-14 03:58:41,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 174. [2024-10-14 03:58:41,419 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-14 03:58:41,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 212 transitions. [2024-10-14 03:58:41,419 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 212 transitions. Word has length 83 [2024-10-14 03:58:41,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:41,420 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 212 transitions. [2024-10-14 03:58:41,420 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-14 03:58:41,420 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 212 transitions. [2024-10-14 03:58:41,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-14 03:58:41,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:41,421 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-14 03:58:41,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-14 03:58:41,421 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-14 03:58:41,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:41,422 INFO L85 PathProgramCache]: Analyzing trace with hash 956701402, now seen corresponding path program 1 times [2024-10-14 03:58:41,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:41,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475152881] [2024-10-14 03:58:41,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:41,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:41,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:41,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-14 03:58:41,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:41,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475152881] [2024-10-14 03:58:41,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475152881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:41,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:41,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:41,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153086362] [2024-10-14 03:58:41,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:41,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:58:41,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:41,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:58:41,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:58:41,648 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-14 03:58:42,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:42,026 INFO L93 Difference]: Finished difference Result 361 states and 466 transitions. [2024-10-14 03:58:42,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:58:42,026 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-14 03:58:42,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:42,027 INFO L225 Difference]: With dead ends: 361 [2024-10-14 03:58:42,027 INFO L226 Difference]: Without dead ends: 278 [2024-10-14 03:58:42,028 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-14 03:58:42,028 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.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:42,028 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.3s Time] [2024-10-14 03:58:42,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-10-14 03:58:42,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 174. [2024-10-14 03:58:42,031 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-14 03:58:42,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 211 transitions. [2024-10-14 03:58:42,031 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 211 transitions. Word has length 83 [2024-10-14 03:58:42,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:42,032 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 211 transitions. [2024-10-14 03:58:42,032 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-14 03:58:42,032 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 211 transitions. [2024-10-14 03:58:42,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 03:58:42,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:42,032 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:58:42,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-14 03:58:42,033 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-14 03:58:42,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:42,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1737767892, now seen corresponding path program 1 times [2024-10-14 03:58:42,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:42,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369170214] [2024-10-14 03:58:42,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:42,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:43,190 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-14 03:58:43,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:43,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369170214] [2024-10-14 03:58:43,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369170214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:43,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:43,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2024-10-14 03:58:43,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319715993] [2024-10-14 03:58:43,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:43,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 03:58:43,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:43,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 03:58:43,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2024-10-14 03:58:43,193 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-14 03:58:46,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:46,154 INFO L93 Difference]: Finished difference Result 689 states and 895 transitions. [2024-10-14 03:58:46,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-14 03:58:46,155 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-14 03:58:46,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:46,156 INFO L225 Difference]: With dead ends: 689 [2024-10-14 03:58:46,156 INFO L226 Difference]: Without dead ends: 681 [2024-10-14 03:58:46,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=314, Invalid=1848, Unknown=0, NotChecked=0, Total=2162 [2024-10-14 03:58:46,157 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.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:46,157 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.1s Time] [2024-10-14 03:58:46,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2024-10-14 03:58:46,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 193. [2024-10-14 03:58:46,160 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-14 03:58:46,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 234 transitions. [2024-10-14 03:58:46,161 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 234 transitions. Word has length 85 [2024-10-14 03:58:46,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:46,161 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 234 transitions. [2024-10-14 03:58:46,165 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-14 03:58:46,165 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 234 transitions. [2024-10-14 03:58:46,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 03:58:46,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:46,166 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-14 03:58:46,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-14 03:58:46,166 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-14 03:58:46,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:46,166 INFO L85 PathProgramCache]: Analyzing trace with hash 2073632219, now seen corresponding path program 1 times [2024-10-14 03:58:46,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:46,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935246412] [2024-10-14 03:58:46,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:46,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:46,627 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-14 03:58:46,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:46,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935246412] [2024-10-14 03:58:46,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935246412] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:46,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:46,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 03:58:46,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434874127] [2024-10-14 03:58:46,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:46,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 03:58:46,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:46,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 03:58:46,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:58:46,629 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-14 03:58:47,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:47,148 INFO L93 Difference]: Finished difference Result 271 states and 345 transitions. [2024-10-14 03:58:47,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:58:47,149 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-14 03:58:47,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:47,150 INFO L225 Difference]: With dead ends: 271 [2024-10-14 03:58:47,150 INFO L226 Difference]: Without dead ends: 265 [2024-10-14 03:58:47,150 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-14 03:58:47,150 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-14 03:58:47,150 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-14 03:58:47,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-14 03:58:47,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 187. [2024-10-14 03:58:47,153 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-14 03:58:47,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 228 transitions. [2024-10-14 03:58:47,154 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 228 transitions. Word has length 85 [2024-10-14 03:58:47,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:47,154 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 228 transitions. [2024-10-14 03:58:47,154 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-14 03:58:47,154 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 228 transitions. [2024-10-14 03:58:47,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 03:58:47,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:47,155 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-14 03:58:47,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-14 03:58:47,155 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-14 03:58:47,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:47,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1205220568, now seen corresponding path program 1 times [2024-10-14 03:58:47,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:47,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447703672] [2024-10-14 03:58:47,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:47,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:47,693 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-14 03:58:47,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:47,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447703672] [2024-10-14 03:58:47,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447703672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:47,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:47,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 03:58:47,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290773228] [2024-10-14 03:58:47,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:47,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 03:58:47,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:47,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 03:58:47,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:58:47,696 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-14 03:58:48,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:48,424 INFO L93 Difference]: Finished difference Result 427 states and 566 transitions. [2024-10-14 03:58:48,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:58:48,424 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-14 03:58:48,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:48,425 INFO L225 Difference]: With dead ends: 427 [2024-10-14 03:58:48,426 INFO L226 Difference]: Without dead ends: 412 [2024-10-14 03:58:48,426 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-14 03:58:48,426 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-14 03:58:48,427 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-14 03:58:48,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-10-14 03:58:48,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 156. [2024-10-14 03:58:48,429 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-14 03:58:48,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 192 transitions. [2024-10-14 03:58:48,430 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 192 transitions. Word has length 86 [2024-10-14 03:58:48,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:48,430 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 192 transitions. [2024-10-14 03:58:48,430 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-14 03:58:48,430 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 192 transitions. [2024-10-14 03:58:48,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-14 03:58:48,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:48,431 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-14 03:58:48,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-14 03:58:48,431 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-14 03:58:48,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:48,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1814457043, now seen corresponding path program 1 times [2024-10-14 03:58:48,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:48,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774362894] [2024-10-14 03:58:48,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:48,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:48,573 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-14 03:58:48,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:48,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774362894] [2024-10-14 03:58:48,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774362894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:48,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:48,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:48,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541048089] [2024-10-14 03:58:48,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:48,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:58:48,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:48,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:58:48,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:58:48,576 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-14 03:58:48,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:48,753 INFO L93 Difference]: Finished difference Result 806 states and 1142 transitions. [2024-10-14 03:58:48,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:58:48,754 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-14 03:58:48,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:48,756 INFO L225 Difference]: With dead ends: 806 [2024-10-14 03:58:48,758 INFO L226 Difference]: Without dead ends: 741 [2024-10-14 03:58:48,758 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-14 03:58:48,759 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-14 03:58:48,759 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-14 03:58:48,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2024-10-14 03:58:48,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 219. [2024-10-14 03:58:48,765 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-14 03:58:48,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 284 transitions. [2024-10-14 03:58:48,766 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 284 transitions. Word has length 113 [2024-10-14 03:58:48,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:48,766 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 284 transitions. [2024-10-14 03:58:48,766 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-14 03:58:48,766 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 284 transitions. [2024-10-14 03:58:48,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 03:58:48,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:48,767 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-14 03:58:48,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-10-14 03:58:48,768 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-14 03:58:48,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:48,768 INFO L85 PathProgramCache]: Analyzing trace with hash -905960125, now seen corresponding path program 1 times [2024-10-14 03:58:48,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:48,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114997350] [2024-10-14 03:58:48,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:48,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:48,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:48,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:48,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114997350] [2024-10-14 03:58:48,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114997350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:48,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:48,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:48,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585107853] [2024-10-14 03:58:48,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:48,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:58:48,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:48,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:58:48,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:58:48,932 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-14 03:58:49,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:49,047 INFO L93 Difference]: Finished difference Result 924 states and 1312 transitions. [2024-10-14 03:58:49,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:58:49,048 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-14 03:58:49,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:49,050 INFO L225 Difference]: With dead ends: 924 [2024-10-14 03:58:49,050 INFO L226 Difference]: Without dead ends: 796 [2024-10-14 03:58:49,050 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-14 03:58:49,051 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-14 03:58:49,051 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-14 03:58:49,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2024-10-14 03:58:49,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 345. [2024-10-14 03:58:49,060 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-14 03:58:49,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 469 transitions. [2024-10-14 03:58:49,061 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 469 transitions. Word has length 115 [2024-10-14 03:58:49,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:49,061 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 469 transitions. [2024-10-14 03:58:49,061 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-14 03:58:49,062 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 469 transitions. [2024-10-14 03:58:49,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 03:58:49,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:49,062 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-14 03:58:49,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-10-14 03:58:49,063 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-14 03:58:49,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:49,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1541513731, now seen corresponding path program 1 times [2024-10-14 03:58:49,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:49,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118637547] [2024-10-14 03:58:49,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:49,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:49,202 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-14 03:58:49,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:49,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118637547] [2024-10-14 03:58:49,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118637547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:49,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:49,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:49,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382554918] [2024-10-14 03:58:49,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:49,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:58:49,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:49,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:58:49,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:58:49,204 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-14 03:58:49,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:49,327 INFO L93 Difference]: Finished difference Result 1050 states and 1497 transitions. [2024-10-14 03:58:49,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:58:49,327 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-14 03:58:49,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:49,330 INFO L225 Difference]: With dead ends: 1050 [2024-10-14 03:58:49,330 INFO L226 Difference]: Without dead ends: 922 [2024-10-14 03:58:49,331 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-14 03:58:49,331 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-14 03:58:49,332 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-14 03:58:49,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-10-14 03:58:49,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 534. [2024-10-14 03:58:49,340 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-14 03:58:49,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 746 transitions. [2024-10-14 03:58:49,341 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 746 transitions. Word has length 115 [2024-10-14 03:58:49,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:49,342 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 746 transitions. [2024-10-14 03:58:49,342 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-14 03:58:49,342 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 746 transitions. [2024-10-14 03:58:49,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 03:58:49,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:49,343 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-14 03:58:49,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-10-14 03:58:49,344 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-14 03:58:49,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:49,345 INFO L85 PathProgramCache]: Analyzing trace with hash 416762097, now seen corresponding path program 1 times [2024-10-14 03:58:49,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:49,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955337626] [2024-10-14 03:58:49,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:49,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:49,455 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-14 03:58:49,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:49,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955337626] [2024-10-14 03:58:49,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955337626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:49,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:49,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:49,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618776141] [2024-10-14 03:58:49,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:49,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:58:49,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:49,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:58:49,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:58:49,457 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-14 03:58:49,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:49,545 INFO L93 Difference]: Finished difference Result 1176 states and 1682 transitions. [2024-10-14 03:58:49,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:58:49,546 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-14 03:58:49,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:49,549 INFO L225 Difference]: With dead ends: 1176 [2024-10-14 03:58:49,549 INFO L226 Difference]: Without dead ends: 1048 [2024-10-14 03:58:49,549 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-14 03:58:49,550 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-14 03:58:49,551 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-14 03:58:49,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2024-10-14 03:58:49,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 660. [2024-10-14 03:58:49,562 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-14 03:58:49,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 931 transitions. [2024-10-14 03:58:49,563 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 931 transitions. Word has length 115 [2024-10-14 03:58:49,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:49,563 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 931 transitions. [2024-10-14 03:58:49,563 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-14 03:58:49,564 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 931 transitions. [2024-10-14 03:58:49,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 03:58:49,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:49,565 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-14 03:58:49,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-10-14 03:58:49,565 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-14 03:58:49,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:49,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1355182732, now seen corresponding path program 1 times [2024-10-14 03:58:49,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:49,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155568307] [2024-10-14 03:58:49,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:49,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:49,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:49,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:49,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155568307] [2024-10-14 03:58:49,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155568307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:49,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:49,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:49,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716696741] [2024-10-14 03:58:49,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:49,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:58:49,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:49,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:58:49,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:58:49,765 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-14 03:58:49,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:49,878 INFO L93 Difference]: Finished difference Result 1231 states and 1766 transitions. [2024-10-14 03:58:49,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:58:49,879 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-14 03:58:49,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:49,881 INFO L225 Difference]: With dead ends: 1231 [2024-10-14 03:58:49,881 INFO L226 Difference]: Without dead ends: 662 [2024-10-14 03:58:49,882 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-14 03:58:49,882 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.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:49,882 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.0s Time] [2024-10-14 03:58:49,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2024-10-14 03:58:49,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 660. [2024-10-14 03:58:49,889 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-14 03:58:49,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 926 transitions. [2024-10-14 03:58:49,891 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 926 transitions. Word has length 115 [2024-10-14 03:58:49,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:49,891 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 926 transitions. [2024-10-14 03:58:49,891 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-14 03:58:49,891 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 926 transitions. [2024-10-14 03:58:49,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 03:58:49,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:49,894 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-14 03:58:49,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-10-14 03:58:49,895 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-14 03:58:49,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:49,895 INFO L85 PathProgramCache]: Analyzing trace with hash -2124475725, now seen corresponding path program 1 times [2024-10-14 03:58:49,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:49,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704550261] [2024-10-14 03:58:49,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:49,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:49,953 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-14 03:58:49,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:49,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704550261] [2024-10-14 03:58:49,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704550261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:49,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:49,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:58:49,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816142483] [2024-10-14 03:58:49,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:49,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:58:49,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:49,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:58:49,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:58:49,955 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-14 03:58:49,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:49,979 INFO L93 Difference]: Finished difference Result 1740 states and 2487 transitions. [2024-10-14 03:58:49,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:58:49,979 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-14 03:58:49,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:49,981 INFO L225 Difference]: With dead ends: 1740 [2024-10-14 03:58:49,981 INFO L226 Difference]: Without dead ends: 1171 [2024-10-14 03:58:49,982 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-14 03:58:49,983 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-14 03:58:49,983 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-14 03:58:49,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2024-10-14 03:58:50,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1169. [2024-10-14 03:58:50,008 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-14 03:58:50,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1639 transitions. [2024-10-14 03:58:50,010 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1639 transitions. Word has length 115 [2024-10-14 03:58:50,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:50,010 INFO L471 AbstractCegarLoop]: Abstraction has 1169 states and 1639 transitions. [2024-10-14 03:58:50,011 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-14 03:58:50,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1639 transitions. [2024-10-14 03:58:50,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 03:58:50,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:50,012 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-14 03:58:50,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-10-14 03:58:50,012 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-14 03:58:50,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:50,013 INFO L85 PathProgramCache]: Analyzing trace with hash -579470549, now seen corresponding path program 1 times [2024-10-14 03:58:50,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:50,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757298397] [2024-10-14 03:58:50,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:50,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:50,164 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-14 03:58:50,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:50,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757298397] [2024-10-14 03:58:50,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757298397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:50,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:50,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:50,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892689357] [2024-10-14 03:58:50,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:50,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:58:50,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:50,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:58:50,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:58:50,166 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-14 03:58:50,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:50,285 INFO L93 Difference]: Finished difference Result 2376 states and 3365 transitions. [2024-10-14 03:58:50,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:58:50,286 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-14 03:58:50,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:50,288 INFO L225 Difference]: With dead ends: 2376 [2024-10-14 03:58:50,288 INFO L226 Difference]: Without dead ends: 2135 [2024-10-14 03:58:50,289 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-14 03:58:50,290 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-14 03:58:50,291 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-14 03:58:50,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2135 states. [2024-10-14 03:58:50,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2135 to 1408. [2024-10-14 03:58:50,312 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-14 03:58:50,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 1981 transitions. [2024-10-14 03:58:50,317 INFO L78 Accepts]: Start accepts. Automaton has 1408 states and 1981 transitions. Word has length 115 [2024-10-14 03:58:50,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:50,318 INFO L471 AbstractCegarLoop]: Abstraction has 1408 states and 1981 transitions. [2024-10-14 03:58:50,318 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-14 03:58:50,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 1981 transitions. [2024-10-14 03:58:50,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 03:58:50,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:50,319 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-14 03:58:50,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-10-14 03:58:50,320 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-14 03:58:50,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:50,320 INFO L85 PathProgramCache]: Analyzing trace with hash 704311, now seen corresponding path program 1 times [2024-10-14 03:58:50,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:50,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646720622] [2024-10-14 03:58:50,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:50,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:50,453 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-14 03:58:50,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:50,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646720622] [2024-10-14 03:58:50,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646720622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:50,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:50,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:50,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168593548] [2024-10-14 03:58:50,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:50,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:58:50,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:50,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:58:50,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:58:50,455 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-14 03:58:50,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:50,562 INFO L93 Difference]: Finished difference Result 2615 states and 3707 transitions. [2024-10-14 03:58:50,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:58:50,563 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-14 03:58:50,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:50,565 INFO L225 Difference]: With dead ends: 2615 [2024-10-14 03:58:50,565 INFO L226 Difference]: Without dead ends: 2374 [2024-10-14 03:58:50,566 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-14 03:58:50,566 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-14 03:58:50,567 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-14 03:58:50,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2374 states. [2024-10-14 03:58:50,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2374 to 1647. [2024-10-14 03:58:50,590 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-14 03:58:50,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2323 transitions. [2024-10-14 03:58:50,593 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2323 transitions. Word has length 115 [2024-10-14 03:58:50,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:50,593 INFO L471 AbstractCegarLoop]: Abstraction has 1647 states and 2323 transitions. [2024-10-14 03:58:50,593 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-14 03:58:50,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2323 transitions. [2024-10-14 03:58:50,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 03:58:50,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:50,595 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-14 03:58:50,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-10-14 03:58:50,595 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-14 03:58:50,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:50,595 INFO L85 PathProgramCache]: Analyzing trace with hash 879840784, now seen corresponding path program 1 times [2024-10-14 03:58:50,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:50,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037515628] [2024-10-14 03:58:50,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:50,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:50,709 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-14 03:58:50,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:50,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037515628] [2024-10-14 03:58:50,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037515628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:50,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:50,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:58:50,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039830852] [2024-10-14 03:58:50,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:50,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:58:50,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:50,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:58:50,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:58:50,711 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-14 03:58:50,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:50,737 INFO L93 Difference]: Finished difference Result 4122 states and 5838 transitions. [2024-10-14 03:58:50,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:58:50,738 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-14 03:58:50,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:50,743 INFO L225 Difference]: With dead ends: 4122 [2024-10-14 03:58:50,743 INFO L226 Difference]: Without dead ends: 2566 [2024-10-14 03:58:50,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:58:50,747 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-14 03:58:50,747 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-14 03:58:50,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2024-10-14 03:58:50,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2460. [2024-10-14 03:58:50,771 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-14 03:58:50,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2460 states to 2460 states and 3455 transitions. [2024-10-14 03:58:50,774 INFO L78 Accepts]: Start accepts. Automaton has 2460 states and 3455 transitions. Word has length 116 [2024-10-14 03:58:50,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:50,774 INFO L471 AbstractCegarLoop]: Abstraction has 2460 states and 3455 transitions. [2024-10-14 03:58:50,775 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-14 03:58:50,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2460 states and 3455 transitions. [2024-10-14 03:58:50,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-14 03:58:50,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:50,776 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-14 03:58:50,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-10-14 03:58:50,776 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-14 03:58:50,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:50,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1646779703, now seen corresponding path program 1 times [2024-10-14 03:58:50,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:50,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365080187] [2024-10-14 03:58:50,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:50,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:50,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:50,882 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-14 03:58:50,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:50,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365080187] [2024-10-14 03:58:50,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365080187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:50,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:50,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:58:50,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699931126] [2024-10-14 03:58:50,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:50,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:58:50,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:50,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:58:50,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:58:50,884 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-14 03:58:50,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:50,912 INFO L93 Difference]: Finished difference Result 7042 states and 9898 transitions. [2024-10-14 03:58:50,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:58:50,913 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-14 03:58:50,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:50,919 INFO L225 Difference]: With dead ends: 7042 [2024-10-14 03:58:50,920 INFO L226 Difference]: Without dead ends: 4673 [2024-10-14 03:58:50,923 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-14 03:58:50,925 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-14 03:58:50,925 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-14 03:58:50,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4673 states. [2024-10-14 03:58:50,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4673 to 4515. [2024-10-14 03:58:50,991 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-14 03:58:50,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4515 states to 4515 states and 6305 transitions. [2024-10-14 03:58:50,996 INFO L78 Accepts]: Start accepts. Automaton has 4515 states and 6305 transitions. Word has length 117 [2024-10-14 03:58:50,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:50,997 INFO L471 AbstractCegarLoop]: Abstraction has 4515 states and 6305 transitions. [2024-10-14 03:58:50,997 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-14 03:58:50,997 INFO L276 IsEmpty]: Start isEmpty. Operand 4515 states and 6305 transitions. [2024-10-14 03:58:50,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-14 03:58:50,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:50,998 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-14 03:58:50,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-10-14 03:58:50,998 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-14 03:58:50,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:50,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1685712589, now seen corresponding path program 1 times [2024-10-14 03:58:50,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:50,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163873664] [2024-10-14 03:58:50,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:50,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:51,094 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-14 03:58:51,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:51,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163873664] [2024-10-14 03:58:51,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163873664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:51,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:51,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:58:51,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049391346] [2024-10-14 03:58:51,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:51,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:58:51,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:51,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:58:51,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:58:51,097 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-14 03:58:51,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:51,135 INFO L93 Difference]: Finished difference Result 13051 states and 18175 transitions. [2024-10-14 03:58:51,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:58:51,136 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-14 03:58:51,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:51,147 INFO L225 Difference]: With dead ends: 13051 [2024-10-14 03:58:51,147 INFO L226 Difference]: Without dead ends: 8627 [2024-10-14 03:58:51,153 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-14 03:58:51,154 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-14 03:58:51,154 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-14 03:58:51,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8627 states. [2024-10-14 03:58:51,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8627 to 8313. [2024-10-14 03:58:51,240 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-14 03:58:51,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8313 states to 8313 states and 11498 transitions. [2024-10-14 03:58:51,253 INFO L78 Accepts]: Start accepts. Automaton has 8313 states and 11498 transitions. Word has length 118 [2024-10-14 03:58:51,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:51,253 INFO L471 AbstractCegarLoop]: Abstraction has 8313 states and 11498 transitions. [2024-10-14 03:58:51,253 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-14 03:58:51,253 INFO L276 IsEmpty]: Start isEmpty. Operand 8313 states and 11498 transitions. [2024-10-14 03:58:51,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-14 03:58:51,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:51,254 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-14 03:58:51,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-10-14 03:58:51,255 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-14 03:58:51,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:51,255 INFO L85 PathProgramCache]: Analyzing trace with hash 800829190, now seen corresponding path program 1 times [2024-10-14 03:58:51,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:51,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199996433] [2024-10-14 03:58:51,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:51,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:51,357 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-14 03:58:51,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:51,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199996433] [2024-10-14 03:58:51,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199996433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:51,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:51,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:58:51,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681278067] [2024-10-14 03:58:51,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:51,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:58:51,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:51,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:58:51,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:58:51,358 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-14 03:58:51,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:51,422 INFO L93 Difference]: Finished difference Result 24133 states and 33208 transitions. [2024-10-14 03:58:51,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:58:51,422 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-14 03:58:51,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:51,449 INFO L225 Difference]: With dead ends: 24133 [2024-10-14 03:58:51,449 INFO L226 Difference]: Without dead ends: 15911 [2024-10-14 03:58:51,462 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-14 03:58:51,463 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-14 03:58:51,463 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-14 03:58:51,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15911 states. [2024-10-14 03:58:51,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15911 to 15285. [2024-10-14 03:58:51,634 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-14 03:58:51,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15285 states to 15285 states and 20870 transitions. [2024-10-14 03:58:51,659 INFO L78 Accepts]: Start accepts. Automaton has 15285 states and 20870 transitions. Word has length 119 [2024-10-14 03:58:51,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:51,660 INFO L471 AbstractCegarLoop]: Abstraction has 15285 states and 20870 transitions. [2024-10-14 03:58:51,660 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-14 03:58:51,660 INFO L276 IsEmpty]: Start isEmpty. Operand 15285 states and 20870 transitions. [2024-10-14 03:58:51,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-14 03:58:51,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:51,661 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-14 03:58:51,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-10-14 03:58:51,663 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-14 03:58:51,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:51,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1494180370, now seen corresponding path program 1 times [2024-10-14 03:58:51,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:51,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253334928] [2024-10-14 03:58:51,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:51,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:51,815 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-14 03:58:51,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:51,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253334928] [2024-10-14 03:58:51,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253334928] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:51,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:51,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:58:51,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249314108] [2024-10-14 03:58:51,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:51,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:58:51,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:51,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:58:51,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:58:51,818 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-14 03:58:51,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:51,919 INFO L93 Difference]: Finished difference Result 44425 states and 60232 transitions. [2024-10-14 03:58:51,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:58:51,920 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-14 03:58:51,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:51,966 INFO L225 Difference]: With dead ends: 44425 [2024-10-14 03:58:51,967 INFO L226 Difference]: Without dead ends: 29231 [2024-10-14 03:58:51,996 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-14 03:58:51,997 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-14 03:58:51,997 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-14 03:58:52,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29231 states. [2024-10-14 03:58:52,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29231 to 27981. [2024-10-14 03:58:52,314 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-14 03:58:52,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27981 states to 27981 states and 37586 transitions. [2024-10-14 03:58:52,364 INFO L78 Accepts]: Start accepts. Automaton has 27981 states and 37586 transitions. Word has length 120 [2024-10-14 03:58:52,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:52,364 INFO L471 AbstractCegarLoop]: Abstraction has 27981 states and 37586 transitions. [2024-10-14 03:58:52,365 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-14 03:58:52,365 INFO L276 IsEmpty]: Start isEmpty. Operand 27981 states and 37586 transitions. [2024-10-14 03:58:52,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 03:58:52,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:52,365 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-14 03:58:52,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-10-14 03:58:52,366 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-14 03:58:52,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:52,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1337857427, now seen corresponding path program 1 times [2024-10-14 03:58:52,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:52,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846684925] [2024-10-14 03:58:52,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:52,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:52,745 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-14 03:58:52,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:52,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846684925] [2024-10-14 03:58:52,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846684925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:52,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:52,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:58:52,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097129111] [2024-10-14 03:58:52,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:52,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:58:52,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:52,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:58:52,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:58:52,748 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-14 03:58:52,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:52,861 INFO L93 Difference]: Finished difference Result 28559 states and 38355 transitions. [2024-10-14 03:58:52,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:58:52,861 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-14 03:58:52,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:52,903 INFO L225 Difference]: With dead ends: 28559 [2024-10-14 03:58:52,903 INFO L226 Difference]: Without dead ends: 28557 [2024-10-14 03:58:52,915 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-14 03:58:52,916 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:52,917 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.0s Time] [2024-10-14 03:58:52,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28557 states. [2024-10-14 03:58:53,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28557 to 28557. [2024-10-14 03:58:53,198 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-14 03:58:53,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28557 states to 28557 states and 37938 transitions. [2024-10-14 03:58:53,242 INFO L78 Accepts]: Start accepts. Automaton has 28557 states and 37938 transitions. Word has length 121 [2024-10-14 03:58:53,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:53,242 INFO L471 AbstractCegarLoop]: Abstraction has 28557 states and 37938 transitions. [2024-10-14 03:58:53,242 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-14 03:58:53,243 INFO L276 IsEmpty]: Start isEmpty. Operand 28557 states and 37938 transitions. [2024-10-14 03:58:53,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 03:58:53,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:53,243 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-14 03:58:53,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-10-14 03:58:53,244 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-14 03:58:53,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:53,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1089029553, now seen corresponding path program 1 times [2024-10-14 03:58:53,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:53,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051822724] [2024-10-14 03:58:53,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:53,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:53,301 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-14 03:58:53,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:53,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051822724] [2024-10-14 03:58:53,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051822724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:53,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:53,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:58:53,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018170966] [2024-10-14 03:58:53,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:53,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:58:53,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:53,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:58:53,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:58:53,303 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-14 03:58:53,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:53,666 INFO L93 Difference]: Finished difference Result 57777 states and 76788 transitions. [2024-10-14 03:58:53,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:58:53,667 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-14 03:58:53,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:53,706 INFO L225 Difference]: With dead ends: 57777 [2024-10-14 03:58:53,706 INFO L226 Difference]: Without dead ends: 29311 [2024-10-14 03:58:53,731 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-14 03:58:53,731 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-14 03:58:53,732 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-14 03:58:53,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29311 states. [2024-10-14 03:58:53,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29311 to 29309. [2024-10-14 03:58:54,011 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-14 03:58:54,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29309 states to 29309 states and 38514 transitions. [2024-10-14 03:58:54,048 INFO L78 Accepts]: Start accepts. Automaton has 29309 states and 38514 transitions. Word has length 121 [2024-10-14 03:58:54,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:54,048 INFO L471 AbstractCegarLoop]: Abstraction has 29309 states and 38514 transitions. [2024-10-14 03:58:54,048 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-14 03:58:54,048 INFO L276 IsEmpty]: Start isEmpty. Operand 29309 states and 38514 transitions. [2024-10-14 03:58:54,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-14 03:58:54,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:54,053 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-14 03:58:54,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-10-14 03:58:54,053 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-14 03:58:54,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:54,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1227882138, now seen corresponding path program 1 times [2024-10-14 03:58:54,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:54,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093627335] [2024-10-14 03:58:54,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:54,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:54,681 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-14 03:58:54,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:54,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093627335] [2024-10-14 03:58:54,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093627335] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:58:54,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546099763] [2024-10-14 03:58:54,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:54,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:58:54,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:58:54,684 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-14 03:58:54,685 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-14 03:58:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:55,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-14 03:58:55,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:58:55,986 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-14 03:58:55,987 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:58:57,546 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-14 03:58:57,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546099763] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:58:57,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:58:57,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2024-10-14 03:58:57,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722902526] [2024-10-14 03:58:57,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:58:57,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-14 03:58:57,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:57,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-14 03:58:57,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=766, Unknown=0, NotChecked=0, Total=870 [2024-10-14 03:58:57,550 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)