./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 fca748b1 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.dd.update-z3-fca748b-m [2024-11-19 22:54:57,464 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 22:54:57,528 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 22:54:57,534 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 22:54:57,535 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 22:54:57,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 22:54:57,564 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 22:54:57,564 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 22:54:57,565 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 22:54:57,566 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 22:54:57,566 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 22:54:57,566 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 22:54:57,567 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 22:54:57,567 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 22:54:57,568 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 22:54:57,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 22:54:57,568 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 22:54:57,568 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 22:54:57,569 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 22:54:57,569 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 22:54:57,569 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 22:54:57,571 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 22:54:57,571 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 22:54:57,571 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 22:54:57,572 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 22:54:57,572 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 22:54:57,572 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 22:54:57,572 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 22:54:57,573 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 22:54:57,573 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 22:54:57,573 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 22:54:57,573 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 22:54:57,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:54:57,574 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 22:54:57,574 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 22:54:57,575 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 22:54:57,575 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 22:54:57,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 22:54:57,575 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 22:54:57,576 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 22:54:57,576 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 22:54:57,577 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 22:54:57,577 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-11-19 22:54:57,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 22:54:57,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 22:54:57,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 22:54:57,901 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 22:54:57,901 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 22:54:57,902 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-11-19 22:54:59,244 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 22:54:59,663 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 22:54:59,664 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-11-19 22:54:59,690 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/987e174f1/d5d57f672de24194a63e61e73a550ef2/FLAGb564662bb [2024-11-19 22:54:59,710 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/987e174f1/d5d57f672de24194a63e61e73a550ef2 [2024-11-19 22:54:59,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 22:54:59,714 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 22:54:59,715 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 22:54:59,715 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 22:54:59,722 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 22:54:59,722 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:54:59" (1/1) ... [2024-11-19 22:54:59,723 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39c6dd98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:54:59, skipping insertion in model container [2024-11-19 22:54:59,723 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:54:59" (1/1) ... [2024-11-19 22:54:59,809 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 22:55:00,141 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[11561,11574] [2024-11-19 22:55:00,176 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[15618,15631] [2024-11-19 22:55:00,184 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[16839,16852] [2024-11-19 22:55:00,197 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[17545,17558] [2024-11-19 22:55:00,209 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[19131,19144] [2024-11-19 22:55:00,214 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[19837,19850] [2024-11-19 22:55:00,219 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[20908,20921] [2024-11-19 22:55:00,230 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[23398,23411] [2024-11-19 22:55:00,235 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[24107,24120] [2024-11-19 22:55:00,240 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[25144,25157] [2024-11-19 22:55:00,249 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[27082,27095] [2024-11-19 22:55:00,265 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[31116,31129] [2024-11-19 22:55:00,269 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[31825,31838] [2024-11-19 22:55:00,275 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[32899,32912] [2024-11-19 22:55:00,290 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[34874,34887] [2024-11-19 22:55:00,310 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[38255,38268] [2024-11-19 22:55:00,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:55:00,509 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 22:55:00,562 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[11561,11574] [2024-11-19 22:55:00,574 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[15618,15631] [2024-11-19 22:55:00,580 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[16839,16852] [2024-11-19 22:55:00,584 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[17545,17558] [2024-11-19 22:55:00,593 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[19131,19144] [2024-11-19 22:55:00,597 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[19837,19850] [2024-11-19 22:55:00,601 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[20908,20921] [2024-11-19 22:55:00,609 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[23398,23411] [2024-11-19 22:55:00,613 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[24107,24120] [2024-11-19 22:55:00,617 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[25144,25157] [2024-11-19 22:55:00,628 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[27082,27095] [2024-11-19 22:55:00,645 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[31116,31129] [2024-11-19 22:55:00,650 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[31825,31838] [2024-11-19 22:55:00,655 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[32899,32912] [2024-11-19 22:55:00,664 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[34874,34887] [2024-11-19 22:55:00,675 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[38255,38268] [2024-11-19 22:55:00,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:55:00,865 INFO L204 MainTranslator]: Completed translation [2024-11-19 22:55:00,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:55:00 WrapperNode [2024-11-19 22:55:00,866 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 22:55:00,867 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 22:55:00,867 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 22:55:00,867 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 22:55:00,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:55:00" (1/1) ... [2024-11-19 22:55:00,911 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:55:00" (1/1) ... [2024-11-19 22:55:00,999 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3756 [2024-11-19 22:55:01,000 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 22:55:01,001 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 22:55:01,001 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 22:55:01,001 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 22:55:01,012 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:55:00" (1/1) ... [2024-11-19 22:55:01,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:55:00" (1/1) ... [2024-11-19 22:55:01,025 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:55:00" (1/1) ... [2024-11-19 22:55:01,075 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 22:55:01,076 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:55:00" (1/1) ... [2024-11-19 22:55:01,076 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:55:00" (1/1) ... [2024-11-19 22:55:01,118 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:55:00" (1/1) ... [2024-11-19 22:55:01,138 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:55:00" (1/1) ... [2024-11-19 22:55:01,149 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:55:00" (1/1) ... [2024-11-19 22:55:01,162 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:55:00" (1/1) ... [2024-11-19 22:55:01,176 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 22:55:01,178 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 22:55:01,178 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 22:55:01,178 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 22:55:01,179 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:55:00" (1/1) ... [2024-11-19 22:55:01,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:55:01,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:55:01,224 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-11-19 22:55:01,228 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-11-19 22:55:01,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 22:55:01,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 22:55:01,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 22:55:01,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 22:55:01,471 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 22:55:01,474 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 22:55:03,332 INFO L? ?]: Removed 602 outVars from TransFormulas that were not future-live. [2024-11-19 22:55:03,332 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 22:55:03,382 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 22:55:03,382 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 22:55:03,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:55:03 BoogieIcfgContainer [2024-11-19 22:55:03,383 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 22:55:03,385 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 22:55:03,385 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 22:55:03,389 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 22:55:03,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:54:59" (1/3) ... [2024-11-19 22:55:03,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cdfe8e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:55:03, skipping insertion in model container [2024-11-19 22:55:03,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:55:00" (2/3) ... [2024-11-19 22:55:03,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cdfe8e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:55:03, skipping insertion in model container [2024-11-19 22:55:03,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:55:03" (3/3) ... [2024-11-19 22:55:03,391 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2024-11-19 22:55:03,412 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 22:55:03,413 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-11-19 22:55:03,486 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 22:55:03,494 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;@557952ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 22:55:03,495 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-19 22:55:03,506 INFO L276 IsEmpty]: Start isEmpty. Operand has 629 states, 612 states have (on average 1.8480392156862746) internal successors, (1131), 628 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:03,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-19 22:55:03,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:03,530 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:03,533 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:03,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:03,539 INFO L85 PathProgramCache]: Analyzing trace with hash -729096350, now seen corresponding path program 1 times [2024-11-19 22:55:03,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:03,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988427249] [2024-11-19 22:55:03,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:03,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:04,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:04,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:04,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988427249] [2024-11-19 22:55:04,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988427249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:04,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:04,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:55:04,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329443160] [2024-11-19 22:55:04,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:04,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:55:04,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:04,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:55:04,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:55:04,189 INFO L87 Difference]: Start difference. First operand has 629 states, 612 states have (on average 1.8480392156862746) internal successors, (1131), 628 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:04,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:04,666 INFO L93 Difference]: Finished difference Result 976 states and 1692 transitions. [2024-11-19 22:55:04,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:55:04,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-19 22:55:04,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:04,682 INFO L225 Difference]: With dead ends: 976 [2024-11-19 22:55:04,682 INFO L226 Difference]: Without dead ends: 504 [2024-11-19 22:55:04,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:55:04,690 INFO L432 NwaCegarLoop]: 591 mSDtfsCounter, 2533 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2533 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:04,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2533 Valid, 621 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 22:55:04,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2024-11-19 22:55:04,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2024-11-19 22:55:04,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 488 states have (on average 1.305327868852459) internal successors, (637), 503 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:04,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 637 transitions. [2024-11-19 22:55:04,749 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 637 transitions. Word has length 72 [2024-11-19 22:55:04,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:04,750 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 637 transitions. [2024-11-19 22:55:04,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:04,750 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 637 transitions. [2024-11-19 22:55:04,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-19 22:55:04,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:04,753 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:04,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 22:55:04,753 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:04,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:04,754 INFO L85 PathProgramCache]: Analyzing trace with hash -2012921467, now seen corresponding path program 1 times [2024-11-19 22:55:04,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:04,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96627117] [2024-11-19 22:55:04,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:04,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:04,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:04,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:04,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96627117] [2024-11-19 22:55:04,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96627117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:04,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:04,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:55:04,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927192708] [2024-11-19 22:55:04,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:04,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:55:04,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:04,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:55:04,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:55:04,964 INFO L87 Difference]: Start difference. First operand 504 states and 637 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:05,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:05,261 INFO L93 Difference]: Finished difference Result 842 states and 1093 transitions. [2024-11-19 22:55:05,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:55:05,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-19 22:55:05,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:05,265 INFO L225 Difference]: With dead ends: 842 [2024-11-19 22:55:05,265 INFO L226 Difference]: Without dead ends: 440 [2024-11-19 22:55:05,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:55:05,267 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 1646 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1646 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:05,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1646 Valid, 337 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:55:05,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-11-19 22:55:05,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2024-11-19 22:55:05,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 424 states have (on average 1.330188679245283) internal successors, (564), 439 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:05,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 564 transitions. [2024-11-19 22:55:05,283 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 564 transitions. Word has length 73 [2024-11-19 22:55:05,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:05,283 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 564 transitions. [2024-11-19 22:55:05,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:05,284 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 564 transitions. [2024-11-19 22:55:05,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-19 22:55:05,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:05,286 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:05,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 22:55:05,286 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:05,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:05,287 INFO L85 PathProgramCache]: Analyzing trace with hash -800948093, now seen corresponding path program 1 times [2024-11-19 22:55:05,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:05,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731443274] [2024-11-19 22:55:05,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:05,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:05,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:05,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:05,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731443274] [2024-11-19 22:55:05,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731443274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:05,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:05,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:55:05,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681204296] [2024-11-19 22:55:05,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:05,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:55:05,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:05,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:55:05,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:55:05,498 INFO L87 Difference]: Start difference. First operand 440 states and 564 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:05,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:05,820 INFO L93 Difference]: Finished difference Result 778 states and 1019 transitions. [2024-11-19 22:55:05,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:55:05,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-11-19 22:55:05,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:05,822 INFO L225 Difference]: With dead ends: 778 [2024-11-19 22:55:05,823 INFO L226 Difference]: Without dead ends: 420 [2024-11-19 22:55:05,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:55:05,826 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 1514 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:05,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 302 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:55:05,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-11-19 22:55:05,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2024-11-19 22:55:05,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 404 states have (on average 1.3341584158415842) internal successors, (539), 419 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:05,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 539 transitions. [2024-11-19 22:55:05,851 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 539 transitions. Word has length 74 [2024-11-19 22:55:05,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:05,851 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 539 transitions. [2024-11-19 22:55:05,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:05,852 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 539 transitions. [2024-11-19 22:55:05,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-19 22:55:05,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:05,858 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:05,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 22:55:05,858 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:05,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:05,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1628151892, now seen corresponding path program 1 times [2024-11-19 22:55:05,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:05,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593611832] [2024-11-19 22:55:05,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:05,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:06,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:06,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:06,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593611832] [2024-11-19 22:55:06,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593611832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:06,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:06,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:55:06,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071030523] [2024-11-19 22:55:06,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:06,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:55:06,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:06,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:55:06,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:55:06,095 INFO L87 Difference]: Start difference. First operand 420 states and 539 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:06,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:06,391 INFO L93 Difference]: Finished difference Result 758 states and 993 transitions. [2024-11-19 22:55:06,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:55:06,392 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-19 22:55:06,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:06,394 INFO L225 Difference]: With dead ends: 758 [2024-11-19 22:55:06,395 INFO L226 Difference]: Without dead ends: 404 [2024-11-19 22:55:06,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:55:06,397 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 1475 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:06,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 308 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:55:06,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-19 22:55:06,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2024-11-19 22:55:06,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 388 states have (on average 1.3402061855670102) internal successors, (520), 403 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:06,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 520 transitions. [2024-11-19 22:55:06,409 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 520 transitions. Word has length 75 [2024-11-19 22:55:06,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:06,411 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 520 transitions. [2024-11-19 22:55:06,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:06,411 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 520 transitions. [2024-11-19 22:55:06,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-19 22:55:06,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:06,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] [2024-11-19 22:55:06,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 22:55:06,414 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:06,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:06,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1037752348, now seen corresponding path program 1 times [2024-11-19 22:55:06,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:06,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525875818] [2024-11-19 22:55:06,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:06,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:06,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:06,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:06,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525875818] [2024-11-19 22:55:06,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525875818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:06,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:06,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:55:06,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766977658] [2024-11-19 22:55:06,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:06,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:55:06,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:06,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:55:06,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:55:06,588 INFO L87 Difference]: Start difference. First operand 404 states and 520 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:06,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:06,838 INFO L93 Difference]: Finished difference Result 742 states and 973 transitions. [2024-11-19 22:55:06,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:55:06,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-19 22:55:06,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:06,840 INFO L225 Difference]: With dead ends: 742 [2024-11-19 22:55:06,841 INFO L226 Difference]: Without dead ends: 393 [2024-11-19 22:55:06,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:55:06,842 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 1450 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1450 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:06,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1450 Valid, 305 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:55:06,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-19 22:55:06,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-19 22:55:06,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.3448275862068966) internal successors, (507), 392 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:06,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 507 transitions. [2024-11-19 22:55:06,849 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 507 transitions. Word has length 76 [2024-11-19 22:55:06,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:06,849 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 507 transitions. [2024-11-19 22:55:06,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:06,850 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 507 transitions. [2024-11-19 22:55:06,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-19 22:55:06,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:06,851 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:06,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 22:55:06,851 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:06,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:06,852 INFO L85 PathProgramCache]: Analyzing trace with hash -142744767, now seen corresponding path program 1 times [2024-11-19 22:55:06,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:06,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974083203] [2024-11-19 22:55:06,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:06,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:07,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:07,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:07,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974083203] [2024-11-19 22:55:07,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974083203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:07,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:07,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:07,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135946486] [2024-11-19 22:55:07,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:07,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:07,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:07,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:07,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:07,204 INFO L87 Difference]: Start difference. First operand 393 states and 507 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:07,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:07,921 INFO L93 Difference]: Finished difference Result 695 states and 915 transitions. [2024-11-19 22:55:07,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:55:07,922 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-19 22:55:07,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:07,925 INFO L225 Difference]: With dead ends: 695 [2024-11-19 22:55:07,925 INFO L226 Difference]: Without dead ends: 605 [2024-11-19 22:55:07,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:55:07,927 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 2840 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2840 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:07,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2840 Valid, 1259 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 22:55:07,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-19 22:55:07,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 393. [2024-11-19 22:55:07,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.3421750663129974) internal successors, (506), 392 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:07,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 506 transitions. [2024-11-19 22:55:07,939 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 506 transitions. Word has length 77 [2024-11-19 22:55:07,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:07,940 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 506 transitions. [2024-11-19 22:55:07,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:07,941 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 506 transitions. [2024-11-19 22:55:07,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-19 22:55:07,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:07,942 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:07,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 22:55:07,943 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:07,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:07,943 INFO L85 PathProgramCache]: Analyzing trace with hash -2022253705, now seen corresponding path program 1 times [2024-11-19 22:55:07,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:07,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928623760] [2024-11-19 22:55:07,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:07,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:08,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:08,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:08,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928623760] [2024-11-19 22:55:08,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928623760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:08,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:08,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 22:55:08,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41510125] [2024-11-19 22:55:08,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:08,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:55:08,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:08,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:55:08,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:55:08,450 INFO L87 Difference]: Start difference. First operand 393 states and 506 transitions. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 11 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:09,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:09,423 INFO L93 Difference]: Finished difference Result 683 states and 883 transitions. [2024-11-19 22:55:09,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 22:55:09,424 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 11 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-19 22:55:09,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:09,426 INFO L225 Difference]: With dead ends: 683 [2024-11-19 22:55:09,426 INFO L226 Difference]: Without dead ends: 613 [2024-11-19 22:55:09,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2024-11-19 22:55:09,427 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 3410 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3410 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:09,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3410 Valid, 1442 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 22:55:09,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-11-19 22:55:09,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 406. [2024-11-19 22:55:09,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 390 states have (on average 1.3461538461538463) internal successors, (525), 405 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:09,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 525 transitions. [2024-11-19 22:55:09,438 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 525 transitions. Word has length 77 [2024-11-19 22:55:09,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:09,438 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 525 transitions. [2024-11-19 22:55:09,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 11 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:09,439 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 525 transitions. [2024-11-19 22:55:09,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-19 22:55:09,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:09,442 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:09,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 22:55:09,443 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:09,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:09,443 INFO L85 PathProgramCache]: Analyzing trace with hash -110056603, now seen corresponding path program 1 times [2024-11-19 22:55:09,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:09,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79413357] [2024-11-19 22:55:09,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:09,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:09,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:09,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:09,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79413357] [2024-11-19 22:55:09,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79413357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:09,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:09,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:09,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595042799] [2024-11-19 22:55:09,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:09,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:09,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:09,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:09,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:09,823 INFO L87 Difference]: Start difference. First operand 406 states and 525 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:10,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:10,673 INFO L93 Difference]: Finished difference Result 738 states and 968 transitions. [2024-11-19 22:55:10,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:55:10,673 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-19 22:55:10,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:10,676 INFO L225 Difference]: With dead ends: 738 [2024-11-19 22:55:10,676 INFO L226 Difference]: Without dead ends: 609 [2024-11-19 22:55:10,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:55:10,677 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 2323 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2323 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:10,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2323 Valid, 1598 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 22:55:10,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-19 22:55:10,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 393. [2024-11-19 22:55:10,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.339522546419098) internal successors, (505), 392 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:10,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 505 transitions. [2024-11-19 22:55:10,685 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 505 transitions. Word has length 77 [2024-11-19 22:55:10,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:10,685 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 505 transitions. [2024-11-19 22:55:10,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:10,686 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 505 transitions. [2024-11-19 22:55:10,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-19 22:55:10,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:10,687 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:10,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 22:55:10,687 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:10,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:10,689 INFO L85 PathProgramCache]: Analyzing trace with hash 679839246, now seen corresponding path program 1 times [2024-11-19 22:55:10,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:10,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613387511] [2024-11-19 22:55:10,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:10,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:11,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:11,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:11,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613387511] [2024-11-19 22:55:11,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613387511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:11,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:11,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:55:11,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023635343] [2024-11-19 22:55:11,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:11,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 22:55:11,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:11,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 22:55:11,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 22:55:11,027 INFO L87 Difference]: Start difference. First operand 393 states and 505 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:11,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:11,708 INFO L93 Difference]: Finished difference Result 760 states and 963 transitions. [2024-11-19 22:55:11,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 22:55:11,709 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-19 22:55:11,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:11,711 INFO L225 Difference]: With dead ends: 760 [2024-11-19 22:55:11,711 INFO L226 Difference]: Without dead ends: 547 [2024-11-19 22:55:11,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-19 22:55:11,714 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 2069 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2069 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:11,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2069 Valid, 1149 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 22:55:11,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-11-19 22:55:11,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 393. [2024-11-19 22:55:11,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.336870026525199) internal successors, (504), 392 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:11,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 504 transitions. [2024-11-19 22:55:11,725 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 504 transitions. Word has length 77 [2024-11-19 22:55:11,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:11,725 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 504 transitions. [2024-11-19 22:55:11,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:11,725 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 504 transitions. [2024-11-19 22:55:11,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-19 22:55:11,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:11,727 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:11,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 22:55:11,727 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:11,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:11,731 INFO L85 PathProgramCache]: Analyzing trace with hash -204100811, now seen corresponding path program 1 times [2024-11-19 22:55:11,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:11,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864766292] [2024-11-19 22:55:11,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:11,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:12,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:12,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:12,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864766292] [2024-11-19 22:55:12,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864766292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:12,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:12,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 22:55:12,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855877085] [2024-11-19 22:55:12,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:12,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:55:12,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:12,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:55:12,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:55:12,325 INFO L87 Difference]: Start difference. First operand 393 states and 504 transitions. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 11 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:13,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:13,712 INFO L93 Difference]: Finished difference Result 952 states and 1281 transitions. [2024-11-19 22:55:13,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 22:55:13,713 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 11 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-19 22:55:13,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:13,716 INFO L225 Difference]: With dead ends: 952 [2024-11-19 22:55:13,716 INFO L226 Difference]: Without dead ends: 853 [2024-11-19 22:55:13,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-19 22:55:13,717 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 3685 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3685 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:13,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3685 Valid, 1841 Invalid, 1649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1502 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 22:55:13,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2024-11-19 22:55:13,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 397. [2024-11-19 22:55:13,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.3333333333333333) internal successors, (508), 396 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:13,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 508 transitions. [2024-11-19 22:55:13,727 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 508 transitions. Word has length 79 [2024-11-19 22:55:13,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:13,727 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 508 transitions. [2024-11-19 22:55:13,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 11 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:13,728 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 508 transitions. [2024-11-19 22:55:13,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-19 22:55:13,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:13,729 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:13,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 22:55:13,729 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:13,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:13,730 INFO L85 PathProgramCache]: Analyzing trace with hash -612946039, now seen corresponding path program 1 times [2024-11-19 22:55:13,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:13,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284031104] [2024-11-19 22:55:13,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:13,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:14,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:14,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:14,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284031104] [2024-11-19 22:55:14,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284031104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:14,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:14,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:14,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292407226] [2024-11-19 22:55:14,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:14,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:14,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:14,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:14,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:14,026 INFO L87 Difference]: Start difference. First operand 397 states and 508 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:14,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:14,753 INFO L93 Difference]: Finished difference Result 678 states and 881 transitions. [2024-11-19 22:55:14,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:55:14,754 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-19 22:55:14,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:14,756 INFO L225 Difference]: With dead ends: 678 [2024-11-19 22:55:14,756 INFO L226 Difference]: Without dead ends: 601 [2024-11-19 22:55:14,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:55:14,758 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 2729 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2729 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:14,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2729 Valid, 1298 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:55:14,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-19 22:55:14,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 397. [2024-11-19 22:55:14,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.330708661417323) internal successors, (507), 396 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:14,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 507 transitions. [2024-11-19 22:55:14,766 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 507 transitions. Word has length 79 [2024-11-19 22:55:14,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:14,766 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 507 transitions. [2024-11-19 22:55:14,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:14,766 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 507 transitions. [2024-11-19 22:55:14,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-19 22:55:14,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:14,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] [2024-11-19 22:55:14,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 22:55:14,767 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:14,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:14,768 INFO L85 PathProgramCache]: Analyzing trace with hash -244843864, now seen corresponding path program 1 times [2024-11-19 22:55:14,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:14,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790973526] [2024-11-19 22:55:14,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:14,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:15,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:15,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:15,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790973526] [2024-11-19 22:55:15,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790973526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:15,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:15,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:15,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426543641] [2024-11-19 22:55:15,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:15,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:15,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:15,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:15,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:15,006 INFO L87 Difference]: Start difference. First operand 397 states and 507 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:15,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:15,554 INFO L93 Difference]: Finished difference Result 678 states and 879 transitions. [2024-11-19 22:55:15,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:55:15,555 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-19 22:55:15,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:15,558 INFO L225 Difference]: With dead ends: 678 [2024-11-19 22:55:15,558 INFO L226 Difference]: Without dead ends: 601 [2024-11-19 22:55:15,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:55:15,559 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 1285 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1285 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:15,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1285 Valid, 1283 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 22:55:15,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-19 22:55:15,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 397. [2024-11-19 22:55:15,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.3280839895013123) internal successors, (506), 396 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:15,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 506 transitions. [2024-11-19 22:55:15,567 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 506 transitions. Word has length 79 [2024-11-19 22:55:15,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:15,568 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 506 transitions. [2024-11-19 22:55:15,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:15,568 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 506 transitions. [2024-11-19 22:55:15,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-19 22:55:15,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:15,570 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:15,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 22:55:15,570 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:15,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:15,571 INFO L85 PathProgramCache]: Analyzing trace with hash 391973260, now seen corresponding path program 1 times [2024-11-19 22:55:15,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:15,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534103591] [2024-11-19 22:55:15,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:15,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:15,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:15,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:15,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:15,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534103591] [2024-11-19 22:55:15,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534103591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:15,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:15,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:15,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397002206] [2024-11-19 22:55:15,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:15,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:15,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:15,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:15,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:15,886 INFO L87 Difference]: Start difference. First operand 397 states and 506 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:16,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:16,583 INFO L93 Difference]: Finished difference Result 674 states and 874 transitions. [2024-11-19 22:55:16,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:55:16,584 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-19 22:55:16,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:16,586 INFO L225 Difference]: With dead ends: 674 [2024-11-19 22:55:16,586 INFO L226 Difference]: Without dead ends: 601 [2024-11-19 22:55:16,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:55:16,587 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 2722 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2722 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:16,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2722 Valid, 1298 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:55:16,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-19 22:55:16,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 397. [2024-11-19 22:55:16,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.3254593175853018) internal successors, (505), 396 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:16,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 505 transitions. [2024-11-19 22:55:16,595 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 505 transitions. Word has length 79 [2024-11-19 22:55:16,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:16,595 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 505 transitions. [2024-11-19 22:55:16,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:16,596 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 505 transitions. [2024-11-19 22:55:16,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-19 22:55:16,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:16,597 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:16,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 22:55:16,598 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:16,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:16,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1786631023, now seen corresponding path program 1 times [2024-11-19 22:55:16,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:16,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641793145] [2024-11-19 22:55:16,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:16,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:17,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:17,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:17,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641793145] [2024-11-19 22:55:17,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641793145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:17,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:17,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 22:55:17,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787531613] [2024-11-19 22:55:17,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:17,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 22:55:17,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:17,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 22:55:17,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-19 22:55:17,216 INFO L87 Difference]: Start difference. First operand 397 states and 505 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 10 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:18,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:18,354 INFO L93 Difference]: Finished difference Result 833 states and 1091 transitions. [2024-11-19 22:55:18,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 22:55:18,354 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 10 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-19 22:55:18,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:18,356 INFO L225 Difference]: With dead ends: 833 [2024-11-19 22:55:18,357 INFO L226 Difference]: Without dead ends: 689 [2024-11-19 22:55:18,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2024-11-19 22:55:18,358 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 1897 mSDsluCounter, 2135 mSDsCounter, 0 mSdLazyCounter, 1906 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1897 SdHoareTripleChecker+Valid, 2558 SdHoareTripleChecker+Invalid, 1918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:18,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1897 Valid, 2558 Invalid, 1918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1906 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 22:55:18,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2024-11-19 22:55:18,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 397. [2024-11-19 22:55:18,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.3228346456692914) internal successors, (504), 396 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:18,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 504 transitions. [2024-11-19 22:55:18,366 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 504 transitions. Word has length 79 [2024-11-19 22:55:18,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:18,366 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 504 transitions. [2024-11-19 22:55:18,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 10 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:18,366 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 504 transitions. [2024-11-19 22:55:18,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-19 22:55:18,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:18,367 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:18,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 22:55:18,367 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:18,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:18,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1207195179, now seen corresponding path program 1 times [2024-11-19 22:55:18,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:18,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150825177] [2024-11-19 22:55:18,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:18,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:18,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:18,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:18,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150825177] [2024-11-19 22:55:18,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150825177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:18,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:18,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:18,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166592752] [2024-11-19 22:55:18,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:18,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:18,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:18,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:18,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:18,661 INFO L87 Difference]: Start difference. First operand 397 states and 504 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:19,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:19,286 INFO L93 Difference]: Finished difference Result 678 states and 875 transitions. [2024-11-19 22:55:19,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:55:19,286 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-19 22:55:19,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:19,288 INFO L225 Difference]: With dead ends: 678 [2024-11-19 22:55:19,289 INFO L226 Difference]: Without dead ends: 601 [2024-11-19 22:55:19,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:55:19,291 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 2222 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2222 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:19,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2222 Valid, 1304 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:55:19,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-19 22:55:19,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 397. [2024-11-19 22:55:19,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.3202099737532809) internal successors, (503), 396 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:19,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 503 transitions. [2024-11-19 22:55:19,300 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 503 transitions. Word has length 79 [2024-11-19 22:55:19,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:19,300 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 503 transitions. [2024-11-19 22:55:19,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:19,301 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 503 transitions. [2024-11-19 22:55:19,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-19 22:55:19,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:19,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] [2024-11-19 22:55:19,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 22:55:19,302 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:19,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:19,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1616040407, now seen corresponding path program 1 times [2024-11-19 22:55:19,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:19,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029499414] [2024-11-19 22:55:19,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:19,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:19,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:19,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:19,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029499414] [2024-11-19 22:55:19,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029499414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:19,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:19,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:19,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517609951] [2024-11-19 22:55:19,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:19,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:19,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:19,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:19,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:19,594 INFO L87 Difference]: Start difference. First operand 397 states and 503 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:20,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:20,413 INFO L93 Difference]: Finished difference Result 704 states and 912 transitions. [2024-11-19 22:55:20,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:55:20,414 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-19 22:55:20,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:20,416 INFO L225 Difference]: With dead ends: 704 [2024-11-19 22:55:20,416 INFO L226 Difference]: Without dead ends: 605 [2024-11-19 22:55:20,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:55:20,417 INFO L432 NwaCegarLoop]: 377 mSDtfsCounter, 2141 mSDsluCounter, 1571 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2141 SdHoareTripleChecker+Valid, 1948 SdHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:20,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2141 Valid, 1948 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1359 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 22:55:20,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-19 22:55:20,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 397. [2024-11-19 22:55:20,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.3175853018372703) internal successors, (502), 396 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:20,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 502 transitions. [2024-11-19 22:55:20,425 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 502 transitions. Word has length 79 [2024-11-19 22:55:20,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:20,425 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 502 transitions. [2024-11-19 22:55:20,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:20,425 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 502 transitions. [2024-11-19 22:55:20,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-19 22:55:20,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:20,426 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:20,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 22:55:20,427 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:20,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:20,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1975429315, now seen corresponding path program 1 times [2024-11-19 22:55:20,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:20,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615288848] [2024-11-19 22:55:20,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:20,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:20,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:20,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:20,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615288848] [2024-11-19 22:55:20,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615288848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:20,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:20,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:20,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434011430] [2024-11-19 22:55:20,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:20,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:20,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:20,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:20,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:20,673 INFO L87 Difference]: Start difference. First operand 397 states and 502 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:21,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:21,347 INFO L93 Difference]: Finished difference Result 704 states and 913 transitions. [2024-11-19 22:55:21,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:55:21,347 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-19 22:55:21,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:21,349 INFO L225 Difference]: With dead ends: 704 [2024-11-19 22:55:21,350 INFO L226 Difference]: Without dead ends: 605 [2024-11-19 22:55:21,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:55:21,351 INFO L432 NwaCegarLoop]: 439 mSDtfsCounter, 1504 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1854 SdHoareTripleChecker+Invalid, 1376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:21,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1854 Invalid, 1376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1371 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:55:21,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-19 22:55:21,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 393. [2024-11-19 22:55:21,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.3183023872679045) internal successors, (497), 392 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:21,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 497 transitions. [2024-11-19 22:55:21,359 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 497 transitions. Word has length 80 [2024-11-19 22:55:21,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:21,359 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 497 transitions. [2024-11-19 22:55:21,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:21,359 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 497 transitions. [2024-11-19 22:55:21,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-19 22:55:21,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:21,361 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:21,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 22:55:21,361 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:21,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:21,362 INFO L85 PathProgramCache]: Analyzing trace with hash 2135531548, now seen corresponding path program 1 times [2024-11-19 22:55:21,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:21,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832075536] [2024-11-19 22:55:21,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:21,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:21,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:21,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:21,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832075536] [2024-11-19 22:55:21,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832075536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:21,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:21,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:21,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134908606] [2024-11-19 22:55:21,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:21,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:21,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:21,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:21,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:21,686 INFO L87 Difference]: Start difference. First operand 393 states and 497 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:22,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:22,406 INFO L93 Difference]: Finished difference Result 651 states and 832 transitions. [2024-11-19 22:55:22,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:55:22,406 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-19 22:55:22,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:22,408 INFO L225 Difference]: With dead ends: 651 [2024-11-19 22:55:22,408 INFO L226 Difference]: Without dead ends: 581 [2024-11-19 22:55:22,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:55:22,409 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 2228 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2228 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:22,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2228 Valid, 1584 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 22:55:22,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-11-19 22:55:22,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 393. [2024-11-19 22:55:22,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.3156498673740054) internal successors, (496), 392 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:22,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 496 transitions. [2024-11-19 22:55:22,416 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 496 transitions. Word has length 81 [2024-11-19 22:55:22,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:22,417 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 496 transitions. [2024-11-19 22:55:22,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:22,417 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 496 transitions. [2024-11-19 22:55:22,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-19 22:55:22,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:22,418 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:22,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 22:55:22,419 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:22,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:22,419 INFO L85 PathProgramCache]: Analyzing trace with hash -247238646, now seen corresponding path program 1 times [2024-11-19 22:55:22,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:22,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935796406] [2024-11-19 22:55:22,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:22,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:22,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:22,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:22,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935796406] [2024-11-19 22:55:22,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935796406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:22,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:22,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 22:55:22,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489511934] [2024-11-19 22:55:22,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:22,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:55:22,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:22,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:55:22,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:55:22,937 INFO L87 Difference]: Start difference. First operand 393 states and 496 transitions. Second operand has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:23,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:23,988 INFO L93 Difference]: Finished difference Result 887 states and 1171 transitions. [2024-11-19 22:55:23,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 22:55:23,989 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-19 22:55:23,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:23,991 INFO L225 Difference]: With dead ends: 887 [2024-11-19 22:55:23,991 INFO L226 Difference]: Without dead ends: 805 [2024-11-19 22:55:23,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-19 22:55:23,994 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 4021 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4021 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:23,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4021 Valid, 1595 Invalid, 1372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 22:55:23,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-11-19 22:55:24,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 397. [2024-11-19 22:55:24,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.3123359580052494) internal successors, (500), 396 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:24,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 500 transitions. [2024-11-19 22:55:24,004 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 500 transitions. Word has length 81 [2024-11-19 22:55:24,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:24,005 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 500 transitions. [2024-11-19 22:55:24,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:24,005 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 500 transitions. [2024-11-19 22:55:24,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-19 22:55:24,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:24,007 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:24,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 22:55:24,008 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:24,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:24,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1648828412, now seen corresponding path program 1 times [2024-11-19 22:55:24,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:24,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311138071] [2024-11-19 22:55:24,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:24,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:24,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:24,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:24,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311138071] [2024-11-19 22:55:24,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311138071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:24,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:24,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:24,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788479469] [2024-11-19 22:55:24,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:24,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:24,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:24,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:24,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:24,279 INFO L87 Difference]: Start difference. First operand 397 states and 500 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:25,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:25,019 INFO L93 Difference]: Finished difference Result 652 states and 832 transitions. [2024-11-19 22:55:25,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:55:25,019 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-19 22:55:25,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:25,021 INFO L225 Difference]: With dead ends: 652 [2024-11-19 22:55:25,021 INFO L226 Difference]: Without dead ends: 585 [2024-11-19 22:55:25,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:55:25,022 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 2146 mSDsluCounter, 1401 mSDsCounter, 0 mSdLazyCounter, 1336 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2146 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:25,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2146 Valid, 1750 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1336 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 22:55:25,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-19 22:55:25,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 397. [2024-11-19 22:55:25,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.3097112860892388) internal successors, (499), 396 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:25,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 499 transitions. [2024-11-19 22:55:25,028 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 499 transitions. Word has length 81 [2024-11-19 22:55:25,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:25,029 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 499 transitions. [2024-11-19 22:55:25,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:25,029 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 499 transitions. [2024-11-19 22:55:25,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-19 22:55:25,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:25,030 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:25,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 22:55:25,030 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:25,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:25,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1380394973, now seen corresponding path program 1 times [2024-11-19 22:55:25,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:25,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707315492] [2024-11-19 22:55:25,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:25,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:25,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:25,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:25,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707315492] [2024-11-19 22:55:25,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707315492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:25,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:25,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 22:55:25,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315145856] [2024-11-19 22:55:25,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:25,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:55:25,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:25,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:55:25,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:55:25,493 INFO L87 Difference]: Start difference. First operand 397 states and 499 transitions. Second operand has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:26,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:26,577 INFO L93 Difference]: Finished difference Result 823 states and 1074 transitions. [2024-11-19 22:55:26,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 22:55:26,578 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-19 22:55:26,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:26,580 INFO L225 Difference]: With dead ends: 823 [2024-11-19 22:55:26,580 INFO L226 Difference]: Without dead ends: 753 [2024-11-19 22:55:26,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-19 22:55:26,582 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 4086 mSDsluCounter, 1339 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4086 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 1482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:26,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4086 Valid, 1638 Invalid, 1482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 22:55:26,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2024-11-19 22:55:26,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 401. [2024-11-19 22:55:26,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.3064935064935066) internal successors, (503), 400 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:26,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 503 transitions. [2024-11-19 22:55:26,589 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 503 transitions. Word has length 81 [2024-11-19 22:55:26,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:26,589 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 503 transitions. [2024-11-19 22:55:26,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:26,590 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 503 transitions. [2024-11-19 22:55:26,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-19 22:55:26,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:26,591 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:26,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 22:55:26,591 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:26,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:26,591 INFO L85 PathProgramCache]: Analyzing trace with hash -90069907, now seen corresponding path program 1 times [2024-11-19 22:55:26,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:26,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266572903] [2024-11-19 22:55:26,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:26,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:26,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:26,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:26,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266572903] [2024-11-19 22:55:26,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266572903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:26,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:26,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:26,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422897551] [2024-11-19 22:55:26,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:26,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:26,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:26,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:26,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:26,844 INFO L87 Difference]: Start difference. First operand 401 states and 503 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:27,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:27,495 INFO L93 Difference]: Finished difference Result 652 states and 830 transitions. [2024-11-19 22:55:27,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:55:27,495 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-19 22:55:27,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:27,497 INFO L225 Difference]: With dead ends: 652 [2024-11-19 22:55:27,497 INFO L226 Difference]: Without dead ends: 585 [2024-11-19 22:55:27,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:55:27,498 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 2143 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2143 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:27,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2143 Valid, 1754 Invalid, 1323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:55:27,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-19 22:55:27,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 401. [2024-11-19 22:55:27,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.3038961038961039) internal successors, (502), 400 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:27,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 502 transitions. [2024-11-19 22:55:27,505 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 502 transitions. Word has length 81 [2024-11-19 22:55:27,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:27,505 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 502 transitions. [2024-11-19 22:55:27,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:27,506 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 502 transitions. [2024-11-19 22:55:27,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-19 22:55:27,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:27,507 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:27,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 22:55:27,507 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:27,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:27,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1355696644, now seen corresponding path program 1 times [2024-11-19 22:55:27,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:27,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331091322] [2024-11-19 22:55:27,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:27,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:27,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:27,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:27,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331091322] [2024-11-19 22:55:27,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331091322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:27,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:27,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:27,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672529740] [2024-11-19 22:55:27,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:27,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:27,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:27,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:27,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:27,746 INFO L87 Difference]: Start difference. First operand 401 states and 502 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:28,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:28,409 INFO L93 Difference]: Finished difference Result 590 states and 736 transitions. [2024-11-19 22:55:28,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:55:28,409 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-19 22:55:28,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:28,411 INFO L225 Difference]: With dead ends: 590 [2024-11-19 22:55:28,411 INFO L226 Difference]: Without dead ends: 585 [2024-11-19 22:55:28,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:55:28,412 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 2297 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2297 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:28,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2297 Valid, 1430 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:55:28,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-19 22:55:28,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 401. [2024-11-19 22:55:28,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.3012987012987014) internal successors, (501), 400 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:28,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 501 transitions. [2024-11-19 22:55:28,420 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 501 transitions. Word has length 81 [2024-11-19 22:55:28,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:28,421 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 501 transitions. [2024-11-19 22:55:28,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:28,421 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 501 transitions. [2024-11-19 22:55:28,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-19 22:55:28,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:28,422 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:28,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 22:55:28,423 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:28,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:28,423 INFO L85 PathProgramCache]: Analyzing trace with hash 558624169, now seen corresponding path program 1 times [2024-11-19 22:55:28,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:28,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345619220] [2024-11-19 22:55:28,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:28,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:28,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-11-19 22:55:28,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:28,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345619220] [2024-11-19 22:55:28,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345619220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:28,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:28,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:28,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545877540] [2024-11-19 22:55:28,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:28,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:28,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:28,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:28,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:28,648 INFO L87 Difference]: Start difference. First operand 401 states and 501 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:29,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:29,141 INFO L93 Difference]: Finished difference Result 652 states and 827 transitions. [2024-11-19 22:55:29,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:55:29,142 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-19 22:55:29,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:29,143 INFO L225 Difference]: With dead ends: 652 [2024-11-19 22:55:29,143 INFO L226 Difference]: Without dead ends: 585 [2024-11-19 22:55:29,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:55:29,145 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 1919 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1919 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:29,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1919 Valid, 1260 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 22:55:29,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-19 22:55:29,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 401. [2024-11-19 22:55:29,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.2987012987012987) internal successors, (500), 400 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:29,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 500 transitions. [2024-11-19 22:55:29,152 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 500 transitions. Word has length 81 [2024-11-19 22:55:29,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:29,153 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 500 transitions. [2024-11-19 22:55:29,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:29,153 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 500 transitions. [2024-11-19 22:55:29,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-19 22:55:29,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:29,154 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:29,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 22:55:29,155 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:29,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:29,155 INFO L85 PathProgramCache]: Analyzing trace with hash -237124242, now seen corresponding path program 1 times [2024-11-19 22:55:29,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:29,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291724255] [2024-11-19 22:55:29,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:29,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:29,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:29,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:29,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291724255] [2024-11-19 22:55:29,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291724255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:29,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:29,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:29,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412628451] [2024-11-19 22:55:29,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:29,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:29,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:29,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:29,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:29,440 INFO L87 Difference]: Start difference. First operand 401 states and 500 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:29,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:29,991 INFO L93 Difference]: Finished difference Result 650 states and 823 transitions. [2024-11-19 22:55:29,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:55:29,992 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-19 22:55:29,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:29,994 INFO L225 Difference]: With dead ends: 650 [2024-11-19 22:55:29,994 INFO L226 Difference]: Without dead ends: 585 [2024-11-19 22:55:29,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:55:29,995 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 2215 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2215 SdHoareTripleChecker+Valid, 1564 SdHoareTripleChecker+Invalid, 1155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:29,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2215 Valid, 1564 Invalid, 1155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:55:29,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-19 22:55:30,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 401. [2024-11-19 22:55:30,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.2961038961038962) internal successors, (499), 400 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:30,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 499 transitions. [2024-11-19 22:55:30,002 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 499 transitions. Word has length 81 [2024-11-19 22:55:30,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:30,003 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 499 transitions. [2024-11-19 22:55:30,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:30,003 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 499 transitions. [2024-11-19 22:55:30,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-19 22:55:30,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:30,004 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:30,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 22:55:30,004 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:30,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:30,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1610096682, now seen corresponding path program 1 times [2024-11-19 22:55:30,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:30,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628081144] [2024-11-19 22:55:30,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:30,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:30,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:30,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:30,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628081144] [2024-11-19 22:55:30,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628081144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:30,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:30,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:30,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161867446] [2024-11-19 22:55:30,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:30,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:30,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:30,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:30,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:30,272 INFO L87 Difference]: Start difference. First operand 401 states and 499 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:30,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:30,800 INFO L93 Difference]: Finished difference Result 683 states and 867 transitions. [2024-11-19 22:55:30,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:55:30,801 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-19 22:55:30,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:30,803 INFO L225 Difference]: With dead ends: 683 [2024-11-19 22:55:30,803 INFO L226 Difference]: Without dead ends: 601 [2024-11-19 22:55:30,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:55:30,803 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 2446 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2446 SdHoareTripleChecker+Valid, 1494 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:30,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2446 Valid, 1494 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 22:55:30,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-19 22:55:30,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 401. [2024-11-19 22:55:30,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.2935064935064935) internal successors, (498), 400 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:30,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 498 transitions. [2024-11-19 22:55:30,810 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 498 transitions. Word has length 81 [2024-11-19 22:55:30,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:30,810 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 498 transitions. [2024-11-19 22:55:30,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:30,811 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 498 transitions. [2024-11-19 22:55:30,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-19 22:55:30,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:30,812 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:30,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 22:55:30,812 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:30,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:30,812 INFO L85 PathProgramCache]: Analyzing trace with hash -302100420, now seen corresponding path program 1 times [2024-11-19 22:55:30,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:30,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973303741] [2024-11-19 22:55:30,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:30,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:31,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:31,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:31,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973303741] [2024-11-19 22:55:31,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973303741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:31,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:31,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:31,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760424841] [2024-11-19 22:55:31,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:31,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:31,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:31,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:31,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:31,125 INFO L87 Difference]: Start difference. First operand 401 states and 498 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:31,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:31,764 INFO L93 Difference]: Finished difference Result 655 states and 826 transitions. [2024-11-19 22:55:31,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:55:31,765 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-19 22:55:31,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:31,766 INFO L225 Difference]: With dead ends: 655 [2024-11-19 22:55:31,766 INFO L226 Difference]: Without dead ends: 585 [2024-11-19 22:55:31,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:55:31,767 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 2184 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2184 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:31,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2184 Valid, 1620 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1160 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:55:31,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-19 22:55:31,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 401. [2024-11-19 22:55:31,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.290909090909091) internal successors, (497), 400 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:31,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 497 transitions. [2024-11-19 22:55:31,773 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 497 transitions. Word has length 81 [2024-11-19 22:55:31,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:31,774 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 497 transitions. [2024-11-19 22:55:31,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:31,774 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 497 transitions. [2024-11-19 22:55:31,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-19 22:55:31,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:31,775 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:31,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 22:55:31,775 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:31,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:31,776 INFO L85 PathProgramCache]: Analyzing trace with hash -286808248, now seen corresponding path program 1 times [2024-11-19 22:55:31,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:31,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482947786] [2024-11-19 22:55:31,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:31,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:31,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:31,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:31,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482947786] [2024-11-19 22:55:31,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482947786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:31,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:31,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:31,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321985347] [2024-11-19 22:55:31,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:31,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:31,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:31,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:31,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:31,997 INFO L87 Difference]: Start difference. First operand 401 states and 497 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:32,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:32,615 INFO L93 Difference]: Finished difference Result 726 states and 921 transitions. [2024-11-19 22:55:32,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:55:32,616 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-19 22:55:32,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:32,617 INFO L225 Difference]: With dead ends: 726 [2024-11-19 22:55:32,617 INFO L226 Difference]: Without dead ends: 621 [2024-11-19 22:55:32,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:55:32,618 INFO L432 NwaCegarLoop]: 396 mSDtfsCounter, 1673 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1673 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:32,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1673 Valid, 1684 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:55:32,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-11-19 22:55:32,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 401. [2024-11-19 22:55:32,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.2883116883116883) internal successors, (496), 400 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:32,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 496 transitions. [2024-11-19 22:55:32,625 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 496 transitions. Word has length 81 [2024-11-19 22:55:32,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:32,625 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 496 transitions. [2024-11-19 22:55:32,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:32,625 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 496 transitions. [2024-11-19 22:55:32,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-19 22:55:32,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:32,626 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:32,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 22:55:32,626 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:32,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:32,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1055423202, now seen corresponding path program 1 times [2024-11-19 22:55:32,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:32,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209048171] [2024-11-19 22:55:32,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:32,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:32,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:32,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:32,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:32,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209048171] [2024-11-19 22:55:32,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209048171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:32,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:32,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:32,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37396126] [2024-11-19 22:55:32,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:32,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:32,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:32,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:32,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:32,907 INFO L87 Difference]: Start difference. First operand 401 states and 496 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:33,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:33,494 INFO L93 Difference]: Finished difference Result 590 states and 728 transitions. [2024-11-19 22:55:33,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:55:33,494 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-19 22:55:33,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:33,496 INFO L225 Difference]: With dead ends: 590 [2024-11-19 22:55:33,496 INFO L226 Difference]: Without dead ends: 585 [2024-11-19 22:55:33,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:55:33,497 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 2175 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2175 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:33,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2175 Valid, 1620 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:55:33,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-19 22:55:33,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 401. [2024-11-19 22:55:33,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.2857142857142858) internal successors, (495), 400 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:33,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 495 transitions. [2024-11-19 22:55:33,503 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 495 transitions. Word has length 81 [2024-11-19 22:55:33,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:33,504 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 495 transitions. [2024-11-19 22:55:33,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:33,504 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 495 transitions. [2024-11-19 22:55:33,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-19 22:55:33,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:33,506 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:33,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-19 22:55:33,507 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:33,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:33,507 INFO L85 PathProgramCache]: Analyzing trace with hash 856773900, now seen corresponding path program 1 times [2024-11-19 22:55:33,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:33,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013815746] [2024-11-19 22:55:33,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:33,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:33,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:33,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:33,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:33,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013815746] [2024-11-19 22:55:33,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013815746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:33,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:33,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 22:55:33,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987607185] [2024-11-19 22:55:33,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:33,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:55:33,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:33,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:55:33,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:55:33,883 INFO L87 Difference]: Start difference. First operand 401 states and 495 transitions. Second operand has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:34,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:34,775 INFO L93 Difference]: Finished difference Result 826 states and 1066 transitions. [2024-11-19 22:55:34,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 22:55:34,775 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-19 22:55:34,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:34,777 INFO L225 Difference]: With dead ends: 826 [2024-11-19 22:55:34,777 INFO L226 Difference]: Without dead ends: 809 [2024-11-19 22:55:34,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-19 22:55:34,779 INFO L432 NwaCegarLoop]: 374 mSDtfsCounter, 4698 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4698 SdHoareTripleChecker+Valid, 1696 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:34,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4698 Valid, 1696 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1207 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 22:55:34,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2024-11-19 22:55:34,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 405. [2024-11-19 22:55:34,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 389 states have (on average 1.2827763496143958) internal successors, (499), 404 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:34,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 499 transitions. [2024-11-19 22:55:34,786 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 499 transitions. Word has length 81 [2024-11-19 22:55:34,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:34,786 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 499 transitions. [2024-11-19 22:55:34,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:34,786 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 499 transitions. [2024-11-19 22:55:34,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-19 22:55:34,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:34,788 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:34,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-19 22:55:34,788 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:34,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:34,789 INFO L85 PathProgramCache]: Analyzing trace with hash -544552721, now seen corresponding path program 1 times [2024-11-19 22:55:34,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:34,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366168178] [2024-11-19 22:55:34,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:34,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:35,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:35,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:35,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366168178] [2024-11-19 22:55:35,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366168178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:35,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:35,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:35,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738728781] [2024-11-19 22:55:35,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:35,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:35,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:35,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:35,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:35,049 INFO L87 Difference]: Start difference. First operand 405 states and 499 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:35,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:35,606 INFO L93 Difference]: Finished difference Result 656 states and 824 transitions. [2024-11-19 22:55:35,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 22:55:35,606 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-19 22:55:35,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:35,608 INFO L225 Difference]: With dead ends: 656 [2024-11-19 22:55:35,608 INFO L226 Difference]: Without dead ends: 589 [2024-11-19 22:55:35,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:55:35,609 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 2172 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2172 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:35,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2172 Valid, 1620 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:55:35,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2024-11-19 22:55:35,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 405. [2024-11-19 22:55:35,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 389 states have (on average 1.2802056555269923) internal successors, (498), 404 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:35,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 498 transitions. [2024-11-19 22:55:35,614 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 498 transitions. Word has length 81 [2024-11-19 22:55:35,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:35,614 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 498 transitions. [2024-11-19 22:55:35,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:35,614 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 498 transitions. [2024-11-19 22:55:35,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-19 22:55:35,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:35,615 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:35,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-19 22:55:35,616 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:35,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:35,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1810559777, now seen corresponding path program 1 times [2024-11-19 22:55:35,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:35,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043931507] [2024-11-19 22:55:35,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:35,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:35,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-11-19 22:55:35,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:35,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043931507] [2024-11-19 22:55:35,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043931507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:35,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:35,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:35,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112283396] [2024-11-19 22:55:35,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:35,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:35,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:35,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:35,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:35,861 INFO L87 Difference]: Start difference. First operand 405 states and 498 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:36,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:36,383 INFO L93 Difference]: Finished difference Result 594 states and 730 transitions. [2024-11-19 22:55:36,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:55:36,384 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-19 22:55:36,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:36,385 INFO L225 Difference]: With dead ends: 594 [2024-11-19 22:55:36,385 INFO L226 Difference]: Without dead ends: 589 [2024-11-19 22:55:36,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:55:36,386 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 1231 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1231 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:36,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1231 Valid, 1312 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 22:55:36,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2024-11-19 22:55:36,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 405. [2024-11-19 22:55:36,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 389 states have (on average 1.2776349614395888) internal successors, (497), 404 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:36,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 497 transitions. [2024-11-19 22:55:36,392 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 497 transitions. Word has length 81 [2024-11-19 22:55:36,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:36,392 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 497 transitions. [2024-11-19 22:55:36,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:36,392 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 497 transitions. [2024-11-19 22:55:36,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-19 22:55:36,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:36,393 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:36,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-19 22:55:36,394 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:36,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:36,394 INFO L85 PathProgramCache]: Analyzing trace with hash -423596437, now seen corresponding path program 1 times [2024-11-19 22:55:36,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:36,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717241498] [2024-11-19 22:55:36,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:36,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:36,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:36,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:36,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717241498] [2024-11-19 22:55:36,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717241498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:36,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:36,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:36,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843071703] [2024-11-19 22:55:36,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:36,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:36,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:36,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:36,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:36,642 INFO L87 Difference]: Start difference. First operand 405 states and 497 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:37,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:37,231 INFO L93 Difference]: Finished difference Result 659 states and 824 transitions. [2024-11-19 22:55:37,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:55:37,232 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-19 22:55:37,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:37,233 INFO L225 Difference]: With dead ends: 659 [2024-11-19 22:55:37,233 INFO L226 Difference]: Without dead ends: 589 [2024-11-19 22:55:37,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:55:37,234 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 2432 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2432 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:37,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2432 Valid, 1328 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:55:37,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2024-11-19 22:55:37,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 401. [2024-11-19 22:55:37,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.277922077922078) internal successors, (492), 400 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:37,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 492 transitions. [2024-11-19 22:55:37,240 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 492 transitions. Word has length 82 [2024-11-19 22:55:37,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:37,241 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 492 transitions. [2024-11-19 22:55:37,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:37,241 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 492 transitions. [2024-11-19 22:55:37,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-19 22:55:37,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:37,242 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:37,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-19 22:55:37,242 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:37,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:37,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1323094470, now seen corresponding path program 1 times [2024-11-19 22:55:37,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:37,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468824098] [2024-11-19 22:55:37,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:37,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:37,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:37,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:37,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468824098] [2024-11-19 22:55:37,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468824098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:37,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:37,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:37,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70433646] [2024-11-19 22:55:37,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:37,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:37,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:37,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:37,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:37,453 INFO L87 Difference]: Start difference. First operand 401 states and 492 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:38,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:38,040 INFO L93 Difference]: Finished difference Result 679 states and 854 transitions. [2024-11-19 22:55:38,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:55:38,041 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-19 22:55:38,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:38,042 INFO L225 Difference]: With dead ends: 679 [2024-11-19 22:55:38,042 INFO L226 Difference]: Without dead ends: 597 [2024-11-19 22:55:38,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:55:38,044 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 1980 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 1231 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1980 SdHoareTripleChecker+Valid, 1777 SdHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:38,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1980 Valid, 1777 Invalid, 1237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1231 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:55:38,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2024-11-19 22:55:38,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 397. [2024-11-19 22:55:38,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.2782152230971129) internal successors, (487), 396 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:38,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 487 transitions. [2024-11-19 22:55:38,053 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 487 transitions. Word has length 82 [2024-11-19 22:55:38,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:38,053 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 487 transitions. [2024-11-19 22:55:38,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:38,054 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 487 transitions. [2024-11-19 22:55:38,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-19 22:55:38,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:38,055 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:38,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-19 22:55:38,055 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:38,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:38,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1458444177, now seen corresponding path program 1 times [2024-11-19 22:55:38,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:38,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218803222] [2024-11-19 22:55:38,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:38,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:38,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:38,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:38,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218803222] [2024-11-19 22:55:38,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218803222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:38,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:38,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:38,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885098434] [2024-11-19 22:55:38,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:38,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:38,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:38,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:38,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:38,269 INFO L87 Difference]: Start difference. First operand 397 states and 487 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:38,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:38,842 INFO L93 Difference]: Finished difference Result 614 states and 757 transitions. [2024-11-19 22:55:38,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:55:38,842 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-19 22:55:38,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:38,844 INFO L225 Difference]: With dead ends: 614 [2024-11-19 22:55:38,844 INFO L226 Difference]: Without dead ends: 597 [2024-11-19 22:55:38,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:55:38,845 INFO L432 NwaCegarLoop]: 435 mSDtfsCounter, 1922 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1922 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:38,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1922 Valid, 1825 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1251 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:55:38,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2024-11-19 22:55:38,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 393. [2024-11-19 22:55:38,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.2785145888594165) internal successors, (482), 392 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:38,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 482 transitions. [2024-11-19 22:55:38,849 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 482 transitions. Word has length 82 [2024-11-19 22:55:38,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:38,849 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 482 transitions. [2024-11-19 22:55:38,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:38,849 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 482 transitions. [2024-11-19 22:55:38,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-19 22:55:38,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:38,850 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:38,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-19 22:55:38,850 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:38,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:38,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1687929497, now seen corresponding path program 1 times [2024-11-19 22:55:38,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:38,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216589824] [2024-11-19 22:55:38,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:38,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:39,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:39,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:39,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216589824] [2024-11-19 22:55:39,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216589824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:39,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:39,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 22:55:39,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591419801] [2024-11-19 22:55:39,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:39,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 22:55:39,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:39,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 22:55:39,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-19 22:55:39,367 INFO L87 Difference]: Start difference. First operand 393 states and 482 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:39,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:39,872 INFO L93 Difference]: Finished difference Result 906 states and 1133 transitions. [2024-11-19 22:55:39,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:55:39,873 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-19 22:55:39,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:39,874 INFO L225 Difference]: With dead ends: 906 [2024-11-19 22:55:39,875 INFO L226 Difference]: Without dead ends: 723 [2024-11-19 22:55:39,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-11-19 22:55:39,875 INFO L432 NwaCegarLoop]: 547 mSDtfsCounter, 1306 mSDsluCounter, 2658 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1306 SdHoareTripleChecker+Valid, 3205 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:39,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1306 Valid, 3205 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:55:39,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2024-11-19 22:55:39,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 275. [2024-11-19 22:55:39,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 264 states have (on average 1.2651515151515151) internal successors, (334), 274 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:39,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 334 transitions. [2024-11-19 22:55:39,880 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 334 transitions. Word has length 83 [2024-11-19 22:55:39,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:39,880 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 334 transitions. [2024-11-19 22:55:39,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:39,881 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 334 transitions. [2024-11-19 22:55:39,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-19 22:55:39,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:39,881 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:39,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-19 22:55:39,882 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:39,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:39,882 INFO L85 PathProgramCache]: Analyzing trace with hash -119228615, now seen corresponding path program 1 times [2024-11-19 22:55:39,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:39,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515378487] [2024-11-19 22:55:39,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:39,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:40,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-11-19 22:55:40,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:40,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515378487] [2024-11-19 22:55:40,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515378487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:40,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:40,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 22:55:40,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022296227] [2024-11-19 22:55:40,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:40,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:55:40,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:40,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:55:40,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:55:40,382 INFO L87 Difference]: Start difference. First operand 275 states and 334 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:40,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:40,870 INFO L93 Difference]: Finished difference Result 452 states and 580 transitions. [2024-11-19 22:55:40,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 22:55:40,870 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-19 22:55:40,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:40,871 INFO L225 Difference]: With dead ends: 452 [2024-11-19 22:55:40,871 INFO L226 Difference]: Without dead ends: 354 [2024-11-19 22:55:40,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-11-19 22:55:40,872 INFO L432 NwaCegarLoop]: 377 mSDtfsCounter, 1397 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1397 SdHoareTripleChecker+Valid, 2061 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:40,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1397 Valid, 2061 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:55:40,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-19 22:55:40,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 242. [2024-11-19 22:55:40,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 234 states have (on average 1.2564102564102564) internal successors, (294), 241 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:40,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 294 transitions. [2024-11-19 22:55:40,875 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 294 transitions. Word has length 83 [2024-11-19 22:55:40,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:40,875 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 294 transitions. [2024-11-19 22:55:40,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:40,875 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 294 transitions. [2024-11-19 22:55:40,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-19 22:55:40,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:40,876 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:40,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-19 22:55:40,876 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:40,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:40,877 INFO L85 PathProgramCache]: Analyzing trace with hash 2051820758, now seen corresponding path program 1 times [2024-11-19 22:55:40,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:40,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219721255] [2024-11-19 22:55:40,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:40,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:41,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:41,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:41,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219721255] [2024-11-19 22:55:41,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219721255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:41,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:41,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 22:55:41,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248269255] [2024-11-19 22:55:41,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:41,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 22:55:41,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:41,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 22:55:41,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-19 22:55:41,396 INFO L87 Difference]: Start difference. First operand 242 states and 294 transitions. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:42,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:42,112 INFO L93 Difference]: Finished difference Result 649 states and 837 transitions. [2024-11-19 22:55:42,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 22:55:42,112 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-19 22:55:42,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:42,114 INFO L225 Difference]: With dead ends: 649 [2024-11-19 22:55:42,114 INFO L226 Difference]: Without dead ends: 568 [2024-11-19 22:55:42,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-11-19 22:55:42,114 INFO L432 NwaCegarLoop]: 416 mSDtfsCounter, 1154 mSDsluCounter, 2797 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1154 SdHoareTripleChecker+Valid, 3213 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:42,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1154 Valid, 3213 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:55:42,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-11-19 22:55:42,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 226. [2024-11-19 22:55:42,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 220 states have (on average 1.25) internal successors, (275), 225 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:42,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 275 transitions. [2024-11-19 22:55:42,117 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 275 transitions. Word has length 83 [2024-11-19 22:55:42,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:42,117 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 275 transitions. [2024-11-19 22:55:42,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:42,118 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 275 transitions. [2024-11-19 22:55:42,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-19 22:55:42,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:42,118 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:42,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-19 22:55:42,118 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:42,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:42,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1787055611, now seen corresponding path program 1 times [2024-11-19 22:55:42,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:42,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020535920] [2024-11-19 22:55:42,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:42,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:42,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-11-19 22:55:42,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:42,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020535920] [2024-11-19 22:55:42,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020535920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:42,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:42,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 22:55:42,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558665323] [2024-11-19 22:55:42,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:42,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 22:55:42,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:42,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 22:55:42,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-19 22:55:42,670 INFO L87 Difference]: Start difference. First operand 226 states and 275 transitions. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:43,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:43,315 INFO L93 Difference]: Finished difference Result 585 states and 771 transitions. [2024-11-19 22:55:43,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 22:55:43,315 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-19 22:55:43,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:43,316 INFO L225 Difference]: With dead ends: 585 [2024-11-19 22:55:43,316 INFO L226 Difference]: Without dead ends: 457 [2024-11-19 22:55:43,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-11-19 22:55:43,317 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 741 mSDsluCounter, 4276 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 4819 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:43,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 4819 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:55:43,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-11-19 22:55:43,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 163. [2024-11-19 22:55:43,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 161 states have (on average 1.2422360248447204) internal successors, (200), 162 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:43,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 200 transitions. [2024-11-19 22:55:43,321 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 200 transitions. Word has length 83 [2024-11-19 22:55:43,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:43,321 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 200 transitions. [2024-11-19 22:55:43,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:43,322 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 200 transitions. [2024-11-19 22:55:43,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 22:55:43,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:43,322 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:43,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-19 22:55:43,323 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:43,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:43,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1707932206, now seen corresponding path program 1 times [2024-11-19 22:55:43,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:43,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523929232] [2024-11-19 22:55:43,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:43,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:43,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:43,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:43,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523929232] [2024-11-19 22:55:43,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523929232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:43,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:43,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:55:43,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316219300] [2024-11-19 22:55:43,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:43,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 22:55:43,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:43,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 22:55:43,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 22:55:43,533 INFO L87 Difference]: Start difference. First operand 163 states and 200 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:43,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:43,828 INFO L93 Difference]: Finished difference Result 338 states and 441 transitions. [2024-11-19 22:55:43,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 22:55:43,832 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2024-11-19 22:55:43,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:43,833 INFO L225 Difference]: With dead ends: 338 [2024-11-19 22:55:43,833 INFO L226 Difference]: Without dead ends: 255 [2024-11-19 22:55:43,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:55:43,834 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 413 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:43,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 764 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:55:43,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-19 22:55:43,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 163. [2024-11-19 22:55:43,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 161 states have (on average 1.236024844720497) internal successors, (199), 162 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:43,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 199 transitions. [2024-11-19 22:55:43,837 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 199 transitions. Word has length 84 [2024-11-19 22:55:43,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:43,838 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 199 transitions. [2024-11-19 22:55:43,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:43,838 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 199 transitions. [2024-11-19 22:55:43,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 22:55:43,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:43,839 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:43,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-19 22:55:43,839 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:43,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:43,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1161243347, now seen corresponding path program 1 times [2024-11-19 22:55:43,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:43,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050485898] [2024-11-19 22:55:43,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:43,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:45,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:45,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:45,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050485898] [2024-11-19 22:55:45,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050485898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:45,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:45,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2024-11-19 22:55:45,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623975240] [2024-11-19 22:55:45,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:45,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-19 22:55:45,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:45,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-19 22:55:45,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2024-11-19 22:55:45,279 INFO L87 Difference]: Start difference. First operand 163 states and 199 transitions. Second operand has 28 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 28 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:48,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:48,101 INFO L93 Difference]: Finished difference Result 631 states and 835 transitions. [2024-11-19 22:55:48,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-19 22:55:48,101 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 28 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-11-19 22:55:48,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:48,103 INFO L225 Difference]: With dead ends: 631 [2024-11-19 22:55:48,103 INFO L226 Difference]: Without dead ends: 625 [2024-11-19 22:55:48,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=426, Invalid=2124, Unknown=0, NotChecked=0, Total=2550 [2024-11-19 22:55:48,104 INFO L432 NwaCegarLoop]: 546 mSDtfsCounter, 1295 mSDsluCounter, 7337 mSDsCounter, 0 mSdLazyCounter, 3884 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1295 SdHoareTripleChecker+Valid, 7883 SdHoareTripleChecker+Invalid, 3896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:48,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1295 Valid, 7883 Invalid, 3896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3884 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 22:55:48,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2024-11-19 22:55:48,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 184. [2024-11-19 22:55:48,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 182 states have (on average 1.2362637362637363) internal successors, (225), 183 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:48,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 225 transitions. [2024-11-19 22:55:48,108 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 225 transitions. Word has length 86 [2024-11-19 22:55:48,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:48,108 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 225 transitions. [2024-11-19 22:55:48,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.0714285714285716) internal successors, (86), 28 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:48,108 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 225 transitions. [2024-11-19 22:55:48,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-19 22:55:48,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:48,109 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:48,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-19 22:55:48,109 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:48,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:48,109 INFO L85 PathProgramCache]: Analyzing trace with hash 91928287, now seen corresponding path program 1 times [2024-11-19 22:55:48,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:48,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974629162] [2024-11-19 22:55:48,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:48,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:48,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:48,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:48,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974629162] [2024-11-19 22:55:48,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974629162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:48,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:48,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 22:55:48,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854770436] [2024-11-19 22:55:48,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:48,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 22:55:48,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:48,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 22:55:48,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:55:48,570 INFO L87 Difference]: Start difference. First operand 184 states and 225 transitions. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:48,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:48,936 INFO L93 Difference]: Finished difference Result 262 states and 336 transitions. [2024-11-19 22:55:48,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 22:55:48,937 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-11-19 22:55:48,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:48,938 INFO L225 Difference]: With dead ends: 262 [2024-11-19 22:55:48,938 INFO L226 Difference]: Without dead ends: 256 [2024-11-19 22:55:48,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2024-11-19 22:55:48,938 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 831 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:48,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 1185 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:55:48,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-19 22:55:48,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 157. [2024-11-19 22:55:48,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.2371794871794872) internal successors, (193), 156 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:48,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 193 transitions. [2024-11-19 22:55:48,941 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 193 transitions. Word has length 87 [2024-11-19 22:55:48,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:48,941 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 193 transitions. [2024-11-19 22:55:48,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:48,941 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 193 transitions. [2024-11-19 22:55:48,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-19 22:55:48,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:48,942 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:48,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-19 22:55:48,942 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:48,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:48,943 INFO L85 PathProgramCache]: Analyzing trace with hash -2132814901, now seen corresponding path program 1 times [2024-11-19 22:55:48,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:48,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694733368] [2024-11-19 22:55:48,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:48,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:49,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:49,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:49,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694733368] [2024-11-19 22:55:49,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694733368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:49,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:49,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:55:49,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902026088] [2024-11-19 22:55:49,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:49,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 22:55:49,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:49,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 22:55:49,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:55:49,082 INFO L87 Difference]: Start difference. First operand 157 states and 193 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:49,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:49,279 INFO L93 Difference]: Finished difference Result 807 states and 1143 transitions. [2024-11-19 22:55:49,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 22:55:49,279 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2024-11-19 22:55:49,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:49,281 INFO L225 Difference]: With dead ends: 807 [2024-11-19 22:55:49,282 INFO L226 Difference]: Without dead ends: 742 [2024-11-19 22:55:49,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-19 22:55:49,282 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 1268 mSDsluCounter, 1954 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1268 SdHoareTripleChecker+Valid, 2157 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:49,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1268 Valid, 2157 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:55:49,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2024-11-19 22:55:49,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 220. [2024-11-19 22:55:49,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 1.3013698630136987) internal successors, (285), 219 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:49,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 285 transitions. [2024-11-19 22:55:49,291 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 285 transitions. Word has length 114 [2024-11-19 22:55:49,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:49,293 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 285 transitions. [2024-11-19 22:55:49,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:49,293 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 285 transitions. [2024-11-19 22:55:49,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 22:55:49,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:49,294 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:49,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-19 22:55:49,294 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:49,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:49,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1778175941, now seen corresponding path program 1 times [2024-11-19 22:55:49,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:49,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926525218] [2024-11-19 22:55:49,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:49,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:49,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:49,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:49,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926525218] [2024-11-19 22:55:49,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926525218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:49,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:49,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:55:49,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167770016] [2024-11-19 22:55:49,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:49,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 22:55:49,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:49,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 22:55:49,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:55:49,443 INFO L87 Difference]: Start difference. First operand 220 states and 285 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:49,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:49,553 INFO L93 Difference]: Finished difference Result 925 states and 1313 transitions. [2024-11-19 22:55:49,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 22:55:49,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2024-11-19 22:55:49,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:49,556 INFO L225 Difference]: With dead ends: 925 [2024-11-19 22:55:49,556 INFO L226 Difference]: Without dead ends: 797 [2024-11-19 22:55:49,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-19 22:55:49,557 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 1034 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1034 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:49,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1034 Valid, 1201 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:55:49,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2024-11-19 22:55:49,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 346. [2024-11-19 22:55:49,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 345 states have (on average 1.3623188405797102) internal successors, (470), 345 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:49,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 470 transitions. [2024-11-19 22:55:49,565 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 470 transitions. Word has length 116 [2024-11-19 22:55:49,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:49,565 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 470 transitions. [2024-11-19 22:55:49,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:49,566 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 470 transitions. [2024-11-19 22:55:49,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 22:55:49,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:49,567 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:49,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-19 22:55:49,567 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:49,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:49,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1881237749, now seen corresponding path program 1 times [2024-11-19 22:55:49,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:49,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292550694] [2024-11-19 22:55:49,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:49,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:49,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:49,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:49,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292550694] [2024-11-19 22:55:49,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292550694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:49,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:49,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:55:49,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453359994] [2024-11-19 22:55:49,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:49,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 22:55:49,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:49,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 22:55:49,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:55:49,711 INFO L87 Difference]: Start difference. First operand 346 states and 470 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:49,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:49,824 INFO L93 Difference]: Finished difference Result 1051 states and 1498 transitions. [2024-11-19 22:55:49,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 22:55:49,825 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2024-11-19 22:55:49,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:49,835 INFO L225 Difference]: With dead ends: 1051 [2024-11-19 22:55:49,835 INFO L226 Difference]: Without dead ends: 923 [2024-11-19 22:55:49,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-19 22:55:49,836 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 1034 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1034 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:49,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1034 Valid, 1131 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:55:49,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2024-11-19 22:55:49,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 535. [2024-11-19 22:55:49,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 534 states have (on average 1.398876404494382) internal successors, (747), 534 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:49,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 747 transitions. [2024-11-19 22:55:49,846 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 747 transitions. Word has length 116 [2024-11-19 22:55:49,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:49,847 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 747 transitions. [2024-11-19 22:55:49,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:49,847 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 747 transitions. [2024-11-19 22:55:49,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 22:55:49,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:49,848 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:49,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-19 22:55:49,848 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:49,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:49,849 INFO L85 PathProgramCache]: Analyzing trace with hash -455453719, now seen corresponding path program 1 times [2024-11-19 22:55:49,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:49,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280864137] [2024-11-19 22:55:49,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:49,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:49,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:49,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:49,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:49,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280864137] [2024-11-19 22:55:49,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280864137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:49,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:49,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:55:49,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374292576] [2024-11-19 22:55:49,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:49,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 22:55:49,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:49,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 22:55:49,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:55:49,983 INFO L87 Difference]: Start difference. First operand 535 states and 747 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:50,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:50,092 INFO L93 Difference]: Finished difference Result 1177 states and 1683 transitions. [2024-11-19 22:55:50,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 22:55:50,092 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2024-11-19 22:55:50,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:50,095 INFO L225 Difference]: With dead ends: 1177 [2024-11-19 22:55:50,095 INFO L226 Difference]: Without dead ends: 1049 [2024-11-19 22:55:50,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-19 22:55:50,096 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 1109 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:50,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1109 Valid, 1156 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:55:50,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2024-11-19 22:55:50,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 661. [2024-11-19 22:55:50,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 660 states have (on average 1.412121212121212) internal successors, (932), 660 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:50,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 932 transitions. [2024-11-19 22:55:50,106 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 932 transitions. Word has length 116 [2024-11-19 22:55:50,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:50,106 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 932 transitions. [2024-11-19 22:55:50,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:50,106 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 932 transitions. [2024-11-19 22:55:50,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 22:55:50,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:50,107 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:50,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-19 22:55:50,107 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:50,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:50,108 INFO L85 PathProgramCache]: Analyzing trace with hash 2067568748, now seen corresponding path program 1 times [2024-11-19 22:55:50,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:50,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448351520] [2024-11-19 22:55:50,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:50,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:50,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:50,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:50,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448351520] [2024-11-19 22:55:50,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448351520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:50,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:50,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:55:50,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597928373] [2024-11-19 22:55:50,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:50,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 22:55:50,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:50,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 22:55:50,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:55:50,343 INFO L87 Difference]: Start difference. First operand 661 states and 932 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:50,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:50,441 INFO L93 Difference]: Finished difference Result 1232 states and 1767 transitions. [2024-11-19 22:55:50,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 22:55:50,441 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2024-11-19 22:55:50,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:50,442 INFO L225 Difference]: With dead ends: 1232 [2024-11-19 22:55:50,442 INFO L226 Difference]: Without dead ends: 663 [2024-11-19 22:55:50,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-19 22:55:50,444 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 172 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:50,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 550 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:55:50,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2024-11-19 22:55:50,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 661. [2024-11-19 22:55:50,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 660 states have (on average 1.4045454545454545) internal successors, (927), 660 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:50,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 927 transitions. [2024-11-19 22:55:50,454 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 927 transitions. Word has length 116 [2024-11-19 22:55:50,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:50,454 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 927 transitions. [2024-11-19 22:55:50,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:50,454 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 927 transitions. [2024-11-19 22:55:50,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 22:55:50,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:50,455 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:50,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-19 22:55:50,456 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:50,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:50,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1298275755, now seen corresponding path program 1 times [2024-11-19 22:55:50,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:50,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489366303] [2024-11-19 22:55:50,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:50,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:50,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:50,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:50,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489366303] [2024-11-19 22:55:50,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489366303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:50,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:50,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:55:50,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388240379] [2024-11-19 22:55:50,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:50,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:55:50,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:50,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:55:50,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:55:50,518 INFO L87 Difference]: Start difference. First operand 661 states and 927 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:50,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:50,544 INFO L93 Difference]: Finished difference Result 1741 states and 2488 transitions. [2024-11-19 22:55:50,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:55:50,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2024-11-19 22:55:50,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:50,547 INFO L225 Difference]: With dead ends: 1741 [2024-11-19 22:55:50,547 INFO L226 Difference]: Without dead ends: 1172 [2024-11-19 22:55:50,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:55:50,548 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 82 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:50,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 449 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:55:50,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2024-11-19 22:55:50,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1170. [2024-11-19 22:55:50,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 1169 states have (on average 1.4029084687767321) internal successors, (1640), 1169 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:50,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1640 transitions. [2024-11-19 22:55:50,564 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1640 transitions. Word has length 116 [2024-11-19 22:55:50,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:50,564 INFO L471 AbstractCegarLoop]: Abstraction has 1170 states and 1640 transitions. [2024-11-19 22:55:50,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:50,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1640 transitions. [2024-11-19 22:55:50,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 22:55:50,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:50,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, 1] [2024-11-19 22:55:50,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-19 22:55:50,566 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:50,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:50,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1451686365, now seen corresponding path program 1 times [2024-11-19 22:55:50,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:50,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211356596] [2024-11-19 22:55:50,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:50,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:50,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:50,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:50,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:50,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211356596] [2024-11-19 22:55:50,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211356596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:50,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:50,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:55:50,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580803362] [2024-11-19 22:55:50,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:50,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 22:55:50,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:50,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 22:55:50,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:55:50,724 INFO L87 Difference]: Start difference. First operand 1170 states and 1640 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:50,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:50,851 INFO L93 Difference]: Finished difference Result 2377 states and 3366 transitions. [2024-11-19 22:55:50,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 22:55:50,851 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2024-11-19 22:55:50,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:50,855 INFO L225 Difference]: With dead ends: 2377 [2024-11-19 22:55:50,855 INFO L226 Difference]: Without dead ends: 2136 [2024-11-19 22:55:50,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-19 22:55:50,856 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 1025 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:50,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 1195 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:55:50,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2024-11-19 22:55:50,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 1409. [2024-11-19 22:55:50,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1409 states, 1408 states have (on average 1.4076704545454546) internal successors, (1982), 1408 states have internal predecessors, (1982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:50,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1409 states and 1982 transitions. [2024-11-19 22:55:50,875 INFO L78 Accepts]: Start accepts. Automaton has 1409 states and 1982 transitions. Word has length 116 [2024-11-19 22:55:50,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:50,876 INFO L471 AbstractCegarLoop]: Abstraction has 1409 states and 1982 transitions. [2024-11-19 22:55:50,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:50,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 1982 transitions. [2024-11-19 22:55:50,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 22:55:50,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:50,877 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:50,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-19 22:55:50,877 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:50,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:50,878 INFO L85 PathProgramCache]: Analyzing trace with hash -871511505, now seen corresponding path program 1 times [2024-11-19 22:55:50,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:50,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655998575] [2024-11-19 22:55:50,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:50,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:50,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:51,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:51,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:51,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655998575] [2024-11-19 22:55:51,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655998575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:51,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:51,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:55:51,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236704266] [2024-11-19 22:55:51,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:51,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 22:55:51,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:51,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 22:55:51,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:55:51,018 INFO L87 Difference]: Start difference. First operand 1409 states and 1982 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:51,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:51,111 INFO L93 Difference]: Finished difference Result 2616 states and 3708 transitions. [2024-11-19 22:55:51,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 22:55:51,111 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2024-11-19 22:55:51,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:51,114 INFO L225 Difference]: With dead ends: 2616 [2024-11-19 22:55:51,114 INFO L226 Difference]: Without dead ends: 2375 [2024-11-19 22:55:51,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-19 22:55:51,115 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 965 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:51,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 1326 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:55:51,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2375 states. [2024-11-19 22:55:51,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2375 to 1648. [2024-11-19 22:55:51,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1647 states have (on average 1.4110503946569521) internal successors, (2324), 1647 states have internal predecessors, (2324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:51,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2324 transitions. [2024-11-19 22:55:51,140 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2324 transitions. Word has length 116 [2024-11-19 22:55:51,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:51,140 INFO L471 AbstractCegarLoop]: Abstraction has 1648 states and 2324 transitions. [2024-11-19 22:55:51,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:51,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2324 transitions. [2024-11-19 22:55:51,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-19 22:55:51,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:51,142 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:51,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-19 22:55:51,142 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:51,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:51,143 INFO L85 PathProgramCache]: Analyzing trace with hash -389045736, now seen corresponding path program 1 times [2024-11-19 22:55:51,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:51,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273727212] [2024-11-19 22:55:51,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:51,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:51,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:51,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:51,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273727212] [2024-11-19 22:55:51,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273727212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:51,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:51,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:55:51,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614152838] [2024-11-19 22:55:51,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:51,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:55:51,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:51,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:55:51,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:55:51,252 INFO L87 Difference]: Start difference. First operand 1648 states and 2324 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:51,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:51,277 INFO L93 Difference]: Finished difference Result 4123 states and 5839 transitions. [2024-11-19 22:55:51,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:55:51,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2024-11-19 22:55:51,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:51,281 INFO L225 Difference]: With dead ends: 4123 [2024-11-19 22:55:51,281 INFO L226 Difference]: Without dead ends: 2567 [2024-11-19 22:55:51,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:55:51,284 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 95 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:51,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 418 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:55:51,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2567 states. [2024-11-19 22:55:51,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 2461. [2024-11-19 22:55:51,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2461 states, 2460 states have (on average 1.4048780487804877) internal successors, (3456), 2460 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:51,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2461 states to 2461 states and 3456 transitions. [2024-11-19 22:55:51,316 INFO L78 Accepts]: Start accepts. Automaton has 2461 states and 3456 transitions. Word has length 117 [2024-11-19 22:55:51,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:51,317 INFO L471 AbstractCegarLoop]: Abstraction has 2461 states and 3456 transitions. [2024-11-19 22:55:51,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:51,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 3456 transitions. [2024-11-19 22:55:51,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 22:55:51,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:51,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, 1, 1, 1] [2024-11-19 22:55:51,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-19 22:55:51,319 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:51,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:51,320 INFO L85 PathProgramCache]: Analyzing trace with hash 966003247, now seen corresponding path program 1 times [2024-11-19 22:55:51,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:51,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127172997] [2024-11-19 22:55:51,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:51,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:51,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:51,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:51,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127172997] [2024-11-19 22:55:51,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127172997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:51,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:51,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:55:51,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781926768] [2024-11-19 22:55:51,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:51,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:55:51,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:51,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:55:51,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:55:51,437 INFO L87 Difference]: Start difference. First operand 2461 states and 3456 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:51,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:51,467 INFO L93 Difference]: Finished difference Result 7043 states and 9899 transitions. [2024-11-19 22:55:51,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:55:51,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2024-11-19 22:55:51,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:51,474 INFO L225 Difference]: With dead ends: 7043 [2024-11-19 22:55:51,474 INFO L226 Difference]: Without dead ends: 4674 [2024-11-19 22:55:51,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:55:51,478 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 88 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:51,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 418 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:55:51,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4674 states. [2024-11-19 22:55:51,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4674 to 4516. [2024-11-19 22:55:51,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4516 states, 4515 states have (on average 1.3966777408637874) internal successors, (6306), 4515 states have internal predecessors, (6306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:51,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4516 states to 4516 states and 6306 transitions. [2024-11-19 22:55:51,527 INFO L78 Accepts]: Start accepts. Automaton has 4516 states and 6306 transitions. Word has length 118 [2024-11-19 22:55:51,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:51,527 INFO L471 AbstractCegarLoop]: Abstraction has 4516 states and 6306 transitions. [2024-11-19 22:55:51,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:51,528 INFO L276 IsEmpty]: Start isEmpty. Operand 4516 states and 6306 transitions. [2024-11-19 22:55:51,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-19 22:55:51,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:51,529 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:51,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-11-19 22:55:51,532 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:51,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:51,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1314946245, now seen corresponding path program 1 times [2024-11-19 22:55:51,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:51,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294930163] [2024-11-19 22:55:51,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:51,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:51,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:51,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:51,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294930163] [2024-11-19 22:55:51,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294930163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:51,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:51,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:55:51,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78760710] [2024-11-19 22:55:51,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:51,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:55:51,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:51,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:55:51,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:55:51,637 INFO L87 Difference]: Start difference. First operand 4516 states and 6306 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:51,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:51,677 INFO L93 Difference]: Finished difference Result 13052 states and 18176 transitions. [2024-11-19 22:55:51,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:55:51,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2024-11-19 22:55:51,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:51,690 INFO L225 Difference]: With dead ends: 13052 [2024-11-19 22:55:51,691 INFO L226 Difference]: Without dead ends: 8628 [2024-11-19 22:55:51,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:55:51,698 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 81 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:51,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 418 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:55:51,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8628 states. [2024-11-19 22:55:51,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8628 to 8314. [2024-11-19 22:55:51,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8314 states, 8313 states have (on average 1.3832551425478166) internal successors, (11499), 8313 states have internal predecessors, (11499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:51,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8314 states to 8314 states and 11499 transitions. [2024-11-19 22:55:51,796 INFO L78 Accepts]: Start accepts. Automaton has 8314 states and 11499 transitions. Word has length 119 [2024-11-19 22:55:51,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:51,796 INFO L471 AbstractCegarLoop]: Abstraction has 8314 states and 11499 transitions. [2024-11-19 22:55:51,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:51,796 INFO L276 IsEmpty]: Start isEmpty. Operand 8314 states and 11499 transitions. [2024-11-19 22:55:51,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-19 22:55:51,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:51,797 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:51,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-11-19 22:55:51,798 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:51,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:51,798 INFO L85 PathProgramCache]: Analyzing trace with hash -590316034, now seen corresponding path program 1 times [2024-11-19 22:55:51,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:51,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954047661] [2024-11-19 22:55:51,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:51,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:51,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:51,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:51,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954047661] [2024-11-19 22:55:51,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954047661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:51,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:51,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:55:51,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27731693] [2024-11-19 22:55:51,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:51,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:55:51,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:51,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:55:51,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:55:51,909 INFO L87 Difference]: Start difference. First operand 8314 states and 11499 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:51,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:51,967 INFO L93 Difference]: Finished difference Result 24134 states and 33209 transitions. [2024-11-19 22:55:51,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:55:51,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2024-11-19 22:55:51,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:51,993 INFO L225 Difference]: With dead ends: 24134 [2024-11-19 22:55:51,993 INFO L226 Difference]: Without dead ends: 15912 [2024-11-19 22:55:52,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:55:52,007 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 74 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:52,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 417 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:55:52,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15912 states. [2024-11-19 22:55:52,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15912 to 15286. [2024-11-19 22:55:52,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15286 states, 15285 states have (on average 1.3654563297350344) internal successors, (20871), 15285 states have internal predecessors, (20871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:52,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15286 states to 15286 states and 20871 transitions. [2024-11-19 22:55:52,275 INFO L78 Accepts]: Start accepts. Automaton has 15286 states and 20871 transitions. Word has length 120 [2024-11-19 22:55:52,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:52,275 INFO L471 AbstractCegarLoop]: Abstraction has 15286 states and 20871 transitions. [2024-11-19 22:55:52,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:52,276 INFO L276 IsEmpty]: Start isEmpty. Operand 15286 states and 20871 transitions. [2024-11-19 22:55:52,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-19 22:55:52,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:52,276 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:52,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-11-19 22:55:52,277 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:52,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:52,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1670009354, now seen corresponding path program 1 times [2024-11-19 22:55:52,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:52,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209396142] [2024-11-19 22:55:52,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:52,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:52,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:52,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:52,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209396142] [2024-11-19 22:55:52,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209396142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:52,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:52,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:55:52,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063626948] [2024-11-19 22:55:52,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:52,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:55:52,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:52,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:55:52,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:55:52,384 INFO L87 Difference]: Start difference. First operand 15286 states and 20871 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:52,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:52,488 INFO L93 Difference]: Finished difference Result 44426 states and 60233 transitions. [2024-11-19 22:55:52,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:55:52,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2024-11-19 22:55:52,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:52,539 INFO L225 Difference]: With dead ends: 44426 [2024-11-19 22:55:52,539 INFO L226 Difference]: Without dead ends: 29232 [2024-11-19 22:55:52,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:55:52,561 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 64 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:52,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 415 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:55:52,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29232 states. [2024-11-19 22:55:52,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29232 to 27982. [2024-11-19 22:55:53,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27982 states, 27981 states have (on average 1.3433043851184732) internal successors, (37587), 27981 states have internal predecessors, (37587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:53,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27982 states to 27982 states and 37587 transitions. [2024-11-19 22:55:53,069 INFO L78 Accepts]: Start accepts. Automaton has 27982 states and 37587 transitions. Word has length 121 [2024-11-19 22:55:53,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:53,069 INFO L471 AbstractCegarLoop]: Abstraction has 27982 states and 37587 transitions. [2024-11-19 22:55:53,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:53,070 INFO L276 IsEmpty]: Start isEmpty. Operand 27982 states and 37587 transitions. [2024-11-19 22:55:53,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-19 22:55:53,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:53,071 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:53,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-11-19 22:55:53,071 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:53,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:53,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1801378661, now seen corresponding path program 1 times [2024-11-19 22:55:53,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:53,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925904690] [2024-11-19 22:55:53,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:53,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:53,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:53,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:53,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925904690] [2024-11-19 22:55:53,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925904690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:53,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:53,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 22:55:53,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415796611] [2024-11-19 22:55:53,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:53,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:55:53,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:53,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:55:53,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:55:53,392 INFO L87 Difference]: Start difference. First operand 27982 states and 37587 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:53,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:53,489 INFO L93 Difference]: Finished difference Result 28560 states and 38356 transitions. [2024-11-19 22:55:53,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 22:55:53,490 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2024-11-19 22:55:53,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:53,539 INFO L225 Difference]: With dead ends: 28560 [2024-11-19 22:55:53,540 INFO L226 Difference]: Without dead ends: 28558 [2024-11-19 22:55:53,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:55:53,551 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 0 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:53,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 928 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:55:53,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28558 states. [2024-11-19 22:55:53,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28558 to 28558. [2024-11-19 22:55:53,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28558 states, 28557 states have (on average 1.3285359106348706) internal successors, (37939), 28557 states have internal predecessors, (37939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:54,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28558 states to 28558 states and 37939 transitions. [2024-11-19 22:55:54,107 INFO L78 Accepts]: Start accepts. Automaton has 28558 states and 37939 transitions. Word has length 122 [2024-11-19 22:55:54,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:54,107 INFO L471 AbstractCegarLoop]: Abstraction has 28558 states and 37939 transitions. [2024-11-19 22:55:54,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:54,108 INFO L276 IsEmpty]: Start isEmpty. Operand 28558 states and 37939 transitions. [2024-11-19 22:55:54,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-19 22:55:54,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:54,118 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:54,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-11-19 22:55:54,119 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:54,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:54,119 INFO L85 PathProgramCache]: Analyzing trace with hash -66701655, now seen corresponding path program 1 times [2024-11-19 22:55:54,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:54,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264022848] [2024-11-19 22:55:54,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:54,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:54,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:54,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:54,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264022848] [2024-11-19 22:55:54,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264022848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:55:54,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:55:54,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:55:54,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188651361] [2024-11-19 22:55:54,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:55:54,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:55:54,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:54,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:55:54,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:55:54,345 INFO L87 Difference]: Start difference. First operand 28558 states and 37939 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:54,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:55:54,452 INFO L93 Difference]: Finished difference Result 57778 states and 76789 transitions. [2024-11-19 22:55:54,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:55:54,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2024-11-19 22:55:54,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:55:54,499 INFO L225 Difference]: With dead ends: 57778 [2024-11-19 22:55:54,499 INFO L226 Difference]: Without dead ends: 29312 [2024-11-19 22:55:54,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:55:54,530 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 107 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:55:54,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 345 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:55:54,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29312 states. [2024-11-19 22:55:54,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29312 to 29310. [2024-11-19 22:55:54,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29310 states, 29309 states have (on average 1.31410147053806) internal successors, (38515), 29309 states have internal predecessors, (38515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:55,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29310 states to 29310 states and 38515 transitions. [2024-11-19 22:55:55,014 INFO L78 Accepts]: Start accepts. Automaton has 29310 states and 38515 transitions. Word has length 122 [2024-11-19 22:55:55,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:55:55,014 INFO L471 AbstractCegarLoop]: Abstraction has 29310 states and 38515 transitions. [2024-11-19 22:55:55,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:55:55,014 INFO L276 IsEmpty]: Start isEmpty. Operand 29310 states and 38515 transitions. [2024-11-19 22:55:55,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-19 22:55:55,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:55:55,021 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:55:55,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-11-19 22:55:55,022 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-19 22:55:55,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:55:55,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1114959982, now seen corresponding path program 1 times [2024-11-19 22:55:55,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:55:55,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253009435] [2024-11-19 22:55:55,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:55,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:55:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:55,712 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:55,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:55:55,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253009435] [2024-11-19 22:55:55,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253009435] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:55:55,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358063691] [2024-11-19 22:55:55,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:55:55,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:55:55,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:55:55,716 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-11-19 22:55:55,717 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-11-19 22:55:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:55:56,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 22:55:56,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:55:56,990 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:56,990 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:55:58,798 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:55:58,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358063691] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:55:58,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:55:58,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 27 [2024-11-19 22:55:58,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113913581] [2024-11-19 22:55:58,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:55:58,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-19 22:55:58,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:55:58,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-19 22:55:58,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2024-11-19 22:55:58,802 INFO L87 Difference]: Start difference. First operand 29310 states and 38515 transitions. Second operand has 28 states, 28 states have (on average 12.892857142857142) internal successors, (361), 27 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)