./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.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 876148c876cf7c1b78d2f058097c1ea19d5931075241b9f9a3c243e2bacc58fd --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:43:07,404 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:43:07,489 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:43:07,493 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:43:07,493 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:43:07,514 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:43:07,515 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:43:07,516 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:43:07,517 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:43:07,519 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:43:07,519 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:43:07,519 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:43:07,520 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:43:07,520 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:43:07,520 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:43:07,523 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:43:07,523 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:43:07,523 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:43:07,523 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:43:07,524 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:43:07,524 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:43:07,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:43:07,525 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:43:07,525 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:43:07,525 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:43:07,526 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:43:07,526 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:43:07,526 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:43:07,526 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:43:07,527 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:43:07,527 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:43:07,527 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:43:07,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:43:07,528 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:43:07,528 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:43:07,528 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:43:07,528 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:43:07,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:43:07,529 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:43:07,529 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:43:07,530 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:43:07,530 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:43:07,530 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 -> 876148c876cf7c1b78d2f058097c1ea19d5931075241b9f9a3c243e2bacc58fd [2024-11-11 21:43:07,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:43:07,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:43:07,801 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:43:07,803 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:43:07,804 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:43:07,805 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-11 21:43:09,381 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:43:09,732 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:43:09,734 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-11 21:43:09,753 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e245881b/20c9b054ce67412294705236f008b1f7/FLAGf8a4d309a [2024-11-11 21:43:09,950 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e245881b/20c9b054ce67412294705236f008b1f7 [2024-11-11 21:43:09,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:43:09,954 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:43:09,955 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:43:09,955 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:43:09,960 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:43:09,961 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:43:09" (1/1) ... [2024-11-11 21:43:09,962 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5844261a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:43:09, skipping insertion in model container [2024-11-11 21:43:09,962 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:43:09" (1/1) ... [2024-11-11 21:43:10,049 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:43:10,384 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.UNBOUNDED.pals.c.v+lhb-reducer.c[10927,10940] [2024-11-11 21:43:10,415 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.UNBOUNDED.pals.c.v+lhb-reducer.c[14764,14777] [2024-11-11 21:43:10,422 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.UNBOUNDED.pals.c.v+lhb-reducer.c[15985,15998] [2024-11-11 21:43:10,429 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.UNBOUNDED.pals.c.v+lhb-reducer.c[16691,16704] [2024-11-11 21:43:10,438 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.UNBOUNDED.pals.c.v+lhb-reducer.c[18235,18248] [2024-11-11 21:43:10,445 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.UNBOUNDED.pals.c.v+lhb-reducer.c[18941,18954] [2024-11-11 21:43:10,455 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.UNBOUNDED.pals.c.v+lhb-reducer.c[19970,19983] [2024-11-11 21:43:10,466 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.UNBOUNDED.pals.c.v+lhb-reducer.c[22376,22389] [2024-11-11 21:43:10,480 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.UNBOUNDED.pals.c.v+lhb-reducer.c[23085,23098] [2024-11-11 21:43:10,487 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.UNBOUNDED.pals.c.v+lhb-reducer.c[24122,24135] [2024-11-11 21:43:10,506 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.UNBOUNDED.pals.c.v+lhb-reducer.c[26018,26031] [2024-11-11 21:43:10,543 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.UNBOUNDED.pals.c.v+lhb-reducer.c[29926,29939] [2024-11-11 21:43:10,550 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.UNBOUNDED.pals.c.v+lhb-reducer.c[30635,30648] [2024-11-11 21:43:10,556 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.UNBOUNDED.pals.c.v+lhb-reducer.c[31667,31680] [2024-11-11 21:43:10,568 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.UNBOUNDED.pals.c.v+lhb-reducer.c[33558,33571] [2024-11-11 21:43:10,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.UNBOUNDED.pals.c.v+lhb-reducer.c[36771,36784] [2024-11-11 21:43:10,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:43:10,846 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:43:10,903 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.UNBOUNDED.pals.c.v+lhb-reducer.c[10927,10940] [2024-11-11 21:43:10,917 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.UNBOUNDED.pals.c.v+lhb-reducer.c[14764,14777] [2024-11-11 21:43:10,922 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.UNBOUNDED.pals.c.v+lhb-reducer.c[15985,15998] [2024-11-11 21:43:10,926 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.UNBOUNDED.pals.c.v+lhb-reducer.c[16691,16704] [2024-11-11 21:43:10,931 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.UNBOUNDED.pals.c.v+lhb-reducer.c[18235,18248] [2024-11-11 21:43:10,935 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.UNBOUNDED.pals.c.v+lhb-reducer.c[18941,18954] [2024-11-11 21:43:10,939 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.UNBOUNDED.pals.c.v+lhb-reducer.c[19970,19983] [2024-11-11 21:43:10,946 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.UNBOUNDED.pals.c.v+lhb-reducer.c[22376,22389] [2024-11-11 21:43:10,949 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.UNBOUNDED.pals.c.v+lhb-reducer.c[23085,23098] [2024-11-11 21:43:10,953 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.UNBOUNDED.pals.c.v+lhb-reducer.c[24122,24135] [2024-11-11 21:43:10,959 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.UNBOUNDED.pals.c.v+lhb-reducer.c[26018,26031] [2024-11-11 21:43:10,973 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.UNBOUNDED.pals.c.v+lhb-reducer.c[29926,29939] [2024-11-11 21:43:10,976 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.UNBOUNDED.pals.c.v+lhb-reducer.c[30635,30648] [2024-11-11 21:43:10,981 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.UNBOUNDED.pals.c.v+lhb-reducer.c[31667,31680] [2024-11-11 21:43:10,987 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.UNBOUNDED.pals.c.v+lhb-reducer.c[33558,33571] [2024-11-11 21:43:10,999 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.UNBOUNDED.pals.c.v+lhb-reducer.c[36771,36784] [2024-11-11 21:43:11,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:43:11,125 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:43:11,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:43:11 WrapperNode [2024-11-11 21:43:11,125 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:43:11,126 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:43:11,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:43:11,126 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:43:11,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:43:11" (1/1) ... [2024-11-11 21:43:11,165 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:43:11" (1/1) ... [2024-11-11 21:43:11,270 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3577 [2024-11-11 21:43:11,270 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:43:11,271 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:43:11,271 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:43:11,271 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:43:11,283 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:43:11" (1/1) ... [2024-11-11 21:43:11,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:43:11" (1/1) ... [2024-11-11 21:43:11,297 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:43:11" (1/1) ... [2024-11-11 21:43:11,350 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-11 21:43:11,351 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:43:11" (1/1) ... [2024-11-11 21:43:11,351 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:43:11" (1/1) ... [2024-11-11 21:43:11,385 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:43:11" (1/1) ... [2024-11-11 21:43:11,410 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:43:11" (1/1) ... [2024-11-11 21:43:11,422 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:43:11" (1/1) ... [2024-11-11 21:43:11,435 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:43:11" (1/1) ... [2024-11-11 21:43:11,452 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:43:11,454 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:43:11,454 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:43:11,454 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:43:11,456 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:43:11" (1/1) ... [2024-11-11 21:43:11,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:43:11,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:43:11,488 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-11 21:43:11,491 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-11 21:43:11,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:43:11,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:43:11,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:43:11,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:43:11,719 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:43:11,721 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:43:13,533 INFO L? ?]: Removed 539 outVars from TransFormulas that were not future-live. [2024-11-11 21:43:13,533 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:43:13,561 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:43:13,561 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-11 21:43:13,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:43:13 BoogieIcfgContainer [2024-11-11 21:43:13,562 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:43:13,568 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:43:13,568 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:43:13,572 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:43:13,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:43:09" (1/3) ... [2024-11-11 21:43:13,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1de494d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:43:13, skipping insertion in model container [2024-11-11 21:43:13,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:43:11" (2/3) ... [2024-11-11 21:43:13,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1de494d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:43:13, skipping insertion in model container [2024-11-11 21:43:13,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:43:13" (3/3) ... [2024-11-11 21:43:13,575 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-11 21:43:13,592 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:43:13,592 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-11-11 21:43:13,687 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:43:13,698 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;@1e247d51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:43:13,698 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-11 21:43:13,708 INFO L276 IsEmpty]: Start isEmpty. Operand has 626 states, 609 states have (on average 1.8505747126436782) internal successors, (1127), 625 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:13,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-11 21:43:13,731 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:13,732 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:13,733 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:13,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:13,738 INFO L85 PathProgramCache]: Analyzing trace with hash -50607350, now seen corresponding path program 1 times [2024-11-11 21:43:13,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:13,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229274318] [2024-11-11 21:43:13,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:13,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:14,321 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-11 21:43:14,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:14,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229274318] [2024-11-11 21:43:14,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229274318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:14,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:14,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:43:14,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538417880] [2024-11-11 21:43:14,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:14,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:43:14,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:14,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:43:14,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:43:14,354 INFO L87 Difference]: Start difference. First operand has 626 states, 609 states have (on average 1.8505747126436782) internal successors, (1127), 625 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:14,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:14,867 INFO L93 Difference]: Finished difference Result 971 states and 1686 transitions. [2024-11-11 21:43:14,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:43:14,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-11 21:43:14,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:14,882 INFO L225 Difference]: With dead ends: 971 [2024-11-11 21:43:14,883 INFO L226 Difference]: Without dead ends: 498 [2024-11-11 21:43:14,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:43:14,891 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 2526 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2526 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:14,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2526 Valid, 603 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:43:14,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2024-11-11 21:43:14,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2024-11-11 21:43:14,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 482 states have (on average 1.3112033195020747) internal successors, (632), 497 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:14,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 632 transitions. [2024-11-11 21:43:14,959 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 632 transitions. Word has length 71 [2024-11-11 21:43:14,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:14,960 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 632 transitions. [2024-11-11 21:43:14,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:14,961 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 632 transitions. [2024-11-11 21:43:14,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-11 21:43:14,967 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:14,967 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:14,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:43:14,968 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:14,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:14,968 INFO L85 PathProgramCache]: Analyzing trace with hash -329897172, now seen corresponding path program 1 times [2024-11-11 21:43:14,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:14,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622521017] [2024-11-11 21:43:14,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:14,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:15,191 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-11 21:43:15,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:15,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622521017] [2024-11-11 21:43:15,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622521017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:15,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:15,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:43:15,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396989003] [2024-11-11 21:43:15,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:15,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:43:15,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:15,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:43:15,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:43:15,195 INFO L87 Difference]: Start difference. First operand 498 states and 632 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:15,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:15,597 INFO L93 Difference]: Finished difference Result 834 states and 1087 transitions. [2024-11-11 21:43:15,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:43:15,597 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-11 21:43:15,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:15,600 INFO L225 Difference]: With dead ends: 834 [2024-11-11 21:43:15,600 INFO L226 Difference]: Without dead ends: 458 [2024-11-11 21:43:15,602 INFO L434 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-11 21:43:15,603 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 1648 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1648 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:15,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1648 Valid, 328 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:43:15,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-11-11 21:43:15,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2024-11-11 21:43:15,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 442 states have (on average 1.3190045248868778) internal successors, (583), 457 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:15,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 583 transitions. [2024-11-11 21:43:15,630 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 583 transitions. Word has length 72 [2024-11-11 21:43:15,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:15,631 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 583 transitions. [2024-11-11 21:43:15,631 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-11 21:43:15,631 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 583 transitions. [2024-11-11 21:43:15,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-11 21:43:15,633 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:15,633 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:15,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:43:15,634 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:15,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:15,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1203518485, now seen corresponding path program 1 times [2024-11-11 21:43:15,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:15,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166871801] [2024-11-11 21:43:15,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:15,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:15,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:15,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:15,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:15,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166871801] [2024-11-11 21:43:15,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166871801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:15,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:15,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:43:15,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385522654] [2024-11-11 21:43:15,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:15,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:43:15,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:15,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:43:15,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:43:15,800 INFO L87 Difference]: Start difference. First operand 458 states and 583 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-11 21:43:16,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:16,130 INFO L93 Difference]: Finished difference Result 794 states and 1037 transitions. [2024-11-11 21:43:16,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:43:16,130 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-11 21:43:16,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:16,132 INFO L225 Difference]: With dead ends: 794 [2024-11-11 21:43:16,133 INFO L226 Difference]: Without dead ends: 426 [2024-11-11 21:43:16,133 INFO L434 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-11 21:43:16,134 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 1555 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1555 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:16,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1555 Valid, 322 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:43:16,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-11-11 21:43:16,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2024-11-11 21:43:16,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 410 states have (on average 1.3317073170731708) internal successors, (546), 425 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:16,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 546 transitions. [2024-11-11 21:43:16,144 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 546 transitions. Word has length 73 [2024-11-11 21:43:16,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:16,145 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 546 transitions. [2024-11-11 21:43:16,145 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-11 21:43:16,145 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 546 transitions. [2024-11-11 21:43:16,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-11 21:43:16,147 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:16,147 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:16,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 21:43:16,147 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:16,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:16,148 INFO L85 PathProgramCache]: Analyzing trace with hash -2052061875, now seen corresponding path program 1 times [2024-11-11 21:43:16,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:16,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882108449] [2024-11-11 21:43:16,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:16,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:16,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:16,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:16,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882108449] [2024-11-11 21:43:16,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882108449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:16,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:16,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:43:16,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508884435] [2024-11-11 21:43:16,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:16,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:43:16,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:16,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:43:16,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:43:16,335 INFO L87 Difference]: Start difference. First operand 426 states and 546 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-11 21:43:16,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:16,594 INFO L93 Difference]: Finished difference Result 762 states and 999 transitions. [2024-11-11 21:43:16,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:43:16,595 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-11 21:43:16,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:16,597 INFO L225 Difference]: With dead ends: 762 [2024-11-11 21:43:16,600 INFO L226 Difference]: Without dead ends: 401 [2024-11-11 21:43:16,601 INFO L434 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-11 21:43:16,602 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 1497 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1497 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:16,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1497 Valid, 309 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:43:16,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-11 21:43:16,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2024-11-11 21:43:16,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 385 states have (on average 1.3454545454545455) internal successors, (518), 400 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:16,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 518 transitions. [2024-11-11 21:43:16,614 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 518 transitions. Word has length 74 [2024-11-11 21:43:16,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:16,614 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 518 transitions. [2024-11-11 21:43:16,615 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-11 21:43:16,615 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 518 transitions. [2024-11-11 21:43:16,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-11 21:43:16,616 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:16,616 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:16,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 21:43:16,617 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:16,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:16,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1326375668, now seen corresponding path program 1 times [2024-11-11 21:43:16,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:16,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841333703] [2024-11-11 21:43:16,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:16,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:16,777 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-11 21:43:16,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:16,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841333703] [2024-11-11 21:43:16,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841333703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:16,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:16,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:43:16,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620626068] [2024-11-11 21:43:16,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:16,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:43:16,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:16,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:43:16,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:43:16,781 INFO L87 Difference]: Start difference. First operand 401 states and 518 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-11 21:43:17,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:17,036 INFO L93 Difference]: Finished difference Result 737 states and 970 transitions. [2024-11-11 21:43:17,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:43:17,037 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-11 21:43:17,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:17,039 INFO L225 Difference]: With dead ends: 737 [2024-11-11 21:43:17,039 INFO L226 Difference]: Without dead ends: 390 [2024-11-11 21:43:17,040 INFO L434 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-11 21:43:17,042 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 1445 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1445 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:17,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1445 Valid, 304 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:43:17,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-11 21:43:17,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2024-11-11 21:43:17,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3502673796791445) internal successors, (505), 389 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-11 21:43:17,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 505 transitions. [2024-11-11 21:43:17,052 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 505 transitions. Word has length 75 [2024-11-11 21:43:17,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:17,053 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 505 transitions. [2024-11-11 21:43:17,053 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-11 21:43:17,053 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 505 transitions. [2024-11-11 21:43:17,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-11 21:43:17,054 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:17,072 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:17,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 21:43:17,073 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:17,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:17,073 INFO L85 PathProgramCache]: Analyzing trace with hash -976633234, now seen corresponding path program 1 times [2024-11-11 21:43:17,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:17,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337356799] [2024-11-11 21:43:17,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:17,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:17,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-11 21:43:17,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:17,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337356799] [2024-11-11 21:43:17,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337356799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:17,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:17,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 21:43:17,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506695314] [2024-11-11 21:43:17,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:17,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 21:43:17,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:17,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 21:43:17,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:43:17,570 INFO L87 Difference]: Start difference. First operand 390 states and 505 transitions. Second operand has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 10 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-11 21:43:18,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:18,451 INFO L93 Difference]: Finished difference Result 672 states and 880 transitions. [2024-11-11 21:43:18,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 21:43:18,451 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 10 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-11 21:43:18,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:18,455 INFO L225 Difference]: With dead ends: 672 [2024-11-11 21:43:18,455 INFO L226 Difference]: Without dead ends: 591 [2024-11-11 21:43:18,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-11 21:43:18,457 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 2269 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2269 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:18,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2269 Valid, 1457 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 21:43:18,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-11-11 21:43:18,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 390. [2024-11-11 21:43:18,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3475935828877006) internal successors, (504), 389 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-11 21:43:18,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 504 transitions. [2024-11-11 21:43:18,470 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 504 transitions. Word has length 76 [2024-11-11 21:43:18,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:18,471 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 504 transitions. [2024-11-11 21:43:18,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 10 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-11 21:43:18,472 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 504 transitions. [2024-11-11 21:43:18,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-11 21:43:18,474 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:18,474 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:18,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 21:43:18,474 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:18,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:18,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1406136960, now seen corresponding path program 1 times [2024-11-11 21:43:18,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:18,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077959394] [2024-11-11 21:43:18,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:18,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:18,955 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-11 21:43:18,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:18,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077959394] [2024-11-11 21:43:18,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077959394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:18,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:18,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:43:18,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374321922] [2024-11-11 21:43:18,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:18,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:43:18,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:18,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:43:18,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:43:18,958 INFO L87 Difference]: Start difference. First operand 390 states and 504 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:19,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:19,645 INFO L93 Difference]: Finished difference Result 754 states and 960 transitions. [2024-11-11 21:43:19,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:43:19,645 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-11 21:43:19,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:19,647 INFO L225 Difference]: With dead ends: 754 [2024-11-11 21:43:19,647 INFO L226 Difference]: Without dead ends: 542 [2024-11-11 21:43:19,648 INFO L434 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-11 21:43:19,648 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 2066 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2066 SdHoareTripleChecker+Valid, 1140 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-11 21:43:19,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2066 Valid, 1140 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 21:43:19,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-11-11 21:43:19,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 390. [2024-11-11 21:43:19,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3449197860962567) internal successors, (503), 389 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-11 21:43:19,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 503 transitions. [2024-11-11 21:43:19,656 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 503 transitions. Word has length 76 [2024-11-11 21:43:19,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:19,656 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 503 transitions. [2024-11-11 21:43:19,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:19,657 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 503 transitions. [2024-11-11 21:43:19,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-11 21:43:19,658 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:19,658 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:19,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:43:19,658 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:19,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:19,659 INFO L85 PathProgramCache]: Analyzing trace with hash 649885335, now seen corresponding path program 1 times [2024-11-11 21:43:19,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:19,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744237880] [2024-11-11 21:43:19,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:19,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:19,980 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-11 21:43:19,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:19,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744237880] [2024-11-11 21:43:19,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744237880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:19,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:19,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:19,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255863613] [2024-11-11 21:43:19,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:19,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:19,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:19,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:19,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:19,983 INFO L87 Difference]: Start difference. First operand 390 states and 503 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 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-11 21:43:20,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:20,919 INFO L93 Difference]: Finished difference Result 733 states and 965 transitions. [2024-11-11 21:43:20,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:43:20,919 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 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-11 21:43:20,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:20,922 INFO L225 Difference]: With dead ends: 733 [2024-11-11 21:43:20,922 INFO L226 Difference]: Without dead ends: 605 [2024-11-11 21:43:20,922 INFO L434 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-11 21:43:20,924 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 2124 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2124 SdHoareTripleChecker+Valid, 2034 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:20,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2124 Valid, 2034 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1476 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 21:43:20,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-11 21:43:20,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 390. [2024-11-11 21:43:20,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3422459893048129) internal successors, (502), 389 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-11 21:43:20,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 502 transitions. [2024-11-11 21:43:20,936 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 502 transitions. Word has length 76 [2024-11-11 21:43:20,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:20,936 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 502 transitions. [2024-11-11 21:43:20,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 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-11 21:43:20,937 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 502 transitions. [2024-11-11 21:43:20,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-11 21:43:20,939 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:20,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:20,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 21:43:20,939 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:20,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:20,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1538930145, now seen corresponding path program 1 times [2024-11-11 21:43:20,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:20,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451067970] [2024-11-11 21:43:20,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:20,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:21,236 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-11 21:43:21,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:21,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451067970] [2024-11-11 21:43:21,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451067970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:21,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:21,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:21,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271080632] [2024-11-11 21:43:21,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:21,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:21,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:21,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:21,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:21,239 INFO L87 Difference]: Start difference. First operand 390 states and 502 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 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-11 21:43:21,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:21,891 INFO L93 Difference]: Finished difference Result 582 states and 741 transitions. [2024-11-11 21:43:21,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 21:43:21,891 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 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-11 21:43:21,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:21,893 INFO L225 Difference]: With dead ends: 582 [2024-11-11 21:43:21,893 INFO L226 Difference]: Without dead ends: 577 [2024-11-11 21:43:21,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-11 21:43:21,894 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 2260 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2260 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:21,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2260 Valid, 1216 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:43:21,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-11-11 21:43:21,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 390. [2024-11-11 21:43:21,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.339572192513369) internal successors, (501), 389 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-11 21:43:21,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 501 transitions. [2024-11-11 21:43:21,902 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 501 transitions. Word has length 76 [2024-11-11 21:43:21,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:21,902 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 501 transitions. [2024-11-11 21:43:21,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 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-11 21:43:21,903 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 501 transitions. [2024-11-11 21:43:21,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-11 21:43:21,904 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:21,904 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:21,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 21:43:21,904 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-11 21:43:21,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:21,905 INFO L85 PathProgramCache]: Analyzing trace with hash 684383254, now seen corresponding path program 1 times [2024-11-11 21:43:21,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:21,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127477020] [2024-11-11 21:43:21,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:21,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:21,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:22,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:22,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:22,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127477020] [2024-11-11 21:43:22,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127477020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:22,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:22,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:22,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801416733] [2024-11-11 21:43:22,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:22,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:22,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:22,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:22,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:22,216 INFO L87 Difference]: Start difference. First operand 390 states and 501 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:23,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:23,106 INFO L93 Difference]: Finished difference Result 699 states and 917 transitions. [2024-11-11 21:43:23,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 21:43:23,107 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-11 21:43:23,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:23,109 INFO L225 Difference]: With dead ends: 699 [2024-11-11 21:43:23,109 INFO L226 Difference]: Without dead ends: 601 [2024-11-11 21:43:23,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-11 21:43:23,111 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 1146 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1146 SdHoareTripleChecker+Valid, 1590 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:23,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1146 Valid, 1590 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 21:43:23,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-11 21:43:23,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 390. [2024-11-11 21:43:23,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3368983957219251) internal successors, (500), 389 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-11 21:43:23,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 500 transitions. [2024-11-11 21:43:23,122 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 500 transitions. Word has length 78 [2024-11-11 21:43:23,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:23,122 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 500 transitions. [2024-11-11 21:43:23,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:23,123 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 500 transitions. [2024-11-11 21:43:23,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-11 21:43:23,124 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:23,124 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:23,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 21:43:23,125 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-11 21:43:23,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:23,125 INFO L85 PathProgramCache]: Analyzing trace with hash 275538026, now seen corresponding path program 1 times [2024-11-11 21:43:23,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:23,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685954016] [2024-11-11 21:43:23,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:23,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:23,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:23,444 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-11 21:43:23,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:23,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685954016] [2024-11-11 21:43:23,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685954016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:23,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:23,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:23,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974367231] [2024-11-11 21:43:23,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:23,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:23,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:23,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:23,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:23,446 INFO L87 Difference]: Start difference. First operand 390 states and 500 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:24,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:24,118 INFO L93 Difference]: Finished difference Result 669 states and 872 transitions. [2024-11-11 21:43:24,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:43:24,119 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-11 21:43:24,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:24,121 INFO L225 Difference]: With dead ends: 669 [2024-11-11 21:43:24,121 INFO L226 Difference]: Without dead ends: 593 [2024-11-11 21:43:24,122 INFO L434 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-11 21:43:24,123 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 1941 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1941 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:24,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1941 Valid, 1330 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:43:24,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2024-11-11 21:43:24,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 390. [2024-11-11 21:43:24,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3342245989304813) internal successors, (499), 389 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-11 21:43:24,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 499 transitions. [2024-11-11 21:43:24,130 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 499 transitions. Word has length 78 [2024-11-11 21:43:24,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:24,131 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 499 transitions. [2024-11-11 21:43:24,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:24,131 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 499 transitions. [2024-11-11 21:43:24,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-11 21:43:24,132 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:24,132 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:24,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 21:43:24,132 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:24,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:24,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1207054515, now seen corresponding path program 1 times [2024-11-11 21:43:24,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:24,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384475057] [2024-11-11 21:43:24,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:24,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:24,411 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-11 21:43:24,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:24,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384475057] [2024-11-11 21:43:24,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384475057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:24,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:24,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:24,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728157293] [2024-11-11 21:43:24,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:24,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:24,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:24,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:24,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:24,415 INFO L87 Difference]: Start difference. First operand 390 states and 499 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:25,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:25,030 INFO L93 Difference]: Finished difference Result 665 states and 867 transitions. [2024-11-11 21:43:25,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:43:25,031 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-11 21:43:25,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:25,033 INFO L225 Difference]: With dead ends: 665 [2024-11-11 21:43:25,033 INFO L226 Difference]: Without dead ends: 593 [2024-11-11 21:43:25,034 INFO L434 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-11 21:43:25,035 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 1761 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1761 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:25,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1761 Valid, 1493 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:43:25,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2024-11-11 21:43:25,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 390. [2024-11-11 21:43:25,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3315508021390374) internal successors, (498), 389 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-11 21:43:25,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 498 transitions. [2024-11-11 21:43:25,042 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 498 transitions. Word has length 78 [2024-11-11 21:43:25,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:25,043 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 498 transitions. [2024-11-11 21:43:25,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:25,043 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 498 transitions. [2024-11-11 21:43:25,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-11 21:43:25,044 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:25,044 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:25,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 21:43:25,045 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-11 21:43:25,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:25,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1663299084, now seen corresponding path program 1 times [2024-11-11 21:43:25,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:25,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191018816] [2024-11-11 21:43:25,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:25,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:25,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:25,332 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-11 21:43:25,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:25,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191018816] [2024-11-11 21:43:25,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191018816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:25,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:25,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:25,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140253684] [2024-11-11 21:43:25,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:25,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:25,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:25,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:25,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:25,334 INFO L87 Difference]: Start difference. First operand 390 states and 498 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:25,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:25,963 INFO L93 Difference]: Finished difference Result 690 states and 902 transitions. [2024-11-11 21:43:25,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:43:25,964 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-11 21:43:25,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:25,966 INFO L225 Difference]: With dead ends: 690 [2024-11-11 21:43:25,966 INFO L226 Difference]: Without dead ends: 601 [2024-11-11 21:43:25,967 INFO L434 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-11 21:43:25,968 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 2576 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2576 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:25,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2576 Valid, 1467 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:43:25,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-11 21:43:25,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 390. [2024-11-11 21:43:25,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3288770053475936) internal successors, (497), 389 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-11 21:43:25,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 497 transitions. [2024-11-11 21:43:25,975 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 497 transitions. Word has length 78 [2024-11-11 21:43:25,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:25,976 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 497 transitions. [2024-11-11 21:43:25,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:25,976 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 497 transitions. [2024-11-11 21:43:25,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-11 21:43:25,977 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:25,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:25,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 21:43:25,977 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:25,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:25,978 INFO L85 PathProgramCache]: Analyzing trace with hash 574449411, now seen corresponding path program 1 times [2024-11-11 21:43:25,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:25,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360035595] [2024-11-11 21:43:25,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:25,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:26,228 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-11 21:43:26,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:26,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360035595] [2024-11-11 21:43:26,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360035595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:26,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:26,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:26,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723011608] [2024-11-11 21:43:26,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:26,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:26,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:26,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:26,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:26,231 INFO L87 Difference]: Start difference. First operand 390 states and 497 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:27,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:27,048 INFO L93 Difference]: Finished difference Result 748 states and 971 transitions. [2024-11-11 21:43:27,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 21:43:27,049 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-11 21:43:27,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:27,051 INFO L225 Difference]: With dead ends: 748 [2024-11-11 21:43:27,051 INFO L226 Difference]: Without dead ends: 605 [2024-11-11 21:43:27,052 INFO L434 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-11 21:43:27,053 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 1983 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1983 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:27,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1983 Valid, 1684 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 21:43:27,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-11 21:43:27,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 390. [2024-11-11 21:43:27,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3262032085561497) internal successors, (496), 389 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-11 21:43:27,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 496 transitions. [2024-11-11 21:43:27,064 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 496 transitions. Word has length 78 [2024-11-11 21:43:27,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:27,064 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 496 transitions. [2024-11-11 21:43:27,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:27,065 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 496 transitions. [2024-11-11 21:43:27,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-11 21:43:27,066 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:27,066 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:27,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 21:43:27,066 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-11 21:43:27,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:27,067 INFO L85 PathProgramCache]: Analyzing trace with hash 688086315, now seen corresponding path program 1 times [2024-11-11 21:43:27,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:27,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434656908] [2024-11-11 21:43:27,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:27,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:27,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:27,352 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-11 21:43:27,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:27,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434656908] [2024-11-11 21:43:27,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434656908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:27,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:27,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:27,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083174959] [2024-11-11 21:43:27,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:27,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:27,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:27,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:27,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:27,355 INFO L87 Difference]: Start difference. First operand 390 states and 496 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:28,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:28,029 INFO L93 Difference]: Finished difference Result 669 states and 867 transitions. [2024-11-11 21:43:28,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:43:28,030 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-11 21:43:28,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:28,033 INFO L225 Difference]: With dead ends: 669 [2024-11-11 21:43:28,033 INFO L226 Difference]: Without dead ends: 593 [2024-11-11 21:43:28,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-11 21:43:28,035 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 2569 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2569 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:28,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2569 Valid, 1398 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:43:28,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2024-11-11 21:43:28,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 390. [2024-11-11 21:43:28,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3235294117647058) internal successors, (495), 389 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-11 21:43:28,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 495 transitions. [2024-11-11 21:43:28,046 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 495 transitions. Word has length 78 [2024-11-11 21:43:28,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:28,047 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 495 transitions. [2024-11-11 21:43:28,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:28,047 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 495 transitions. [2024-11-11 21:43:28,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-11 21:43:28,048 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:28,048 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:28,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 21:43:28,048 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-11 21:43:28,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:28,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1096931543, now seen corresponding path program 1 times [2024-11-11 21:43:28,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:28,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767065565] [2024-11-11 21:43:28,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:28,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:28,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:28,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:28,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:28,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767065565] [2024-11-11 21:43:28,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767065565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:28,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:28,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:28,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876481913] [2024-11-11 21:43:28,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:28,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:28,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:28,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:28,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:28,386 INFO L87 Difference]: Start difference. First operand 390 states and 495 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:29,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:29,104 INFO L93 Difference]: Finished difference Result 699 states and 907 transitions. [2024-11-11 21:43:29,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:43:29,105 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-11 21:43:29,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:29,107 INFO L225 Difference]: With dead ends: 699 [2024-11-11 21:43:29,107 INFO L226 Difference]: Without dead ends: 601 [2024-11-11 21:43:29,107 INFO L434 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-11 21:43:29,108 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 2038 mSDsluCounter, 1424 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2038 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:29,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2038 Valid, 1865 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 21:43:29,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-11 21:43:29,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 390. [2024-11-11 21:43:29,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.320855614973262) internal successors, (494), 389 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:29,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 494 transitions. [2024-11-11 21:43:29,115 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 494 transitions. Word has length 78 [2024-11-11 21:43:29,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:29,116 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 494 transitions. [2024-11-11 21:43:29,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:29,116 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 494 transitions. [2024-11-11 21:43:29,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-11 21:43:29,117 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:29,117 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:29,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 21:43:29,117 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:29,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:29,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1780834374, now seen corresponding path program 1 times [2024-11-11 21:43:29,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:29,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076413582] [2024-11-11 21:43:29,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:29,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:29,454 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-11 21:43:29,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:29,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076413582] [2024-11-11 21:43:29,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076413582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:29,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:29,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:29,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006346579] [2024-11-11 21:43:29,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:29,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:29,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:29,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:29,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:29,457 INFO L87 Difference]: Start difference. First operand 390 states and 494 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-11 21:43:30,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:30,166 INFO L93 Difference]: Finished difference Result 643 states and 825 transitions. [2024-11-11 21:43:30,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:43:30,166 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-11 21:43:30,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:30,168 INFO L225 Difference]: With dead ends: 643 [2024-11-11 21:43:30,168 INFO L226 Difference]: Without dead ends: 577 [2024-11-11 21:43:30,169 INFO L434 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-11 21:43:30,170 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 2133 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 1329 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2133 SdHoareTripleChecker+Valid, 1766 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:30,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2133 Valid, 1766 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1329 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 21:43:30,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-11-11 21:43:30,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 390. [2024-11-11 21:43:30,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3181818181818181) internal successors, (493), 389 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:30,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 493 transitions. [2024-11-11 21:43:30,178 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 493 transitions. Word has length 80 [2024-11-11 21:43:30,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:30,178 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 493 transitions. [2024-11-11 21:43:30,179 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-11 21:43:30,179 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 493 transitions. [2024-11-11 21:43:30,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-11 21:43:30,180 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:30,180 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:30,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 21:43:30,180 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:30,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:30,181 INFO L85 PathProgramCache]: Analyzing trace with hash 515089470, now seen corresponding path program 1 times [2024-11-11 21:43:30,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:30,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217165566] [2024-11-11 21:43:30,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:30,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:30,700 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-11 21:43:30,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:30,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217165566] [2024-11-11 21:43:30,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217165566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:30,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:30,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-11 21:43:30,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072339487] [2024-11-11 21:43:30,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:30,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 21:43:30,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:30,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 21:43:30,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:43:30,703 INFO L87 Difference]: Start difference. First operand 390 states and 493 transitions. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 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-11 21:43:31,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:31,659 INFO L93 Difference]: Finished difference Result 808 states and 1063 transitions. [2024-11-11 21:43:31,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-11 21:43:31,660 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 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-11 21:43:31,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:31,662 INFO L225 Difference]: With dead ends: 808 [2024-11-11 21:43:31,662 INFO L226 Difference]: Without dead ends: 739 [2024-11-11 21:43:31,663 INFO L434 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-11 21:43:31,664 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 4053 mSDsluCounter, 1343 mSDsCounter, 0 mSdLazyCounter, 1325 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4053 SdHoareTripleChecker+Valid, 1645 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:31,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4053 Valid, 1645 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1325 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 21:43:31,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2024-11-11 21:43:31,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 394. [2024-11-11 21:43:31,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.3148148148148149) internal successors, (497), 393 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-11 21:43:31,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 497 transitions. [2024-11-11 21:43:31,675 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 497 transitions. Word has length 80 [2024-11-11 21:43:31,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:31,675 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 497 transitions. [2024-11-11 21:43:31,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 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-11 21:43:31,676 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 497 transitions. [2024-11-11 21:43:31,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-11 21:43:31,677 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:31,677 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:31,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 21:43:31,677 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:31,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:31,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1270226045, now seen corresponding path program 1 times [2024-11-11 21:43:31,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:31,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329901446] [2024-11-11 21:43:31,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:31,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:31,980 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-11 21:43:31,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:31,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329901446] [2024-11-11 21:43:31,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329901446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:31,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:31,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:31,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490897867] [2024-11-11 21:43:31,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:31,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:31,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:31,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:31,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:31,983 INFO L87 Difference]: Start difference. First operand 394 states and 497 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-11 21:43:32,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:32,629 INFO L93 Difference]: Finished difference Result 646 states and 826 transitions. [2024-11-11 21:43:32,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:43:32,630 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-11 21:43:32,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:32,631 INFO L225 Difference]: With dead ends: 646 [2024-11-11 21:43:32,631 INFO L226 Difference]: Without dead ends: 577 [2024-11-11 21:43:32,632 INFO L434 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-11 21:43:32,632 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 2212 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2212 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:32,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2212 Valid, 1584 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:43:32,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-11-11 21:43:32,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 394. [2024-11-11 21:43:32,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.312169312169312) internal successors, (496), 393 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-11 21:43:32,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 496 transitions. [2024-11-11 21:43:32,640 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 496 transitions. Word has length 80 [2024-11-11 21:43:32,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:32,641 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 496 transitions. [2024-11-11 21:43:32,641 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-11 21:43:32,641 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 496 transitions. [2024-11-11 21:43:32,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-11 21:43:32,642 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:32,642 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:32,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 21:43:32,642 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:32,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:32,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1112544149, now seen corresponding path program 1 times [2024-11-11 21:43:32,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:32,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209924496] [2024-11-11 21:43:32,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:32,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:32,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-11 21:43:32,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:32,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209924496] [2024-11-11 21:43:32,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209924496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:32,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:32,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:32,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475511473] [2024-11-11 21:43:32,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:32,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:32,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:32,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:32,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:32,885 INFO L87 Difference]: Start difference. First operand 394 states and 496 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-11 21:43:33,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:33,567 INFO L93 Difference]: Finished difference Result 678 states and 871 transitions. [2024-11-11 21:43:33,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 21:43:33,567 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-11 21:43:33,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:33,569 INFO L225 Difference]: With dead ends: 678 [2024-11-11 21:43:33,569 INFO L226 Difference]: Without dead ends: 597 [2024-11-11 21:43:33,570 INFO L434 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-11 21:43:33,570 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 1602 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1602 SdHoareTripleChecker+Valid, 1649 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:33,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1602 Valid, 1649 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 21:43:33,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2024-11-11 21:43:33,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 394. [2024-11-11 21:43:33,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.3095238095238095) internal successors, (495), 393 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-11 21:43:33,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 495 transitions. [2024-11-11 21:43:33,578 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 495 transitions. Word has length 80 [2024-11-11 21:43:33,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:33,578 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 495 transitions. [2024-11-11 21:43:33,578 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-11 21:43:33,578 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 495 transitions. [2024-11-11 21:43:33,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-11 21:43:33,579 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:33,579 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:33,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 21:43:33,579 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:33,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:33,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1251491228, now seen corresponding path program 1 times [2024-11-11 21:43:33,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:33,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620533923] [2024-11-11 21:43:33,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:33,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:33,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:33,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:33,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620533923] [2024-11-11 21:43:33,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620533923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:33,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:33,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:33,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814878595] [2024-11-11 21:43:33,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:33,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:33,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:33,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:33,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:33,867 INFO L87 Difference]: Start difference. First operand 394 states and 495 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-11 21:43:34,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:34,651 INFO L93 Difference]: Finished difference Result 673 states and 863 transitions. [2024-11-11 21:43:34,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 21:43:34,652 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-11 21:43:34,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:34,653 INFO L225 Difference]: With dead ends: 673 [2024-11-11 21:43:34,653 INFO L226 Difference]: Without dead ends: 597 [2024-11-11 21:43:34,654 INFO L434 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-11 21:43:34,654 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 1890 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1890 SdHoareTripleChecker+Valid, 1649 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:34,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1890 Valid, 1649 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 21:43:34,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2024-11-11 21:43:34,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 394. [2024-11-11 21:43:34,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.306878306878307) internal successors, (494), 393 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:34,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 494 transitions. [2024-11-11 21:43:34,662 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 494 transitions. Word has length 80 [2024-11-11 21:43:34,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:34,663 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 494 transitions. [2024-11-11 21:43:34,663 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-11 21:43:34,663 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 494 transitions. [2024-11-11 21:43:34,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-11 21:43:34,664 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:34,664 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:34,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 21:43:34,664 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-11 21:43:34,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:34,665 INFO L85 PathProgramCache]: Analyzing trace with hash -955374417, now seen corresponding path program 1 times [2024-11-11 21:43:34,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:34,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142330002] [2024-11-11 21:43:34,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:34,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:34,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:34,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:34,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142330002] [2024-11-11 21:43:34,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142330002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:34,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:34,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:34,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472846356] [2024-11-11 21:43:34,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:34,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:34,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:34,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:34,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:34,892 INFO L87 Difference]: Start difference. First operand 394 states and 494 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-11 21:43:35,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:35,638 INFO L93 Difference]: Finished difference Result 643 states and 820 transitions. [2024-11-11 21:43:35,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:43:35,638 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-11 21:43:35,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:35,640 INFO L225 Difference]: With dead ends: 643 [2024-11-11 21:43:35,640 INFO L226 Difference]: Without dead ends: 577 [2024-11-11 21:43:35,641 INFO L434 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-11 21:43:35,641 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 2166 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2166 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:35,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2166 Valid, 1545 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 21:43:35,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-11-11 21:43:35,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 394. [2024-11-11 21:43:35,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.3042328042328042) internal successors, (493), 393 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:35,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 493 transitions. [2024-11-11 21:43:35,648 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 493 transitions. Word has length 80 [2024-11-11 21:43:35,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:35,648 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 493 transitions. [2024-11-11 21:43:35,649 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-11 21:43:35,649 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 493 transitions. [2024-11-11 21:43:35,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-11 21:43:35,650 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:35,650 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:35,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 21:43:35,650 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:35,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:35,651 INFO L85 PathProgramCache]: Analyzing trace with hash -306680341, now seen corresponding path program 1 times [2024-11-11 21:43:35,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:35,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652345928] [2024-11-11 21:43:35,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:35,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:35,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:35,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:35,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652345928] [2024-11-11 21:43:35,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652345928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:35,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:35,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:35,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273462067] [2024-11-11 21:43:35,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:35,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:35,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:35,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:35,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:35,907 INFO L87 Difference]: Start difference. First operand 394 states and 493 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-11 21:43:36,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:36,504 INFO L93 Difference]: Finished difference Result 643 states and 819 transitions. [2024-11-11 21:43:36,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 21:43:36,504 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-11 21:43:36,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:36,506 INFO L225 Difference]: With dead ends: 643 [2024-11-11 21:43:36,506 INFO L226 Difference]: Without dead ends: 577 [2024-11-11 21:43:36,506 INFO L434 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-11 21:43:36,507 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 2409 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2409 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:36,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2409 Valid, 1360 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1011 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:43:36,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-11-11 21:43:36,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 394. [2024-11-11 21:43:36,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.3015873015873016) internal successors, (492), 393 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-11 21:43:36,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 492 transitions. [2024-11-11 21:43:36,514 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 492 transitions. Word has length 80 [2024-11-11 21:43:36,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:36,515 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 492 transitions. [2024-11-11 21:43:36,515 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-11 21:43:36,515 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 492 transitions. [2024-11-11 21:43:36,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-11 21:43:36,516 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:36,516 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:36,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-11 21:43:36,516 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-11 21:43:36,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:36,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1961273491, now seen corresponding path program 1 times [2024-11-11 21:43:36,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:36,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059461150] [2024-11-11 21:43:36,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:36,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:36,783 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-11 21:43:36,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:36,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059461150] [2024-11-11 21:43:36,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059461150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:36,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:36,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:36,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730825496] [2024-11-11 21:43:36,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:36,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:36,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:36,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:36,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:36,787 INFO L87 Difference]: Start difference. First operand 394 states and 492 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-11 21:43:37,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:37,412 INFO L93 Difference]: Finished difference Result 641 states and 815 transitions. [2024-11-11 21:43:37,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:43:37,413 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-11 21:43:37,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:37,414 INFO L225 Difference]: With dead ends: 641 [2024-11-11 21:43:37,414 INFO L226 Difference]: Without dead ends: 577 [2024-11-11 21:43:37,415 INFO L434 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-11 21:43:37,415 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 2158 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2158 SdHoareTripleChecker+Valid, 1664 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:37,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2158 Valid, 1664 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:43:37,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-11-11 21:43:37,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 394. [2024-11-11 21:43:37,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.2989417989417988) internal successors, (491), 393 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:37,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 491 transitions. [2024-11-11 21:43:37,423 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 491 transitions. Word has length 80 [2024-11-11 21:43:37,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:37,424 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 491 transitions. [2024-11-11 21:43:37,424 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-11 21:43:37,424 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 491 transitions. [2024-11-11 21:43:37,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-11 21:43:37,425 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:37,425 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:37,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-11 21:43:37,425 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:37,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:37,426 INFO L85 PathProgramCache]: Analyzing trace with hash 601853245, now seen corresponding path program 1 times [2024-11-11 21:43:37,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:37,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477607010] [2024-11-11 21:43:37,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:37,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:37,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-11 21:43:37,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:37,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477607010] [2024-11-11 21:43:37,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477607010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:37,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:37,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:37,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395967778] [2024-11-11 21:43:37,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:37,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:37,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:37,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:37,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:37,747 INFO L87 Difference]: Start difference. First operand 394 states and 491 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-11 21:43:38,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:38,326 INFO L93 Difference]: Finished difference Result 646 states and 819 transitions. [2024-11-11 21:43:38,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:43:38,326 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-11 21:43:38,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:38,328 INFO L225 Difference]: With dead ends: 646 [2024-11-11 21:43:38,328 INFO L226 Difference]: Without dead ends: 577 [2024-11-11 21:43:38,328 INFO L434 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-11 21:43:38,329 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 2152 mSDsluCounter, 1340 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2152 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:38,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2152 Valid, 1668 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:43:38,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-11-11 21:43:38,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 394. [2024-11-11 21:43:38,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.2962962962962963) internal successors, (490), 393 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:38,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 490 transitions. [2024-11-11 21:43:38,336 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 490 transitions. Word has length 80 [2024-11-11 21:43:38,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:38,336 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 490 transitions. [2024-11-11 21:43:38,336 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-11 21:43:38,336 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 490 transitions. [2024-11-11 21:43:38,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-11 21:43:38,337 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:38,337 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:38,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-11 21:43:38,337 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:38,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:38,338 INFO L85 PathProgramCache]: Analyzing trace with hash -953833721, now seen corresponding path program 1 times [2024-11-11 21:43:38,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:38,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080913419] [2024-11-11 21:43:38,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:38,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:38,739 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-11 21:43:38,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:38,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080913419] [2024-11-11 21:43:38,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080913419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:38,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:38,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-11 21:43:38,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481340911] [2024-11-11 21:43:38,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:38,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 21:43:38,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:38,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 21:43:38,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:43:38,744 INFO L87 Difference]: Start difference. First operand 394 states and 490 transitions. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 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-11 21:43:39,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:39,816 INFO L93 Difference]: Finished difference Result 955 states and 1265 transitions. [2024-11-11 21:43:39,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-11 21:43:39,817 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 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-11 21:43:39,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:39,820 INFO L225 Difference]: With dead ends: 955 [2024-11-11 21:43:39,820 INFO L226 Difference]: Without dead ends: 851 [2024-11-11 21:43:39,821 INFO L434 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-11 21:43:39,822 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 4154 mSDsluCounter, 1585 mSDsCounter, 0 mSdLazyCounter, 1531 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4154 SdHoareTripleChecker+Valid, 2006 SdHoareTripleChecker+Invalid, 1664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:39,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4154 Valid, 2006 Invalid, 1664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1531 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 21:43:39,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2024-11-11 21:43:39,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 398. [2024-11-11 21:43:39,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 382 states have (on average 1.293193717277487) internal successors, (494), 397 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:39,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 494 transitions. [2024-11-11 21:43:39,832 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 494 transitions. Word has length 80 [2024-11-11 21:43:39,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:39,832 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 494 transitions. [2024-11-11 21:43:39,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 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-11 21:43:39,833 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 494 transitions. [2024-11-11 21:43:39,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-11 21:43:39,833 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:39,834 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:39,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-11 21:43:39,834 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:39,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:39,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1702835234, now seen corresponding path program 1 times [2024-11-11 21:43:39,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:39,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908543388] [2024-11-11 21:43:39,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:39,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:40,107 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-11 21:43:40,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:40,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908543388] [2024-11-11 21:43:40,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908543388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:40,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:40,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:40,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975222812] [2024-11-11 21:43:40,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:40,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:40,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:40,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:40,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:40,109 INFO L87 Difference]: Start difference. First operand 398 states and 494 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-11 21:43:40,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:40,661 INFO L93 Difference]: Finished difference Result 586 states and 726 transitions. [2024-11-11 21:43:40,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:43:40,662 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-11 21:43:40,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:40,664 INFO L225 Difference]: With dead ends: 586 [2024-11-11 21:43:40,664 INFO L226 Difference]: Without dead ends: 581 [2024-11-11 21:43:40,664 INFO L434 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-11 21:43:40,665 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 2148 mSDsluCounter, 1340 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2148 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:40,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2148 Valid, 1668 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:43:40,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-11-11 21:43:40,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 398. [2024-11-11 21:43:40,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 382 states have (on average 1.2905759162303665) internal successors, (493), 397 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:40,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 493 transitions. [2024-11-11 21:43:40,674 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 493 transitions. Word has length 80 [2024-11-11 21:43:40,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:40,674 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 493 transitions. [2024-11-11 21:43:40,674 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-11 21:43:40,674 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 493 transitions. [2024-11-11 21:43:40,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-11 21:43:40,675 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:40,675 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:40,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-11 21:43:40,676 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:40,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:40,676 INFO L85 PathProgramCache]: Analyzing trace with hash 209361868, now seen corresponding path program 1 times [2024-11-11 21:43:40,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:40,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664041461] [2024-11-11 21:43:40,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:40,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:41,054 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-11 21:43:41,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:41,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664041461] [2024-11-11 21:43:41,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664041461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:41,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:41,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-11 21:43:41,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626657184] [2024-11-11 21:43:41,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:41,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 21:43:41,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:41,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 21:43:41,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:43:41,056 INFO L87 Difference]: Start difference. First operand 398 states and 493 transitions. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 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-11 21:43:41,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:41,919 INFO L93 Difference]: Finished difference Result 820 states and 1064 transitions. [2024-11-11 21:43:41,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-11 21:43:41,919 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 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-11 21:43:41,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:41,922 INFO L225 Difference]: With dead ends: 820 [2024-11-11 21:43:41,922 INFO L226 Difference]: Without dead ends: 803 [2024-11-11 21:43:41,923 INFO L434 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-11 21:43:41,923 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 3948 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3948 SdHoareTripleChecker+Valid, 1623 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:41,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3948 Valid, 1623 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 21:43:41,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2024-11-11 21:43:41,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 402. [2024-11-11 21:43:41,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 386 states have (on average 1.2875647668393781) internal successors, (497), 401 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-11 21:43:41,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 497 transitions. [2024-11-11 21:43:41,932 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 497 transitions. Word has length 80 [2024-11-11 21:43:41,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:41,933 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 497 transitions. [2024-11-11 21:43:41,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 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-11 21:43:41,933 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 497 transitions. [2024-11-11 21:43:41,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-11 21:43:41,934 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:41,934 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:41,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-11 21:43:41,934 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:41,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:41,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1191963760, now seen corresponding path program 1 times [2024-11-11 21:43:41,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:41,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890123070] [2024-11-11 21:43:41,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:41,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:42,179 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-11 21:43:42,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:42,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890123070] [2024-11-11 21:43:42,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890123070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:42,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:42,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:42,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553598079] [2024-11-11 21:43:42,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:42,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:42,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:42,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:42,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:42,182 INFO L87 Difference]: Start difference. First operand 402 states and 497 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-11 21:43:42,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:42,829 INFO L93 Difference]: Finished difference Result 651 states and 822 transitions. [2024-11-11 21:43:42,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:43:42,830 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-11 21:43:42,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:42,831 INFO L225 Difference]: With dead ends: 651 [2024-11-11 21:43:42,831 INFO L226 Difference]: Without dead ends: 585 [2024-11-11 21:43:42,832 INFO L434 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-11 21:43:42,832 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 2145 mSDsluCounter, 1340 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2145 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:42,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2145 Valid, 1668 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:43:42,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-11 21:43:42,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 402. [2024-11-11 21:43:42,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 386 states have (on average 1.2849740932642486) internal successors, (496), 401 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-11 21:43:42,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 496 transitions. [2024-11-11 21:43:42,839 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 496 transitions. Word has length 80 [2024-11-11 21:43:42,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:42,839 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 496 transitions. [2024-11-11 21:43:42,840 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-11 21:43:42,840 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 496 transitions. [2024-11-11 21:43:42,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-11 21:43:42,840 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:42,841 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:42,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-11 21:43:42,841 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:42,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:42,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1836995487, now seen corresponding path program 1 times [2024-11-11 21:43:42,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:42,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217841657] [2024-11-11 21:43:42,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:42,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:43,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-11 21:43:43,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:43,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217841657] [2024-11-11 21:43:43,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217841657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:43,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:43,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:43,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28283566] [2024-11-11 21:43:43,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:43,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:43,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:43,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:43,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:43,048 INFO L87 Difference]: Start difference. First operand 402 states and 496 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-11 21:43:43,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:43,553 INFO L93 Difference]: Finished difference Result 590 states and 728 transitions. [2024-11-11 21:43:43,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 21:43:43,553 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-11 21:43:43,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:43,555 INFO L225 Difference]: With dead ends: 590 [2024-11-11 21:43:43,555 INFO L226 Difference]: Without dead ends: 585 [2024-11-11 21:43:43,555 INFO L434 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-11 21:43:43,555 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 2388 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2388 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:43,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2388 Valid, 1360 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:43:43,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-11 21:43:43,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 402. [2024-11-11 21:43:43,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 386 states have (on average 1.282383419689119) internal successors, (495), 401 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-11 21:43:43,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 495 transitions. [2024-11-11 21:43:43,562 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 495 transitions. Word has length 80 [2024-11-11 21:43:43,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:43,562 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 495 transitions. [2024-11-11 21:43:43,562 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-11 21:43:43,563 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 495 transitions. [2024-11-11 21:43:43,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 21:43:43,563 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:43,563 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:43,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-11 21:43:43,564 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:43,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:43,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1478263256, now seen corresponding path program 1 times [2024-11-11 21:43:43,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:43,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355200406] [2024-11-11 21:43:43,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:43,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:43,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:43,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:43,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355200406] [2024-11-11 21:43:43,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355200406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:43,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:43,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:43,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762395765] [2024-11-11 21:43:43,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:43,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:43,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:43,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:43,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:43,773 INFO L87 Difference]: Start difference. First operand 402 states and 495 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-11 21:43:44,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:44,276 INFO L93 Difference]: Finished difference Result 654 states and 822 transitions. [2024-11-11 21:43:44,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 21:43:44,277 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-11 21:43:44,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:44,279 INFO L225 Difference]: With dead ends: 654 [2024-11-11 21:43:44,279 INFO L226 Difference]: Without dead ends: 585 [2024-11-11 21:43:44,279 INFO L434 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-11 21:43:44,280 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 1770 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1770 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:44,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1770 Valid, 1376 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:43:44,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-11 21:43:44,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 398. [2024-11-11 21:43:44,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 382 states have (on average 1.2827225130890052) internal successors, (490), 397 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:44,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 490 transitions. [2024-11-11 21:43:44,285 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 490 transitions. Word has length 81 [2024-11-11 21:43:44,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:44,286 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 490 transitions. [2024-11-11 21:43:44,286 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-11 21:43:44,286 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 490 transitions. [2024-11-11 21:43:44,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 21:43:44,287 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:44,287 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:44,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-11 21:43:44,287 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:44,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:44,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1829127868, now seen corresponding path program 1 times [2024-11-11 21:43:44,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:44,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176560368] [2024-11-11 21:43:44,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:44,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:44,496 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-11 21:43:44,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:44,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176560368] [2024-11-11 21:43:44,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176560368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:44,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:44,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:44,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381922378] [2024-11-11 21:43:44,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:44,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:44,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:44,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:44,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:44,498 INFO L87 Difference]: Start difference. First operand 398 states and 490 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-11 21:43:45,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:45,076 INFO L93 Difference]: Finished difference Result 709 states and 899 transitions. [2024-11-11 21:43:45,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 21:43:45,077 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-11 21:43:45,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:45,078 INFO L225 Difference]: With dead ends: 709 [2024-11-11 21:43:45,078 INFO L226 Difference]: Without dead ends: 605 [2024-11-11 21:43:45,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2024-11-11 21:43:45,079 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 1984 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1984 SdHoareTripleChecker+Valid, 1850 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:45,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1984 Valid, 1850 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:43:45,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-11 21:43:45,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 394. [2024-11-11 21:43:45,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.283068783068783) internal successors, (485), 393 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:45,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 485 transitions. [2024-11-11 21:43:45,085 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 485 transitions. Word has length 81 [2024-11-11 21:43:45,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:45,086 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 485 transitions. [2024-11-11 21:43:45,086 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-11 21:43:45,086 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 485 transitions. [2024-11-11 21:43:45,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 21:43:45,087 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:45,087 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:45,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-11 21:43:45,087 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:45,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:45,088 INFO L85 PathProgramCache]: Analyzing trace with hash -53380691, now seen corresponding path program 1 times [2024-11-11 21:43:45,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:45,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961026444] [2024-11-11 21:43:45,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:45,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:45,323 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-11 21:43:45,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:45,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961026444] [2024-11-11 21:43:45,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961026444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:45,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:45,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:45,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059666386] [2024-11-11 21:43:45,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:45,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:45,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:45,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:45,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:45,325 INFO L87 Difference]: Start difference. First operand 394 states and 485 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-11 21:43:45,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:45,967 INFO L93 Difference]: Finished difference Result 610 states and 755 transitions. [2024-11-11 21:43:45,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 21:43:45,967 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-11 21:43:45,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:45,969 INFO L225 Difference]: With dead ends: 610 [2024-11-11 21:43:45,969 INFO L226 Difference]: Without dead ends: 593 [2024-11-11 21:43:45,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2024-11-11 21:43:45,970 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 2204 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2204 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:45,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2204 Valid, 1651 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:43:45,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2024-11-11 21:43:45,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 390. [2024-11-11 21:43:45,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.2834224598930482) internal successors, (480), 389 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:45,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 480 transitions. [2024-11-11 21:43:45,976 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 480 transitions. Word has length 81 [2024-11-11 21:43:45,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:45,977 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 480 transitions. [2024-11-11 21:43:45,977 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-11 21:43:45,977 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 480 transitions. [2024-11-11 21:43:45,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-11 21:43:45,977 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:45,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:45,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-11 21:43:45,978 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:45,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:45,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1125287833, now seen corresponding path program 1 times [2024-11-11 21:43:45,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:45,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444333704] [2024-11-11 21:43:45,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:45,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:46,526 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-11 21:43:46,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:46,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444333704] [2024-11-11 21:43:46,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444333704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:46,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:46,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-11 21:43:46,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709886698] [2024-11-11 21:43:46,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:46,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-11 21:43:46,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:46,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-11 21:43:46,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-11 21:43:46,528 INFO L87 Difference]: Start difference. First operand 390 states and 480 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-11 21:43:47,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:47,372 INFO L93 Difference]: Finished difference Result 972 states and 1227 transitions. [2024-11-11 21:43:47,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 21:43:47,373 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-11 21:43:47,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:47,375 INFO L225 Difference]: With dead ends: 972 [2024-11-11 21:43:47,375 INFO L226 Difference]: Without dead ends: 901 [2024-11-11 21:43:47,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2024-11-11 21:43:47,376 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 2266 mSDsluCounter, 5785 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2266 SdHoareTripleChecker+Valid, 6666 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:47,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2266 Valid, 6666 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:43:47,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2024-11-11 21:43:47,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 383. [2024-11-11 21:43:47,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 367 states have (on average 1.2806539509536785) internal successors, (470), 382 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-11 21:43:47,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 470 transitions. [2024-11-11 21:43:47,383 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 470 transitions. Word has length 82 [2024-11-11 21:43:47,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:47,384 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 470 transitions. [2024-11-11 21:43:47,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-11 21:43:47,384 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 470 transitions. [2024-11-11 21:43:47,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-11 21:43:47,384 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:47,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:47,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-11 21:43:47,385 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:47,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:47,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1735705855, now seen corresponding path program 1 times [2024-11-11 21:43:47,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:47,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236028716] [2024-11-11 21:43:47,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:47,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:47,900 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-11 21:43:47,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:47,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236028716] [2024-11-11 21:43:47,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236028716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:47,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:47,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 21:43:47,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723849059] [2024-11-11 21:43:47,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:47,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 21:43:47,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:47,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 21:43:47,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:43:47,902 INFO L87 Difference]: Start difference. First operand 383 states and 470 transitions. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:48,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:48,490 INFO L93 Difference]: Finished difference Result 632 states and 804 transitions. [2024-11-11 21:43:48,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 21:43:48,491 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-11 21:43:48,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:48,492 INFO L225 Difference]: With dead ends: 632 [2024-11-11 21:43:48,492 INFO L226 Difference]: Without dead ends: 551 [2024-11-11 21:43:48,492 INFO L434 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-11 21:43:48,493 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 2190 mSDsluCounter, 2750 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2190 SdHoareTripleChecker+Valid, 3354 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:48,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2190 Valid, 3354 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:43:48,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-11-11 21:43:48,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 366. [2024-11-11 21:43:48,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 351 states have (on average 1.2792022792022792) internal successors, (449), 365 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:48,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 449 transitions. [2024-11-11 21:43:48,498 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 449 transitions. Word has length 82 [2024-11-11 21:43:48,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:48,498 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 449 transitions. [2024-11-11 21:43:48,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:48,498 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 449 transitions. [2024-11-11 21:43:48,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-11 21:43:48,499 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:48,499 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:48,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-11 21:43:48,499 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-11 21:43:48,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:48,500 INFO L85 PathProgramCache]: Analyzing trace with hash -941970822, now seen corresponding path program 1 times [2024-11-11 21:43:48,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:48,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528298822] [2024-11-11 21:43:48,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:48,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:49,064 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-11 21:43:49,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:49,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528298822] [2024-11-11 21:43:49,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528298822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:49,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:49,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-11 21:43:49,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775485411] [2024-11-11 21:43:49,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:49,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-11 21:43:49,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:49,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-11 21:43:49,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-11 21:43:49,069 INFO L87 Difference]: Start difference. First operand 366 states and 449 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-11 21:43:50,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:50,166 INFO L93 Difference]: Finished difference Result 851 states and 1057 transitions. [2024-11-11 21:43:50,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 21:43:50,166 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-11 21:43:50,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:50,168 INFO L225 Difference]: With dead ends: 851 [2024-11-11 21:43:50,168 INFO L226 Difference]: Without dead ends: 783 [2024-11-11 21:43:50,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-11-11 21:43:50,169 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 2823 mSDsluCounter, 3148 mSDsCounter, 0 mSdLazyCounter, 1271 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2823 SdHoareTripleChecker+Valid, 3656 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:50,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2823 Valid, 3656 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1271 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 21:43:50,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2024-11-11 21:43:50,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 362. [2024-11-11 21:43:50,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 348 states have (on average 1.2758620689655173) internal successors, (444), 361 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:50,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 444 transitions. [2024-11-11 21:43:50,174 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 444 transitions. Word has length 82 [2024-11-11 21:43:50,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:50,174 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 444 transitions. [2024-11-11 21:43:50,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-11 21:43:50,174 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 444 transitions. [2024-11-11 21:43:50,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-11 21:43:50,175 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:50,175 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:50,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-11 21:43:50,175 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:50,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:50,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1572479326, now seen corresponding path program 1 times [2024-11-11 21:43:50,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:50,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591650115] [2024-11-11 21:43:50,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:50,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:50,655 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-11 21:43:50,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:50,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591650115] [2024-11-11 21:43:50,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591650115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:50,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:50,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-11 21:43:50,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396095459] [2024-11-11 21:43:50,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:50,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 21:43:50,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:50,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 21:43:50,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:43:50,658 INFO L87 Difference]: Start difference. First operand 362 states and 444 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:51,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:51,262 INFO L93 Difference]: Finished difference Result 871 states and 1095 transitions. [2024-11-11 21:43:51,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 21:43:51,262 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-11 21:43:51,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:51,264 INFO L225 Difference]: With dead ends: 871 [2024-11-11 21:43:51,264 INFO L226 Difference]: Without dead ends: 718 [2024-11-11 21:43:51,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-11-11 21:43:51,265 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 1580 mSDsluCounter, 2392 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 2937 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:51,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1580 Valid, 2937 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:43:51,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2024-11-11 21:43:51,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 273. [2024-11-11 21:43:51,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 262 states have (on average 1.2709923664122138) internal successors, (333), 272 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:51,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 333 transitions. [2024-11-11 21:43:51,270 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 333 transitions. Word has length 82 [2024-11-11 21:43:51,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:51,270 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 333 transitions. [2024-11-11 21:43:51,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:51,270 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 333 transitions. [2024-11-11 21:43:51,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-11 21:43:51,271 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:51,271 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:51,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-11 21:43:51,272 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:51,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:51,272 INFO L85 PathProgramCache]: Analyzing trace with hash 996849594, now seen corresponding path program 1 times [2024-11-11 21:43:51,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:51,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408779752] [2024-11-11 21:43:51,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:51,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:51,716 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-11 21:43:51,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:51,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408779752] [2024-11-11 21:43:51,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408779752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:51,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:51,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 21:43:51,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165851808] [2024-11-11 21:43:51,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:51,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 21:43:51,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:51,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 21:43:51,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:43:51,718 INFO L87 Difference]: Start difference. First operand 273 states and 333 transitions. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:52,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:52,154 INFO L93 Difference]: Finished difference Result 448 states and 579 transitions. [2024-11-11 21:43:52,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 21:43:52,154 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-11 21:43:52,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:52,155 INFO L225 Difference]: With dead ends: 448 [2024-11-11 21:43:52,156 INFO L226 Difference]: Without dead ends: 351 [2024-11-11 21:43:52,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-11-11 21:43:52,156 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 1394 mSDsluCounter, 1680 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1394 SdHoareTripleChecker+Valid, 2056 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-11 21:43:52,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1394 Valid, 2056 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:43:52,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-11 21:43:52,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 240. [2024-11-11 21:43:52,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 232 states have (on average 1.2629310344827587) internal successors, (293), 239 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:52,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 293 transitions. [2024-11-11 21:43:52,160 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 293 transitions. Word has length 82 [2024-11-11 21:43:52,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:52,161 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 293 transitions. [2024-11-11 21:43:52,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:52,161 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 293 transitions. [2024-11-11 21:43:52,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-11 21:43:52,162 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:52,162 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:52,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-11 21:43:52,162 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:52,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:52,163 INFO L85 PathProgramCache]: Analyzing trace with hash 504555190, now seen corresponding path program 1 times [2024-11-11 21:43:52,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:52,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214259264] [2024-11-11 21:43:52,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:52,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:53,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:53,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:53,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214259264] [2024-11-11 21:43:53,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214259264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:53,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:53,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2024-11-11 21:43:53,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566651090] [2024-11-11 21:43:53,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:53,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-11 21:43:53,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:53,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-11 21:43:53,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2024-11-11 21:43:53,759 INFO L87 Difference]: Start difference. First operand 240 states and 293 transitions. Second operand has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 29 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-11 21:43:57,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:57,557 INFO L93 Difference]: Finished difference Result 886 states and 1143 transitions. [2024-11-11 21:43:57,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-11 21:43:57,558 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 29 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-11 21:43:57,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:57,560 INFO L225 Difference]: With dead ends: 886 [2024-11-11 21:43:57,560 INFO L226 Difference]: Without dead ends: 818 [2024-11-11 21:43:57,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=434, Invalid=2322, Unknown=0, NotChecked=0, Total=2756 [2024-11-11 21:43:57,561 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 2371 mSDsluCounter, 9994 mSDsCounter, 0 mSdLazyCounter, 5656 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2371 SdHoareTripleChecker+Valid, 10688 SdHoareTripleChecker+Invalid, 5672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 5656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:57,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2371 Valid, 10688 Invalid, 5672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 5656 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-11 21:43:57,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2024-11-11 21:43:57,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 260. [2024-11-11 21:43:57,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 252 states have (on average 1.2698412698412698) internal successors, (320), 259 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:57,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 320 transitions. [2024-11-11 21:43:57,566 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 320 transitions. Word has length 82 [2024-11-11 21:43:57,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:57,566 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 320 transitions. [2024-11-11 21:43:57,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 29 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-11 21:43:57,566 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 320 transitions. [2024-11-11 21:43:57,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-11 21:43:57,567 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:57,567 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:57,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-11 21:43:57,567 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:57,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:57,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1900616581, now seen corresponding path program 1 times [2024-11-11 21:43:57,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:57,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559737464] [2024-11-11 21:43:57,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:57,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:57,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:57,995 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-11 21:43:57,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:57,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559737464] [2024-11-11 21:43:57,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559737464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:57,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:57,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 21:43:57,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627755915] [2024-11-11 21:43:57,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:57,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 21:43:57,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:57,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 21:43:57,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:43:57,998 INFO L87 Difference]: Start difference. First operand 260 states and 320 transitions. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:58,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:58,336 INFO L93 Difference]: Finished difference Result 436 states and 567 transitions. [2024-11-11 21:43:58,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 21:43:58,337 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-11 21:43:58,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:58,338 INFO L225 Difference]: With dead ends: 436 [2024-11-11 21:43:58,338 INFO L226 Difference]: Without dead ends: 309 [2024-11-11 21:43:58,338 INFO L434 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-11 21:43:58,338 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 1048 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:58,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 1653 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:43:58,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-11 21:43:58,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 197. [2024-11-11 21:43:58,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 193 states have (on average 1.2694300518134716) internal successors, (245), 196 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:58,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 245 transitions. [2024-11-11 21:43:58,341 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 245 transitions. Word has length 82 [2024-11-11 21:43:58,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:58,341 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 245 transitions. [2024-11-11 21:43:58,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:58,341 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 245 transitions. [2024-11-11 21:43:58,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-11 21:43:58,342 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:58,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:58,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-11 21:43:58,342 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:58,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:58,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1724267320, now seen corresponding path program 1 times [2024-11-11 21:43:58,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:58,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501970881] [2024-11-11 21:43:58,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:58,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:58,778 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-11 21:43:58,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:58,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501970881] [2024-11-11 21:43:58,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501970881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:58,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:58,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 21:43:58,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657895231] [2024-11-11 21:43:58,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:58,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 21:43:58,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:58,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 21:43:58,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:43:58,780 INFO L87 Difference]: Start difference. First operand 197 states and 245 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-11 21:43:59,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:59,144 INFO L93 Difference]: Finished difference Result 350 states and 465 transitions. [2024-11-11 21:43:59,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 21:43:59,144 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-11 21:43:59,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:59,145 INFO L225 Difference]: With dead ends: 350 [2024-11-11 21:43:59,145 INFO L226 Difference]: Without dead ends: 266 [2024-11-11 21:43:59,145 INFO L434 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-11 21:43:59,146 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 813 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:59,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 1536 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:43:59,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-11 21:43:59,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 161. [2024-11-11 21:43:59,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 159 states have (on average 1.251572327044025) internal successors, (199), 160 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-11 21:43:59,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 199 transitions. [2024-11-11 21:43:59,148 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 199 transitions. Word has length 83 [2024-11-11 21:43:59,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:59,148 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 199 transitions. [2024-11-11 21:43:59,148 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-11 21:43:59,148 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 199 transitions. [2024-11-11 21:43:59,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-11 21:43:59,149 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:59,149 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:59,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-11 21:43:59,149 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-11 21:43:59,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:59,149 INFO L85 PathProgramCache]: Analyzing trace with hash -892730834, now seen corresponding path program 1 times [2024-11-11 21:43:59,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:59,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95155018] [2024-11-11 21:43:59,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:59,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:43:59,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:43:59,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:43:59,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95155018] [2024-11-11 21:43:59,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95155018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:43:59,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:43:59,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:43:59,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942188776] [2024-11-11 21:43:59,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:43:59,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:43:59,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:43:59,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:43:59,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:43:59,356 INFO L87 Difference]: Start difference. First operand 161 states and 199 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 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-11 21:43:59,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:43:59,738 INFO L93 Difference]: Finished difference Result 334 states and 440 transitions. [2024-11-11 21:43:59,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 21:43:59,739 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 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-11 21:43:59,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:43:59,740 INFO L225 Difference]: With dead ends: 334 [2024-11-11 21:43:59,740 INFO L226 Difference]: Without dead ends: 252 [2024-11-11 21:43:59,740 INFO L434 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-11 21:43:59,740 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 568 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:43:59,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 764 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:43:59,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-11 21:43:59,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 161. [2024-11-11 21:43:59,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 159 states have (on average 1.2452830188679245) internal successors, (198), 160 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:43:59,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 198 transitions. [2024-11-11 21:43:59,743 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 198 transitions. Word has length 83 [2024-11-11 21:43:59,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:43:59,743 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 198 transitions. [2024-11-11 21:43:59,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 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-11 21:43:59,743 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 198 transitions. [2024-11-11 21:43:59,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-11 21:43:59,743 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:43:59,744 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:43:59,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-11 21:43:59,744 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:43:59,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:43:59,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1767300528, now seen corresponding path program 1 times [2024-11-11 21:43:59,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:43:59,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288730920] [2024-11-11 21:43:59,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:43:59,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:43:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:01,106 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-11 21:44:01,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:01,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288730920] [2024-11-11 21:44:01,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288730920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:44:01,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:44:01,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2024-11-11 21:44:01,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759194064] [2024-11-11 21:44:01,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:44:01,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-11 21:44:01,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:01,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-11 21:44:01,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2024-11-11 21:44:01,108 INFO L87 Difference]: Start difference. First operand 161 states and 198 transitions. Second operand has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:04,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:44:04,002 INFO L93 Difference]: Finished difference Result 624 states and 834 transitions. [2024-11-11 21:44:04,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-11 21:44:04,002 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-11-11 21:44:04,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:44:04,004 INFO L225 Difference]: With dead ends: 624 [2024-11-11 21:44:04,004 INFO L226 Difference]: Without dead ends: 618 [2024-11-11 21:44:04,004 INFO L434 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-11 21:44:04,005 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 1417 mSDsluCounter, 8008 mSDsCounter, 0 mSdLazyCounter, 4319 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1417 SdHoareTripleChecker+Valid, 8553 SdHoareTripleChecker+Invalid, 4331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 4319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-11 21:44:04,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1417 Valid, 8553 Invalid, 4331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 4319 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-11 21:44:04,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-11 21:44:04,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 182. [2024-11-11 21:44:04,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 180 states have (on average 1.2444444444444445) internal successors, (224), 181 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:04,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 224 transitions. [2024-11-11 21:44:04,009 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 224 transitions. Word has length 85 [2024-11-11 21:44:04,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:44:04,009 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 224 transitions. [2024-11-11 21:44:04,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:04,010 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 224 transitions. [2024-11-11 21:44:04,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-11 21:44:04,010 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:44:04,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:44:04,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-11 21:44:04,011 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:44:04,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:44:04,012 INFO L85 PathProgramCache]: Analyzing trace with hash -424299778, now seen corresponding path program 1 times [2024-11-11 21:44:04,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:44:04,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548351288] [2024-11-11 21:44:04,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:04,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:44:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:04,398 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-11 21:44:04,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:04,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548351288] [2024-11-11 21:44:04,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548351288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:44:04,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:44:04,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 21:44:04,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303041962] [2024-11-11 21:44:04,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:44:04,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 21:44:04,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:04,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 21:44:04,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:44:04,400 INFO L87 Difference]: Start difference. First operand 182 states and 224 transitions. Second operand has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:04,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:44:04,747 INFO L93 Difference]: Finished difference Result 259 states and 335 transitions. [2024-11-11 21:44:04,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 21:44:04,748 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-11-11 21:44:04,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:44:04,749 INFO L225 Difference]: With dead ends: 259 [2024-11-11 21:44:04,749 INFO L226 Difference]: Without dead ends: 253 [2024-11-11 21:44:04,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2024-11-11 21:44:04,749 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 392 mSDsluCounter, 1405 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 1660 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:44:04,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 1660 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:44:04,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-11 21:44:04,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 155. [2024-11-11 21:44:04,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.2467532467532467) internal successors, (192), 154 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:04,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 192 transitions. [2024-11-11 21:44:04,752 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 192 transitions. Word has length 86 [2024-11-11 21:44:04,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:44:04,752 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 192 transitions. [2024-11-11 21:44:04,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:04,752 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 192 transitions. [2024-11-11 21:44:04,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 21:44:04,752 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:44:04,753 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:44:04,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-11 21:44:04,753 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-11 21:44:04,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:44:04,753 INFO L85 PathProgramCache]: Analyzing trace with hash 529887998, now seen corresponding path program 1 times [2024-11-11 21:44:04,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:44:04,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363287015] [2024-11-11 21:44:04,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:04,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:44:04,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:04,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:44:04,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:04,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363287015] [2024-11-11 21:44:04,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363287015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:44:04,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:44:04,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:44:04,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852129951] [2024-11-11 21:44:04,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:44:04,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:44:04,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:04,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:44:04,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:44:04,891 INFO L87 Difference]: Start difference. First operand 155 states and 192 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:05,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:44:05,012 INFO L93 Difference]: Finished difference Result 795 states and 1142 transitions. [2024-11-11 21:44:05,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 21:44:05,012 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-11-11 21:44:05,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:44:05,014 INFO L225 Difference]: With dead ends: 795 [2024-11-11 21:44:05,014 INFO L226 Difference]: Without dead ends: 731 [2024-11-11 21:44:05,014 INFO L434 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-11 21:44:05,015 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 1483 mSDsluCounter, 1340 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1483 SdHoareTripleChecker+Valid, 1527 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:44:05,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1483 Valid, 1527 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:44:05,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-11-11 21:44:05,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 217. [2024-11-11 21:44:05,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.3148148148148149) internal successors, (284), 216 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:05,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 284 transitions. [2024-11-11 21:44:05,021 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 284 transitions. Word has length 112 [2024-11-11 21:44:05,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:44:05,021 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 284 transitions. [2024-11-11 21:44:05,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:05,021 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 284 transitions. [2024-11-11 21:44:05,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-11 21:44:05,022 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:44:05,022 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:44:05,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-11 21:44:05,022 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-11 21:44:05,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:44:05,023 INFO L85 PathProgramCache]: Analyzing trace with hash 257111127, now seen corresponding path program 1 times [2024-11-11 21:44:05,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:44:05,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448726846] [2024-11-11 21:44:05,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:05,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:44:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:05,131 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-11 21:44:05,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:05,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448726846] [2024-11-11 21:44:05,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448726846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:44:05,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:44:05,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:44:05,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904927746] [2024-11-11 21:44:05,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:44:05,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:44:05,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:05,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:44:05,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:44:05,133 INFO L87 Difference]: Start difference. First operand 217 states and 284 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-11 21:44:05,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:44:05,227 INFO L93 Difference]: Finished difference Result 911 states and 1312 transitions. [2024-11-11 21:44:05,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 21:44:05,228 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-11 21:44:05,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:44:05,230 INFO L225 Difference]: With dead ends: 911 [2024-11-11 21:44:05,230 INFO L226 Difference]: Without dead ends: 785 [2024-11-11 21:44:05,230 INFO L434 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-11 21:44:05,231 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 1186 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:44:05,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 940 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:44:05,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-11-11 21:44:05,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 341. [2024-11-11 21:44:05,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.3794117647058823) internal successors, (469), 340 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:05,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 469 transitions. [2024-11-11 21:44:05,254 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 469 transitions. Word has length 114 [2024-11-11 21:44:05,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:44:05,255 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 469 transitions. [2024-11-11 21:44:05,255 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-11 21:44:05,255 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 469 transitions. [2024-11-11 21:44:05,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-11 21:44:05,256 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:44:05,256 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:44:05,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-11 21:44:05,257 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-11 21:44:05,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:44:05,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1982497248, now seen corresponding path program 1 times [2024-11-11 21:44:05,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:44:05,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33740000] [2024-11-11 21:44:05,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:05,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:44:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:05,479 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-11 21:44:05,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:05,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33740000] [2024-11-11 21:44:05,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33740000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:44:05,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:44:05,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:44:05,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067735312] [2024-11-11 21:44:05,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:44:05,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:44:05,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:05,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:44:05,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:44:05,481 INFO L87 Difference]: Start difference. First operand 341 states and 469 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-11 21:44:05,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:44:05,577 INFO L93 Difference]: Finished difference Result 593 states and 842 transitions. [2024-11-11 21:44:05,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 21:44:05,578 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-11 21:44:05,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:44:05,579 INFO L225 Difference]: With dead ends: 593 [2024-11-11 21:44:05,579 INFO L226 Difference]: Without dead ends: 343 [2024-11-11 21:44:05,579 INFO L434 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-11 21:44:05,580 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 399 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:44:05,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 546 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:44:05,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-11-11 21:44:05,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2024-11-11 21:44:05,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.3735294117647059) internal successors, (467), 340 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:05,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 467 transitions. [2024-11-11 21:44:05,584 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 467 transitions. Word has length 114 [2024-11-11 21:44:05,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:44:05,584 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 467 transitions. [2024-11-11 21:44:05,585 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-11 21:44:05,585 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 467 transitions. [2024-11-11 21:44:05,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-11 21:44:05,585 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:44:05,586 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:44:05,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-11 21:44:05,586 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-11 21:44:05,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:44:05,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1242756927, now seen corresponding path program 1 times [2024-11-11 21:44:05,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:44:05,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689056646] [2024-11-11 21:44:05,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:05,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:44:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:05,652 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-11 21:44:05,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:05,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689056646] [2024-11-11 21:44:05,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689056646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:44:05,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:44:05,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:44:05,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974713271] [2024-11-11 21:44:05,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:44:05,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:44:05,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:05,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:44:05,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:44:05,654 INFO L87 Difference]: Start difference. First operand 341 states and 467 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 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-11 21:44:05,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:44:05,681 INFO L93 Difference]: Finished difference Result 815 states and 1163 transitions. [2024-11-11 21:44:05,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:44:05,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 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-11 21:44:05,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:44:05,684 INFO L225 Difference]: With dead ends: 815 [2024-11-11 21:44:05,684 INFO L226 Difference]: Without dead ends: 565 [2024-11-11 21:44:05,684 INFO L434 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-11 21:44:05,685 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 111 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:44:05,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 306 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:44:05,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-11-11 21:44:05,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 559. [2024-11-11 21:44:05,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.3942652329749103) internal successors, (778), 558 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:05,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 778 transitions. [2024-11-11 21:44:05,691 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 778 transitions. Word has length 114 [2024-11-11 21:44:05,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:44:05,692 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 778 transitions. [2024-11-11 21:44:05,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 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-11 21:44:05,692 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 778 transitions. [2024-11-11 21:44:05,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-11 21:44:05,692 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:44:05,692 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:44:05,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-11 21:44:05,693 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-11 21:44:05,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:44:05,693 INFO L85 PathProgramCache]: Analyzing trace with hash 335311913, now seen corresponding path program 1 times [2024-11-11 21:44:05,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:44:05,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946611474] [2024-11-11 21:44:05,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:05,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:44:05,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:05,835 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-11 21:44:05,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:05,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946611474] [2024-11-11 21:44:05,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946611474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:44:05,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:44:05,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:44:05,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030020258] [2024-11-11 21:44:05,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:44:05,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:44:05,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:05,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:44:05,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:44:05,837 INFO L87 Difference]: Start difference. First operand 559 states and 778 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-11 21:44:05,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:44:05,954 INFO L93 Difference]: Finished difference Result 1853 states and 2658 transitions. [2024-11-11 21:44:05,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 21:44:05,955 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-11 21:44:05,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:44:05,962 INFO L225 Difference]: With dead ends: 1853 [2024-11-11 21:44:05,962 INFO L226 Difference]: Without dead ends: 1618 [2024-11-11 21:44:05,963 INFO L434 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-11 21:44:05,963 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 1109 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:44:05,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1109 Valid, 996 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:44:05,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2024-11-11 21:44:05,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 909. [2024-11-11 21:44:05,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 908 states have (on average 1.4162995594713657) internal successors, (1286), 908 states have internal predecessors, (1286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:05,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1286 transitions. [2024-11-11 21:44:05,982 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1286 transitions. Word has length 114 [2024-11-11 21:44:05,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:44:05,982 INFO L471 AbstractCegarLoop]: Abstraction has 909 states and 1286 transitions. [2024-11-11 21:44:05,982 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-11 21:44:05,983 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1286 transitions. [2024-11-11 21:44:05,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-11 21:44:05,983 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:44:05,984 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:44:05,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-11 21:44:05,984 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-11 21:44:05,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:44:05,984 INFO L85 PathProgramCache]: Analyzing trace with hash -784107677, now seen corresponding path program 1 times [2024-11-11 21:44:05,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:44:05,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691170965] [2024-11-11 21:44:05,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:05,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:44:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:06,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:44:06,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:06,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691170965] [2024-11-11 21:44:06,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691170965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:44:06,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:44:06,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:44:06,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471962535] [2024-11-11 21:44:06,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:44:06,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:44:06,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:06,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:44:06,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:44:06,128 INFO L87 Difference]: Start difference. First operand 909 states and 1286 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-11 21:44:06,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:44:06,212 INFO L93 Difference]: Finished difference Result 2086 states and 2997 transitions. [2024-11-11 21:44:06,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 21:44:06,213 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-11 21:44:06,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:44:06,215 INFO L225 Difference]: With dead ends: 2086 [2024-11-11 21:44:06,215 INFO L226 Difference]: Without dead ends: 1851 [2024-11-11 21:44:06,216 INFO L434 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-11 21:44:06,217 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 1004 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:44:06,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 1061 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:44:06,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2024-11-11 21:44:06,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1142. [2024-11-11 21:44:06,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 1141 states have (on average 1.4241893076248904) internal successors, (1625), 1141 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:06,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1625 transitions. [2024-11-11 21:44:06,231 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1625 transitions. Word has length 114 [2024-11-11 21:44:06,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:44:06,231 INFO L471 AbstractCegarLoop]: Abstraction has 1142 states and 1625 transitions. [2024-11-11 21:44:06,231 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-11 21:44:06,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1625 transitions. [2024-11-11 21:44:06,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-11 21:44:06,232 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:44:06,232 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:44:06,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-11 21:44:06,232 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-11 21:44:06,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:44:06,233 INFO L85 PathProgramCache]: Analyzing trace with hash -651533795, now seen corresponding path program 1 times [2024-11-11 21:44:06,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:44:06,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839461299] [2024-11-11 21:44:06,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:06,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:44:06,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:06,372 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-11 21:44:06,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:06,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839461299] [2024-11-11 21:44:06,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839461299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:44:06,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:44:06,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:44:06,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821538337] [2024-11-11 21:44:06,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:44:06,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:44:06,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:06,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:44:06,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:44:06,375 INFO L87 Difference]: Start difference. First operand 1142 states and 1625 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-11 21:44:06,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:44:06,490 INFO L93 Difference]: Finished difference Result 2319 states and 3336 transitions. [2024-11-11 21:44:06,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 21:44:06,490 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-11 21:44:06,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:44:06,493 INFO L225 Difference]: With dead ends: 2319 [2024-11-11 21:44:06,493 INFO L226 Difference]: Without dead ends: 2084 [2024-11-11 21:44:06,494 INFO L434 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-11 21:44:06,496 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 1039 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:44:06,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 1107 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:44:06,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2084 states. [2024-11-11 21:44:06,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2084 to 1375. [2024-11-11 21:44:06,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 1374 states have (on average 1.4294032023289664) internal successors, (1964), 1374 states have internal predecessors, (1964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:06,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 1964 transitions. [2024-11-11 21:44:06,514 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 1964 transitions. Word has length 114 [2024-11-11 21:44:06,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:44:06,515 INFO L471 AbstractCegarLoop]: Abstraction has 1375 states and 1964 transitions. [2024-11-11 21:44:06,515 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-11 21:44:06,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1964 transitions. [2024-11-11 21:44:06,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-11 21:44:06,517 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:44:06,517 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:44:06,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-11 21:44:06,517 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-11 21:44:06,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:44:06,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1268705059, now seen corresponding path program 1 times [2024-11-11 21:44:06,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:44:06,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706758787] [2024-11-11 21:44:06,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:06,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:44:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:06,623 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-11 21:44:06,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:06,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706758787] [2024-11-11 21:44:06,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706758787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:44:06,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:44:06,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:44:06,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62794664] [2024-11-11 21:44:06,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:44:06,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:44:06,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:06,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:44:06,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:44:06,627 INFO L87 Difference]: Start difference. First operand 1375 states and 1964 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:06,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:44:06,652 INFO L93 Difference]: Finished difference Result 3855 states and 5544 transitions. [2024-11-11 21:44:06,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:44:06,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2024-11-11 21:44:06,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:44:06,656 INFO L225 Difference]: With dead ends: 3855 [2024-11-11 21:44:06,656 INFO L226 Difference]: Without dead ends: 2571 [2024-11-11 21:44:06,658 INFO L434 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-11 21:44:06,661 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 89 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 407 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-11 21:44:06,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 407 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:44:06,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2024-11-11 21:44:06,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2481. [2024-11-11 21:44:06,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2481 states, 2480 states have (on average 1.429032258064516) internal successors, (3544), 2480 states have internal predecessors, (3544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:06,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3544 transitions. [2024-11-11 21:44:06,695 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3544 transitions. Word has length 115 [2024-11-11 21:44:06,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:44:06,696 INFO L471 AbstractCegarLoop]: Abstraction has 2481 states and 3544 transitions. [2024-11-11 21:44:06,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:06,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3544 transitions. [2024-11-11 21:44:06,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-11 21:44:06,697 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:44:06,697 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:44:06,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-11-11 21:44:06,698 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-11 21:44:06,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:44:06,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1444283991, now seen corresponding path program 1 times [2024-11-11 21:44:06,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:44:06,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852940054] [2024-11-11 21:44:06,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:06,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:44:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:06,798 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-11 21:44:06,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:06,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852940054] [2024-11-11 21:44:06,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852940054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:44:06,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:44:06,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:44:06,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526179933] [2024-11-11 21:44:06,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:44:06,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:44:06,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:06,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:44:06,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:44:06,799 INFO L87 Difference]: Start difference. First operand 2481 states and 3544 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-11 21:44:06,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:44:06,824 INFO L93 Difference]: Finished difference Result 7085 states and 10130 transitions. [2024-11-11 21:44:06,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:44:06,825 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-11 21:44:06,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:44:06,830 INFO L225 Difference]: With dead ends: 7085 [2024-11-11 21:44:06,830 INFO L226 Difference]: Without dead ends: 4695 [2024-11-11 21:44:06,833 INFO L434 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-11 21:44:06,833 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 82 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 407 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-11 21:44:06,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 407 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:44:06,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4695 states. [2024-11-11 21:44:06,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4695 to 4517. [2024-11-11 21:44:06,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4517 states, 4516 states have (on average 1.421169176262179) internal successors, (6418), 4516 states have internal predecessors, (6418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:06,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4517 states to 4517 states and 6418 transitions. [2024-11-11 21:44:06,902 INFO L78 Accepts]: Start accepts. Automaton has 4517 states and 6418 transitions. Word has length 116 [2024-11-11 21:44:06,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:44:06,902 INFO L471 AbstractCegarLoop]: Abstraction has 4517 states and 6418 transitions. [2024-11-11 21:44:06,902 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-11 21:44:06,902 INFO L276 IsEmpty]: Start isEmpty. Operand 4517 states and 6418 transitions. [2024-11-11 21:44:06,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-11 21:44:06,903 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:44:06,903 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:44:06,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-11-11 21:44:06,904 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-11 21:44:06,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:44:06,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1913447474, now seen corresponding path program 1 times [2024-11-11 21:44:06,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:44:06,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304402680] [2024-11-11 21:44:06,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:06,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:44:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:06,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:44:06,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:06,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304402680] [2024-11-11 21:44:06,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304402680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:44:06,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:44:06,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:44:06,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627510127] [2024-11-11 21:44:06,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:44:06,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:44:06,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:07,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:44:07,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:44:07,000 INFO L87 Difference]: Start difference. First operand 4517 states and 6418 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-11 21:44:07,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:44:07,030 INFO L93 Difference]: Finished difference Result 13017 states and 18444 transitions. [2024-11-11 21:44:07,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:44:07,030 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-11 21:44:07,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:44:07,045 INFO L225 Difference]: With dead ends: 13017 [2024-11-11 21:44:07,046 INFO L226 Difference]: Without dead ends: 8591 [2024-11-11 21:44:07,053 INFO L434 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-11 21:44:07,054 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 75 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 407 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-11 21:44:07,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 407 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:44:07,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8591 states. [2024-11-11 21:44:07,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8591 to 8237. [2024-11-11 21:44:07,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8237 states, 8236 states have (on average 1.407722195240408) internal successors, (11594), 8236 states have internal predecessors, (11594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:07,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8237 states to 8237 states and 11594 transitions. [2024-11-11 21:44:07,155 INFO L78 Accepts]: Start accepts. Automaton has 8237 states and 11594 transitions. Word has length 117 [2024-11-11 21:44:07,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:44:07,156 INFO L471 AbstractCegarLoop]: Abstraction has 8237 states and 11594 transitions. [2024-11-11 21:44:07,156 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-11 21:44:07,156 INFO L276 IsEmpty]: Start isEmpty. Operand 8237 states and 11594 transitions. [2024-11-11 21:44:07,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-11 21:44:07,157 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:44:07,157 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:44:07,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-11-11 21:44:07,158 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-11 21:44:07,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:44:07,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1786344024, now seen corresponding path program 1 times [2024-11-11 21:44:07,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:44:07,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245833400] [2024-11-11 21:44:07,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:07,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:44:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:07,257 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-11 21:44:07,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:07,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245833400] [2024-11-11 21:44:07,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245833400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:44:07,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:44:07,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:44:07,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835442966] [2024-11-11 21:44:07,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:44:07,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:44:07,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:07,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:44:07,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:44:07,258 INFO L87 Difference]: Start difference. First operand 8237 states and 11594 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-11 21:44:07,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:44:07,310 INFO L93 Difference]: Finished difference Result 23825 states and 33356 transitions. [2024-11-11 21:44:07,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:44:07,311 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-11 21:44:07,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:44:07,332 INFO L225 Difference]: With dead ends: 23825 [2024-11-11 21:44:07,333 INFO L226 Difference]: Without dead ends: 15679 [2024-11-11 21:44:07,345 INFO L434 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-11 21:44:07,346 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 65 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 407 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-11 21:44:07,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 407 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:44:07,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15679 states. [2024-11-11 21:44:07,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15679 to 14973. [2024-11-11 21:44:07,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14973 states, 14972 states have (on average 1.389393534597916) internal successors, (20802), 14972 states have internal predecessors, (20802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:07,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14973 states to 14973 states and 20802 transitions. [2024-11-11 21:44:07,573 INFO L78 Accepts]: Start accepts. Automaton has 14973 states and 20802 transitions. Word has length 118 [2024-11-11 21:44:07,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:44:07,573 INFO L471 AbstractCegarLoop]: Abstraction has 14973 states and 20802 transitions. [2024-11-11 21:44:07,573 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-11 21:44:07,573 INFO L276 IsEmpty]: Start isEmpty. Operand 14973 states and 20802 transitions. [2024-11-11 21:44:07,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-11 21:44:07,574 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:44:07,574 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:44:07,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-11-11 21:44:07,574 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-11 21:44:07,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:44:07,575 INFO L85 PathProgramCache]: Analyzing trace with hash 880608737, now seen corresponding path program 1 times [2024-11-11 21:44:07,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:44:07,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211243434] [2024-11-11 21:44:07,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:07,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:44:07,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:07,814 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-11 21:44:07,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:07,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211243434] [2024-11-11 21:44:07,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211243434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:44:07,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:44:07,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:44:07,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41563336] [2024-11-11 21:44:07,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:44:07,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:44:07,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:07,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:44:07,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:44:07,817 INFO L87 Difference]: Start difference. First operand 14973 states and 20802 transitions. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 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-11 21:44:07,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:44:07,871 INFO L93 Difference]: Finished difference Result 15455 states and 21443 transitions. [2024-11-11 21:44:07,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:44:07,872 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 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-11 21:44:07,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:44:07,893 INFO L225 Difference]: With dead ends: 15455 [2024-11-11 21:44:07,894 INFO L226 Difference]: Without dead ends: 15453 [2024-11-11 21:44:07,903 INFO L434 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-11 21:44:07,903 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 0 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:44:07,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 929 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:44:07,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15453 states. [2024-11-11 21:44:08,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15453 to 15453. [2024-11-11 21:44:08,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15453 states, 15452 states have (on average 1.3710846492363449) internal successors, (21186), 15452 states have internal predecessors, (21186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:08,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15453 states to 15453 states and 21186 transitions. [2024-11-11 21:44:08,256 INFO L78 Accepts]: Start accepts. Automaton has 15453 states and 21186 transitions. Word has length 119 [2024-11-11 21:44:08,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:44:08,256 INFO L471 AbstractCegarLoop]: Abstraction has 15453 states and 21186 transitions. [2024-11-11 21:44:08,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 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-11 21:44:08,256 INFO L276 IsEmpty]: Start isEmpty. Operand 15453 states and 21186 transitions. [2024-11-11 21:44:08,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-11 21:44:08,257 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:44:08,257 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:44:08,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-11-11 21:44:08,258 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-11 21:44:08,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:44:08,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1221320670, now seen corresponding path program 1 times [2024-11-11 21:44:08,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:44:08,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689234042] [2024-11-11 21:44:08,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:08,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:44:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:08,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-11 21:44:08,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:08,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689234042] [2024-11-11 21:44:08,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689234042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:44:08,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:44:08,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:44:08,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902641902] [2024-11-11 21:44:08,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:44:08,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:44:08,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:08,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:44:08,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:44:08,395 INFO L87 Difference]: Start difference. First operand 15453 states and 21186 transitions. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 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-11 21:44:08,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:44:08,576 INFO L93 Difference]: Finished difference Result 29465 states and 40552 transitions. [2024-11-11 21:44:08,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 21:44:08,577 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 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-11 21:44:08,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:44:08,616 INFO L225 Difference]: With dead ends: 29465 [2024-11-11 21:44:08,616 INFO L226 Difference]: Without dead ends: 26663 [2024-11-11 21:44:08,629 INFO L434 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-11 21:44:08,629 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 1177 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1177 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:44:08,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1177 Valid, 1112 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:44:08,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26663 states. [2024-11-11 21:44:08,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26663 to 18253. [2024-11-11 21:44:08,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18253 states, 18252 states have (on average 1.3711374095989481) internal successors, (25026), 18252 states have internal predecessors, (25026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:08,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18253 states to 18253 states and 25026 transitions. [2024-11-11 21:44:08,873 INFO L78 Accepts]: Start accepts. Automaton has 18253 states and 25026 transitions. Word has length 119 [2024-11-11 21:44:08,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:44:08,873 INFO L471 AbstractCegarLoop]: Abstraction has 18253 states and 25026 transitions. [2024-11-11 21:44:08,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 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-11 21:44:08,874 INFO L276 IsEmpty]: Start isEmpty. Operand 18253 states and 25026 transitions. [2024-11-11 21:44:08,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-11 21:44:08,874 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:44:08,875 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:44:08,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-11-11 21:44:08,875 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-11 21:44:08,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:44:08,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1777695494, now seen corresponding path program 1 times [2024-11-11 21:44:08,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:44:08,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930672266] [2024-11-11 21:44:08,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:08,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:44:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:09,166 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-11 21:44:09,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:09,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930672266] [2024-11-11 21:44:09,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930672266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:44:09,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:44:09,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:44:09,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763730908] [2024-11-11 21:44:09,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:44:09,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:44:09,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:09,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:44:09,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:44:09,169 INFO L87 Difference]: Start difference. First operand 18253 states and 25026 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-11 21:44:09,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:44:09,280 INFO L93 Difference]: Finished difference Result 47297 states and 64676 transitions. [2024-11-11 21:44:09,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:44:09,281 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-11 21:44:09,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:44:09,329 INFO L225 Difference]: With dead ends: 47297 [2024-11-11 21:44:09,329 INFO L226 Difference]: Without dead ends: 29135 [2024-11-11 21:44:09,360 INFO L434 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-11 21:44:09,361 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 93 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 410 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-11 21:44:09,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 410 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:44:09,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29135 states. [2024-11-11 21:44:09,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29135 to 27469. [2024-11-11 21:44:09,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27469 states, 27468 states have (on average 1.356123489151012) internal successors, (37250), 27468 states have internal predecessors, (37250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:09,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27469 states to 27469 states and 37250 transitions. [2024-11-11 21:44:09,813 INFO L78 Accepts]: Start accepts. Automaton has 27469 states and 37250 transitions. Word has length 120 [2024-11-11 21:44:09,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:44:09,813 INFO L471 AbstractCegarLoop]: Abstraction has 27469 states and 37250 transitions. [2024-11-11 21:44:09,813 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-11 21:44:09,814 INFO L276 IsEmpty]: Start isEmpty. Operand 27469 states and 37250 transitions. [2024-11-11 21:44:09,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-11 21:44:09,819 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:44:09,819 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2024-11-11 21:44:09,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-11-11 21:44:09,820 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:44:09,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:44:09,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1132154545, now seen corresponding path program 1 times [2024-11-11 21:44:09,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:44:09,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444241838] [2024-11-11 21:44:09,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:09,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:44:09,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:10,031 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:44:10,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:10,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444241838] [2024-11-11 21:44:10,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444241838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:44:10,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:44:10,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:44:10,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663443441] [2024-11-11 21:44:10,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:44:10,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:44:10,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:10,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:44:10,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:44:10,033 INFO L87 Difference]: Start difference. First operand 27469 states and 37250 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:10,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:44:10,152 INFO L93 Difference]: Finished difference Result 54849 states and 74404 transitions. [2024-11-11 21:44:10,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:44:10,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2024-11-11 21:44:10,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:44:10,189 INFO L225 Difference]: With dead ends: 54849 [2024-11-11 21:44:10,189 INFO L226 Difference]: Without dead ends: 27471 [2024-11-11 21:44:10,218 INFO L434 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-11 21:44:10,219 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 82 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:44:10,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 380 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:44:10,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27471 states. [2024-11-11 21:44:10,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27471 to 27469. [2024-11-11 21:44:10,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27469 states, 27468 states have (on average 1.3409785932721712) internal successors, (36834), 27468 states have internal predecessors, (36834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:10,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27469 states to 27469 states and 36834 transitions. [2024-11-11 21:44:10,546 INFO L78 Accepts]: Start accepts. Automaton has 27469 states and 36834 transitions. Word has length 150 [2024-11-11 21:44:10,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:44:10,546 INFO L471 AbstractCegarLoop]: Abstraction has 27469 states and 36834 transitions. [2024-11-11 21:44:10,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:44:10,546 INFO L276 IsEmpty]: Start isEmpty. Operand 27469 states and 36834 transitions. [2024-11-11 21:44:10,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-11 21:44:10,551 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:44:10,551 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 21:44:10,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-11-11 21:44:10,551 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-11-11 21:44:10,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:44:10,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1845946094, now seen corresponding path program 1 times [2024-11-11 21:44:10,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:44:10,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795418533] [2024-11-11 21:44:10,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:10,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:44:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:10,856 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:44:10,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:44:10,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795418533] [2024-11-11 21:44:10,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795418533] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:44:10,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072351633] [2024-11-11 21:44:10,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:44:10,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:44:10,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:44:10,860 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-11 21:44:10,861 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-11 21:44:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:44:11,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-11 21:44:11,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:44:12,164 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:44:12,165 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:44:13,880 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:44:13,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072351633] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:44:13,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:44:13,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 25 [2024-11-11 21:44:13,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526311179] [2024-11-11 21:44:13,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:44:13,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-11 21:44:13,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:44:13,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-11 21:44:13,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2024-11-11 21:44:13,884 INFO L87 Difference]: Start difference. First operand 27469 states and 36834 transitions. Second operand has 26 states, 26 states have (on average 14.692307692307692) internal successors, (382), 25 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)