./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/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/loop-invgen/apache-escape-absolute.i.v+cfa-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.graphml --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 ce67d33baf8e2191d295422ec2c8649be746cd4f4f75c5de99bdc3950e33cc6c --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 13:49:27,596 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 13:49:27,598 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 13:49:27,622 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 13:49:27,622 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 13:49:27,624 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 13:49:27,626 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 13:49:27,630 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 13:49:27,631 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 13:49:27,635 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 13:49:27,635 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 13:49:27,636 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 13:49:27,636 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 13:49:27,638 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 13:49:27,640 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 13:49:27,641 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 13:49:27,642 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 13:49:27,642 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 13:49:27,645 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 13:49:27,649 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 13:49:27,650 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 13:49:27,651 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 13:49:27,652 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 13:49:27,652 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 13:49:27,657 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 13:49:27,657 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 13:49:27,657 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 13:49:27,658 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 13:49:27,659 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 13:49:27,659 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 13:49:27,660 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 13:49:27,660 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 13:49:27,661 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 13:49:27,662 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 13:49:27,663 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 13:49:27,663 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 13:49:27,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 13:49:27,664 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 13:49:27,664 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 13:49:27,664 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 13:49:27,665 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 13:49:27,666 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 13:49:27,689 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 13:49:27,692 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 13:49:27,692 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 13:49:27,692 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 13:49:27,693 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 13:49:27,693 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 13:49:27,693 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 13:49:27,693 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 13:49:27,693 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 13:49:27,694 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 13:49:27,694 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 13:49:27,694 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 13:49:27,695 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 13:49:27,695 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 13:49:27,695 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 13:49:27,695 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 13:49:27,695 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 13:49:27,695 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 13:49:27,695 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 13:49:27,695 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 13:49:27,696 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 13:49:27,696 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 13:49:27,696 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 13:49:27,696 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 13:49:27,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:49:27,696 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 13:49:27,696 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 13:49:27,697 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 13:49:27,697 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 13:49:27,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 13:49:27,697 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 13:49:27,697 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 13:49:27,697 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 13:49:27,698 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 13:49:27,698 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> ce67d33baf8e2191d295422ec2c8649be746cd4f4f75c5de99bdc3950e33cc6c [2021-12-14 13:49:27,884 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 13:49:27,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 13:49:27,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 13:49:27,905 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 13:49:27,905 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 13:49:27,906 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2021-12-14 13:49:27,955 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e812d0b20/a081da1733214d2b91a2787da65ae043/FLAGefc0b0be4 [2021-12-14 13:49:28,313 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 13:49:28,313 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2021-12-14 13:49:28,318 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e812d0b20/a081da1733214d2b91a2787da65ae043/FLAGefc0b0be4 [2021-12-14 13:49:28,342 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e812d0b20/a081da1733214d2b91a2787da65ae043 [2021-12-14 13:49:28,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 13:49:28,345 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 13:49:28,348 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 13:49:28,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 13:49:28,351 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 13:49:28,351 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:49:28" (1/1) ... [2021-12-14 13:49:28,358 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1732fae7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:49:28, skipping insertion in model container [2021-12-14 13:49:28,358 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:49:28" (1/1) ... [2021-12-14 13:49:28,362 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 13:49:28,410 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 13:49:28,555 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2021-12-14 13:49:28,564 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2021-12-14 13:49:28,569 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2021-12-14 13:49:28,571 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2021-12-14 13:49:28,574 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2021-12-14 13:49:28,580 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2021-12-14 13:49:28,584 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2021-12-14 13:49:28,585 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2021-12-14 13:49:28,587 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2021-12-14 13:49:28,589 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2021-12-14 13:49:28,590 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2021-12-14 13:49:28,591 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2021-12-14 13:49:28,593 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2021-12-14 13:49:28,594 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2021-12-14 13:49:28,595 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2021-12-14 13:49:28,596 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2021-12-14 13:49:28,598 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2021-12-14 13:49:28,599 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2021-12-14 13:49:28,601 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:49:28,607 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 13:49:28,617 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2021-12-14 13:49:28,618 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2021-12-14 13:49:28,619 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2021-12-14 13:49:28,625 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2021-12-14 13:49:28,626 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2021-12-14 13:49:28,626 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2021-12-14 13:49:28,628 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2021-12-14 13:49:28,629 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2021-12-14 13:49:28,630 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2021-12-14 13:49:28,631 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2021-12-14 13:49:28,632 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2021-12-14 13:49:28,633 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2021-12-14 13:49:28,634 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2021-12-14 13:49:28,635 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2021-12-14 13:49:28,636 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2021-12-14 13:49:28,637 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2021-12-14 13:49:28,638 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2021-12-14 13:49:28,639 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2021-12-14 13:49:28,641 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:49:28,650 INFO L208 MainTranslator]: Completed translation [2021-12-14 13:49:28,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:49:28 WrapperNode [2021-12-14 13:49:28,650 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 13:49:28,652 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 13:49:28,653 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 13:49:28,653 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 13:49:28,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:49:28" (1/1) ... [2021-12-14 13:49:28,687 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:49:28" (1/1) ... [2021-12-14 13:49:28,719 INFO L137 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 254 [2021-12-14 13:49:28,721 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 13:49:28,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 13:49:28,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 13:49:28,722 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 13:49:28,728 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:49:28" (1/1) ... [2021-12-14 13:49:28,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:49:28" (1/1) ... [2021-12-14 13:49:28,729 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:49:28" (1/1) ... [2021-12-14 13:49:28,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:49:28" (1/1) ... [2021-12-14 13:49:28,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:49:28" (1/1) ... [2021-12-14 13:49:28,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:49:28" (1/1) ... [2021-12-14 13:49:28,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:49:28" (1/1) ... [2021-12-14 13:49:28,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 13:49:28,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 13:49:28,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 13:49:28,737 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 13:49:28,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:49:28" (1/1) ... [2021-12-14 13:49:28,755 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:49:28,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:49:28,813 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 13:49:28,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-14 13:49:28,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 13:49:28,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 13:49:28,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 13:49:28,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 13:49:28,945 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 13:49:28,946 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 13:49:29,133 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 13:49:29,139 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 13:49:29,139 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-14 13:49:29,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:49:29 BoogieIcfgContainer [2021-12-14 13:49:29,141 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 13:49:29,142 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 13:49:29,143 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 13:49:29,145 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 13:49:29,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:49:28" (1/3) ... [2021-12-14 13:49:29,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0438cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:49:29, skipping insertion in model container [2021-12-14 13:49:29,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:49:28" (2/3) ... [2021-12-14 13:49:29,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0438cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:49:29, skipping insertion in model container [2021-12-14 13:49:29,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:49:29" (3/3) ... [2021-12-14 13:49:29,148 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2021-12-14 13:49:29,152 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 13:49:29,152 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2021-12-14 13:49:29,190 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 13:49:29,195 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 13:49:29,195 INFO L340 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2021-12-14 13:49:29,208 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 81 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) [2021-12-14 13:49:29,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-14 13:49:29,214 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:49:29,214 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:49:29,215 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-12-14 13:49:29,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:49:29,220 INFO L85 PathProgramCache]: Analyzing trace with hash -2034435078, now seen corresponding path program 1 times [2021-12-14 13:49:29,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:49:29,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599398861] [2021-12-14 13:49:29,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:49:29,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:49:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:49:29,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:49:29,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:49:29,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599398861] [2021-12-14 13:49:29,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599398861] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:49:29,402 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:49:29,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 13:49:29,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235149797] [2021-12-14 13:49:29,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:49:29,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 13:49:29,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:49:29,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 13:49:29,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 13:49:29,448 INFO L87 Difference]: Start difference. First operand has 82 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 81 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) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:29,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:49:29,477 INFO L93 Difference]: Finished difference Result 88 states and 123 transitions. [2021-12-14 13:49:29,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 13:49:29,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-14 13:49:29,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:49:29,486 INFO L225 Difference]: With dead ends: 88 [2021-12-14 13:49:29,486 INFO L226 Difference]: Without dead ends: 76 [2021-12-14 13:49:29,488 INFO L932 BasicCegarLoop]: 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 [2021-12-14 13:49:29,494 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 75 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:49:29,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 124 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:49:29,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-14 13:49:29,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2021-12-14 13:49:29,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 75 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:29,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2021-12-14 13:49:29,532 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 15 [2021-12-14 13:49:29,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:49:29,532 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2021-12-14 13:49:29,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:29,533 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2021-12-14 13:49:29,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 13:49:29,533 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:49:29,533 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:49:29,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 13:49:29,534 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-12-14 13:49:29,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:49:29,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1357026114, now seen corresponding path program 1 times [2021-12-14 13:49:29,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:49:29,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85968078] [2021-12-14 13:49:29,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:49:29,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:49:29,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:49:29,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:49:29,596 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:49:29,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85968078] [2021-12-14 13:49:29,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85968078] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:49:29,596 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:49:29,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 13:49:29,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150106229] [2021-12-14 13:49:29,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:49:29,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 13:49:29,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:49:29,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 13:49:29,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 13:49:29,598 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:29,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:49:29,652 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2021-12-14 13:49:29,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 13:49:29,652 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-14 13:49:29,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:49:29,653 INFO L225 Difference]: With dead ends: 76 [2021-12-14 13:49:29,653 INFO L226 Difference]: Without dead ends: 74 [2021-12-14 13:49:29,653 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-14 13:49:29,654 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 246 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:49:29,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 80 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:49:29,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-12-14 13:49:29,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-12-14 13:49:29,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 73 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:29,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2021-12-14 13:49:29,660 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 16 [2021-12-14 13:49:29,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:49:29,660 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2021-12-14 13:49:29,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:29,660 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2021-12-14 13:49:29,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-14 13:49:29,661 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:49:29,661 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:49:29,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 13:49:29,661 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-12-14 13:49:29,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:49:29,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1567835227, now seen corresponding path program 1 times [2021-12-14 13:49:29,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:49:29,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739670406] [2021-12-14 13:49:29,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:49:29,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:49:29,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:49:29,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:49:29,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:49:29,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739670406] [2021-12-14 13:49:29,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739670406] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:49:29,699 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:49:29,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 13:49:29,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516744779] [2021-12-14 13:49:29,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:49:29,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 13:49:29,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:49:29,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 13:49:29,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 13:49:29,701 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:29,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:49:29,741 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2021-12-14 13:49:29,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 13:49:29,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-14 13:49:29,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:49:29,742 INFO L225 Difference]: With dead ends: 97 [2021-12-14 13:49:29,742 INFO L226 Difference]: Without dead ends: 95 [2021-12-14 13:49:29,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:49:29,743 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 110 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:49:29,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 120 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:49:29,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-14 13:49:29,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 72. [2021-12-14 13:49:29,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 71 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) [2021-12-14 13:49:29,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2021-12-14 13:49:29,754 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 18 [2021-12-14 13:49:29,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:49:29,755 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2021-12-14 13:49:29,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:29,755 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2021-12-14 13:49:29,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-14 13:49:29,756 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:49:29,756 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:49:29,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 13:49:29,756 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-12-14 13:49:29,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:49:29,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1358247672, now seen corresponding path program 1 times [2021-12-14 13:49:29,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:49:29,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315287186] [2021-12-14 13:49:29,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:49:29,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:49:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:49:29,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:49:29,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:49:29,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315287186] [2021-12-14 13:49:29,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315287186] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:49:29,802 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:49:29,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 13:49:29,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236660871] [2021-12-14 13:49:29,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:49:29,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 13:49:29,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:49:29,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 13:49:29,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:49:29,804 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:29,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:49:29,847 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2021-12-14 13:49:29,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 13:49:29,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-14 13:49:29,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:49:29,848 INFO L225 Difference]: With dead ends: 72 [2021-12-14 13:49:29,848 INFO L226 Difference]: Without dead ends: 70 [2021-12-14 13:49:29,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-14 13:49:29,849 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 165 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:49:29,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 77 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:49:29,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-12-14 13:49:29,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-12-14 13:49:29,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 69 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) [2021-12-14 13:49:29,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2021-12-14 13:49:29,854 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 19 [2021-12-14 13:49:29,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:49:29,854 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2021-12-14 13:49:29,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:29,854 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2021-12-14 13:49:29,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 13:49:29,855 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:49:29,855 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:49:29,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 13:49:29,855 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-12-14 13:49:29,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:49:29,856 INFO L85 PathProgramCache]: Analyzing trace with hash -665385716, now seen corresponding path program 1 times [2021-12-14 13:49:29,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:49:29,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628906124] [2021-12-14 13:49:29,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:49:29,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:49:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:49:29,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:49:29,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:49:29,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628906124] [2021-12-14 13:49:29,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628906124] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:49:29,904 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:49:29,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 13:49:29,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775321571] [2021-12-14 13:49:29,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:49:29,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 13:49:29,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:49:29,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 13:49:29,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:49:29,910 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:30,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:49:30,066 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2021-12-14 13:49:30,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 13:49:30,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-14 13:49:30,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:49:30,070 INFO L225 Difference]: With dead ends: 137 [2021-12-14 13:49:30,070 INFO L226 Difference]: Without dead ends: 135 [2021-12-14 13:49:30,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-14 13:49:30,074 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 128 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:49:30,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 295 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:49:30,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-12-14 13:49:30,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 73. [2021-12-14 13:49:30,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 72 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) [2021-12-14 13:49:30,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2021-12-14 13:49:30,084 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 22 [2021-12-14 13:49:30,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:49:30,084 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2021-12-14 13:49:30,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:30,085 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2021-12-14 13:49:30,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 13:49:30,085 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:49:30,085 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:49:30,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 13:49:30,085 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-12-14 13:49:30,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:49:30,086 INFO L85 PathProgramCache]: Analyzing trace with hash -661217951, now seen corresponding path program 1 times [2021-12-14 13:49:30,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:49:30,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416422128] [2021-12-14 13:49:30,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:49:30,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:49:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:49:30,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:49:30,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:49:30,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416422128] [2021-12-14 13:49:30,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416422128] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:49:30,143 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:49:30,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 13:49:30,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363665761] [2021-12-14 13:49:30,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:49:30,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 13:49:30,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:49:30,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 13:49:30,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:49:30,145 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:30,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:49:30,217 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2021-12-14 13:49:30,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 13:49:30,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-14 13:49:30,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:49:30,218 INFO L225 Difference]: With dead ends: 104 [2021-12-14 13:49:30,219 INFO L226 Difference]: Without dead ends: 102 [2021-12-14 13:49:30,219 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-14 13:49:30,221 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 117 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:49:30,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 171 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:49:30,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-14 13:49:30,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 75. [2021-12-14 13:49:30,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 74 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) [2021-12-14 13:49:30,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2021-12-14 13:49:30,228 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 22 [2021-12-14 13:49:30,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:49:30,228 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2021-12-14 13:49:30,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:30,229 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2021-12-14 13:49:30,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-14 13:49:30,229 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:49:30,229 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:49:30,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 13:49:30,230 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-12-14 13:49:30,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:49:30,235 INFO L85 PathProgramCache]: Analyzing trace with hash 847883539, now seen corresponding path program 1 times [2021-12-14 13:49:30,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:49:30,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210247054] [2021-12-14 13:49:30,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:49:30,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:49:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:49:30,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:49:30,280 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:49:30,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210247054] [2021-12-14 13:49:30,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210247054] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:49:30,280 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:49:30,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 13:49:30,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899932971] [2021-12-14 13:49:30,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:49:30,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 13:49:30,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:49:30,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 13:49:30,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:49:30,282 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:30,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:49:30,365 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2021-12-14 13:49:30,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 13:49:30,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-14 13:49:30,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:49:30,366 INFO L225 Difference]: With dead ends: 117 [2021-12-14 13:49:30,366 INFO L226 Difference]: Without dead ends: 115 [2021-12-14 13:49:30,366 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-14 13:49:30,367 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 148 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:49:30,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 154 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:49:30,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-12-14 13:49:30,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 73. [2021-12-14 13:49:30,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 60 states have (on average 1.3) internal successors, (78), 72 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) [2021-12-14 13:49:30,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2021-12-14 13:49:30,380 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 23 [2021-12-14 13:49:30,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:49:30,381 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2021-12-14 13:49:30,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:30,381 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2021-12-14 13:49:30,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-14 13:49:30,382 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:49:30,382 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:49:30,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 13:49:30,383 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-12-14 13:49:30,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:49:30,387 INFO L85 PathProgramCache]: Analyzing trace with hash 977084131, now seen corresponding path program 1 times [2021-12-14 13:49:30,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:49:30,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491691891] [2021-12-14 13:49:30,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:49:30,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:49:30,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:49:30,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:49:30,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:49:30,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491691891] [2021-12-14 13:49:30,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491691891] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:49:30,433 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:49:30,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 13:49:30,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644582374] [2021-12-14 13:49:30,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:49:30,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 13:49:30,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:49:30,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 13:49:30,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:49:30,435 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:30,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:49:30,485 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2021-12-14 13:49:30,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 13:49:30,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-14 13:49:30,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:49:30,486 INFO L225 Difference]: With dead ends: 73 [2021-12-14 13:49:30,486 INFO L226 Difference]: Without dead ends: 71 [2021-12-14 13:49:30,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-14 13:49:30,487 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 132 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:49:30,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 94 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:49:30,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-12-14 13:49:30,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-12-14 13:49:30,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 70 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) [2021-12-14 13:49:30,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2021-12-14 13:49:30,493 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 23 [2021-12-14 13:49:30,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:49:30,493 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2021-12-14 13:49:30,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:30,494 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2021-12-14 13:49:30,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-14 13:49:30,494 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:49:30,494 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:49:30,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 13:49:30,495 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-12-14 13:49:30,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:49:30,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1619855478, now seen corresponding path program 1 times [2021-12-14 13:49:30,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:49:30,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296077440] [2021-12-14 13:49:30,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:49:30,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:49:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:49:30,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:49:30,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:49:30,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296077440] [2021-12-14 13:49:30,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296077440] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:49:30,531 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:49:30,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 13:49:30,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574058508] [2021-12-14 13:49:30,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:49:30,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 13:49:30,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:49:30,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 13:49:30,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 13:49:30,533 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:30,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:49:30,568 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2021-12-14 13:49:30,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 13:49:30,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-14 13:49:30,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:49:30,569 INFO L225 Difference]: With dead ends: 111 [2021-12-14 13:49:30,569 INFO L226 Difference]: Without dead ends: 71 [2021-12-14 13:49:30,570 INFO L932 BasicCegarLoop]: 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 [2021-12-14 13:49:30,570 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:49:30,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:49:30,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-12-14 13:49:30,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-12-14 13:49:30,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 70 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) [2021-12-14 13:49:30,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2021-12-14 13:49:30,572 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 25 [2021-12-14 13:49:30,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:49:30,572 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2021-12-14 13:49:30,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:30,573 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2021-12-14 13:49:30,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 13:49:30,573 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:49:30,573 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:49:30,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 13:49:30,573 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-12-14 13:49:30,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:49:30,573 INFO L85 PathProgramCache]: Analyzing trace with hash 595608307, now seen corresponding path program 1 times [2021-12-14 13:49:30,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:49:30,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143289685] [2021-12-14 13:49:30,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:49:30,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:49:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:49:30,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:49:30,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:49:30,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143289685] [2021-12-14 13:49:30,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143289685] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:49:30,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365185694] [2021-12-14 13:49:30,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:49:30,624 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:49:30,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:49:30,640 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) [2021-12-14 13:49:30,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 13:49:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:49:30,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 13:49:30,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:49:30,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:49:30,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:49:30,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:49:30,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365185694] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:49:30,863 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:49:30,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2021-12-14 13:49:30,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986821598] [2021-12-14 13:49:30,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:49:30,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 13:49:30,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:49:30,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 13:49:30,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 13:49:30,864 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:30,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:49:30,923 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2021-12-14 13:49:30,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 13:49:30,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-14 13:49:30,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:49:30,925 INFO L225 Difference]: With dead ends: 111 [2021-12-14 13:49:30,939 INFO L226 Difference]: Without dead ends: 109 [2021-12-14 13:49:30,939 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-12-14 13:49:30,940 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 89 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:49:30,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 179 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:49:30,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-14 13:49:30,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 68. [2021-12-14 13:49:30,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 67 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) [2021-12-14 13:49:30,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2021-12-14 13:49:30,943 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 26 [2021-12-14 13:49:30,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:49:30,943 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2021-12-14 13:49:30,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:30,943 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2021-12-14 13:49:30,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 13:49:30,944 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:49:30,944 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:49:30,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 13:49:31,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-14 13:49:31,145 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-12-14 13:49:31,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:49:31,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1780382557, now seen corresponding path program 1 times [2021-12-14 13:49:31,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:49:31,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484303227] [2021-12-14 13:49:31,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:49:31,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:49:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:49:31,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:49:31,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:49:31,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484303227] [2021-12-14 13:49:31,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484303227] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:49:31,189 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:49:31,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 13:49:31,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720688765] [2021-12-14 13:49:31,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:49:31,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 13:49:31,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:49:31,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 13:49:31,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:49:31,190 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:31,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:49:31,224 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2021-12-14 13:49:31,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 13:49:31,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-14 13:49:31,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:49:31,225 INFO L225 Difference]: With dead ends: 69 [2021-12-14 13:49:31,225 INFO L226 Difference]: Without dead ends: 67 [2021-12-14 13:49:31,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-14 13:49:31,226 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 116 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:49:31,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 72 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:49:31,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-14 13:49:31,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2021-12-14 13:49:31,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 65 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:31,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2021-12-14 13:49:31,229 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 26 [2021-12-14 13:49:31,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:49:31,229 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2021-12-14 13:49:31,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:31,230 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2021-12-14 13:49:31,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 13:49:31,232 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:49:31,232 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-14 13:49:31,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 13:49:31,232 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-12-14 13:49:31,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:49:31,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1280139623, now seen corresponding path program 1 times [2021-12-14 13:49:31,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:49:31,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539305139] [2021-12-14 13:49:31,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:49:31,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:49:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:49:31,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:49:31,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:49:31,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539305139] [2021-12-14 13:49:31,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539305139] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:49:31,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257038102] [2021-12-14 13:49:31,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:49:31,286 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:49:31,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:49:31,304 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:49:31,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 13:49:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:49:31,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 13:49:31,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:49:31,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:49:31,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:49:31,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:49:31,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257038102] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:49:31,463 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:49:31,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2021-12-14 13:49:31,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456683087] [2021-12-14 13:49:31,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:49:31,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 13:49:31,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:49:31,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 13:49:31,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 13:49:31,465 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:31,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:49:31,500 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2021-12-14 13:49:31,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 13:49:31,501 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-14 13:49:31,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:49:31,502 INFO L225 Difference]: With dead ends: 67 [2021-12-14 13:49:31,502 INFO L226 Difference]: Without dead ends: 65 [2021-12-14 13:49:31,502 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-12-14 13:49:31,502 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 152 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:49:31,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 67 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:49:31,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-14 13:49:31,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2021-12-14 13:49:31,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 59 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:31,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2021-12-14 13:49:31,505 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 27 [2021-12-14 13:49:31,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:49:31,505 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2021-12-14 13:49:31,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:31,506 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2021-12-14 13:49:31,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 13:49:31,507 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:49:31,507 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:49:31,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 13:49:31,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-14 13:49:31,723 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-12-14 13:49:31,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:49:31,723 INFO L85 PathProgramCache]: Analyzing trace with hash -642711428, now seen corresponding path program 1 times [2021-12-14 13:49:31,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:49:31,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870726027] [2021-12-14 13:49:31,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:49:31,723 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:49:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:49:31,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:49:31,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:49:31,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870726027] [2021-12-14 13:49:31,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870726027] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:49:31,751 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:49:31,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 13:49:31,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888299378] [2021-12-14 13:49:31,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:49:31,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 13:49:31,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:49:31,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 13:49:31,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:49:31,753 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:31,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:49:31,789 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2021-12-14 13:49:31,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 13:49:31,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-14 13:49:31,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:49:31,790 INFO L225 Difference]: With dead ends: 60 [2021-12-14 13:49:31,790 INFO L226 Difference]: Without dead ends: 58 [2021-12-14 13:49:31,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-14 13:49:31,791 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 108 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:49:31,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 68 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:49:31,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-12-14 13:49:31,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2021-12-14 13:49:31,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 50 states have (on average 1.2) internal successors, (60), 57 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:31,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2021-12-14 13:49:31,795 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 27 [2021-12-14 13:49:31,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:49:31,795 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2021-12-14 13:49:31,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:31,795 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2021-12-14 13:49:31,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 13:49:31,796 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:49:31,796 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:49:31,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 13:49:31,796 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-12-14 13:49:31,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:49:31,797 INFO L85 PathProgramCache]: Analyzing trace with hash -47880409, now seen corresponding path program 1 times [2021-12-14 13:49:31,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:49:31,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740781264] [2021-12-14 13:49:31,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:49:31,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:49:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:49:31,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:49:31,843 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:49:31,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740781264] [2021-12-14 13:49:31,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740781264] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:49:31,843 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:49:31,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 13:49:31,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024182544] [2021-12-14 13:49:31,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:49:31,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 13:49:31,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:49:31,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 13:49:31,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:49:31,845 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:31,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:49:31,898 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2021-12-14 13:49:31,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 13:49:31,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-14 13:49:31,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:49:31,898 INFO L225 Difference]: With dead ends: 59 [2021-12-14 13:49:31,898 INFO L226 Difference]: Without dead ends: 57 [2021-12-14 13:49:31,899 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-14 13:49:31,899 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 64 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:49:31,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 73 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:49:31,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-12-14 13:49:31,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2021-12-14 13:49:31,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.183673469387755) internal successors, (58), 55 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:31,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2021-12-14 13:49:31,902 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 30 [2021-12-14 13:49:31,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:49:31,902 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2021-12-14 13:49:31,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:31,902 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2021-12-14 13:49:31,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-14 13:49:31,903 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:49:31,903 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:49:31,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 13:49:31,903 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-12-14 13:49:31,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:49:31,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1484288504, now seen corresponding path program 1 times [2021-12-14 13:49:31,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:49:31,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207538703] [2021-12-14 13:49:31,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:49:31,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:49:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:49:31,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:49:31,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:49:31,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207538703] [2021-12-14 13:49:31,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207538703] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:49:31,932 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:49:31,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 13:49:31,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75158836] [2021-12-14 13:49:31,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:49:31,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 13:49:31,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:49:31,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 13:49:31,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 13:49:31,933 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:31,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:49:31,980 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2021-12-14 13:49:31,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 13:49:31,981 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-14 13:49:31,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:49:31,981 INFO L225 Difference]: With dead ends: 67 [2021-12-14 13:49:31,981 INFO L226 Difference]: Without dead ends: 65 [2021-12-14 13:49:31,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-12-14 13:49:31,982 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 125 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:49:31,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 76 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:49:31,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-14 13:49:31,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2021-12-14 13:49:31,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 53 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:31,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2021-12-14 13:49:31,984 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 31 [2021-12-14 13:49:31,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:49:31,984 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2021-12-14 13:49:31,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:31,985 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2021-12-14 13:49:31,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-14 13:49:31,985 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:49:31,985 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:49:31,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-14 13:49:31,986 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-12-14 13:49:31,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:49:31,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1746453711, now seen corresponding path program 1 times [2021-12-14 13:49:31,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:49:31,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163049229] [2021-12-14 13:49:31,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:49:31,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:49:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:49:32,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:49:32,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:49:32,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163049229] [2021-12-14 13:49:32,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163049229] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:49:32,017 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:49:32,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 13:49:32,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751465867] [2021-12-14 13:49:32,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:49:32,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 13:49:32,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:49:32,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 13:49:32,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:49:32,018 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:32,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:49:32,075 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2021-12-14 13:49:32,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 13:49:32,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-14 13:49:32,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:49:32,076 INFO L225 Difference]: With dead ends: 87 [2021-12-14 13:49:32,076 INFO L226 Difference]: Without dead ends: 85 [2021-12-14 13:49:32,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-14 13:49:32,077 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 93 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:49:32,077 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 117 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:49:32,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-14 13:49:32,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 57. [2021-12-14 13:49:32,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 56 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:32,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2021-12-14 13:49:32,080 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 34 [2021-12-14 13:49:32,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:49:32,080 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2021-12-14 13:49:32,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:32,080 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2021-12-14 13:49:32,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-14 13:49:32,080 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:49:32,081 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:49:32,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-14 13:49:32,081 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-12-14 13:49:32,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:49:32,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1694514003, now seen corresponding path program 1 times [2021-12-14 13:49:32,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:49:32,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324316813] [2021-12-14 13:49:32,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:49:32,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:49:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:49:32,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:49:32,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:49:32,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324316813] [2021-12-14 13:49:32,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324316813] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:49:32,113 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:49:32,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 13:49:32,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970117371] [2021-12-14 13:49:32,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:49:32,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 13:49:32,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:49:32,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 13:49:32,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:49:32,114 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:32,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:49:32,156 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2021-12-14 13:49:32,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 13:49:32,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-14 13:49:32,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:49:32,157 INFO L225 Difference]: With dead ends: 57 [2021-12-14 13:49:32,157 INFO L226 Difference]: Without dead ends: 55 [2021-12-14 13:49:32,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-14 13:49:32,158 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 58 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:49:32,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 109 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:49:32,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-12-14 13:49:32,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-12-14 13:49:32,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.14) internal successors, (57), 54 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:32,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2021-12-14 13:49:32,160 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 35 [2021-12-14 13:49:32,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:49:32,161 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2021-12-14 13:49:32,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:32,161 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2021-12-14 13:49:32,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-14 13:49:32,162 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:49:32,162 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:49:32,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-14 13:49:32,163 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-12-14 13:49:32,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:49:32,163 INFO L85 PathProgramCache]: Analyzing trace with hash 635482230, now seen corresponding path program 1 times [2021-12-14 13:49:32,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:49:32,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964905515] [2021-12-14 13:49:32,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:49:32,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:49:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:49:32,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:49:32,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:49:32,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964905515] [2021-12-14 13:49:32,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964905515] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:49:32,187 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:49:32,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 13:49:32,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377314895] [2021-12-14 13:49:32,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:49:32,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 13:49:32,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:49:32,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 13:49:32,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 13:49:32,189 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:32,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:49:32,204 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2021-12-14 13:49:32,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 13:49:32,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-14 13:49:32,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:49:32,205 INFO L225 Difference]: With dead ends: 66 [2021-12-14 13:49:32,205 INFO L226 Difference]: Without dead ends: 64 [2021-12-14 13:49:32,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:49:32,205 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 23 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:49:32,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 142 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:49:32,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-12-14 13:49:32,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2021-12-14 13:49:32,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:32,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2021-12-14 13:49:32,210 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 37 [2021-12-14 13:49:32,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:49:32,210 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2021-12-14 13:49:32,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:32,211 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2021-12-14 13:49:32,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-14 13:49:32,211 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:49:32,211 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:49:32,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-14 13:49:32,211 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-12-14 13:49:32,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:49:32,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1774883137, now seen corresponding path program 1 times [2021-12-14 13:49:32,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:49:32,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48203981] [2021-12-14 13:49:32,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:49:32,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:49:32,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:49:32,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:49:32,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:49:32,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48203981] [2021-12-14 13:49:32,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48203981] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:49:32,247 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:49:32,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 13:49:32,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947389669] [2021-12-14 13:49:32,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:49:32,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 13:49:32,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:49:32,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 13:49:32,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:49:32,248 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:32,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:49:32,268 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2021-12-14 13:49:32,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 13:49:32,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-12-14 13:49:32,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:49:32,269 INFO L225 Difference]: With dead ends: 62 [2021-12-14 13:49:32,269 INFO L226 Difference]: Without dead ends: 60 [2021-12-14 13:49:32,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 13:49:32,270 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 35 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:49:32,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 172 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:49:32,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-12-14 13:49:32,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2021-12-14 13:49:32,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 50 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:32,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2021-12-14 13:49:32,274 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 38 [2021-12-14 13:49:32,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:49:32,274 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2021-12-14 13:49:32,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:32,274 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2021-12-14 13:49:32,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-14 13:49:32,275 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:49:32,275 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:49:32,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-14 13:49:32,275 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-12-14 13:49:32,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:49:32,275 INFO L85 PathProgramCache]: Analyzing trace with hash 813201821, now seen corresponding path program 1 times [2021-12-14 13:49:32,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:49:32,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74027823] [2021-12-14 13:49:32,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:49:32,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:49:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:49:32,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:49:32,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:49:32,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74027823] [2021-12-14 13:49:32,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74027823] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:49:32,323 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:49:32,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 13:49:32,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941847188] [2021-12-14 13:49:32,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:49:32,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 13:49:32,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:49:32,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 13:49:32,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:49:32,324 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:32,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:49:32,390 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2021-12-14 13:49:32,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 13:49:32,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-14 13:49:32,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:49:32,391 INFO L225 Difference]: With dead ends: 84 [2021-12-14 13:49:32,391 INFO L226 Difference]: Without dead ends: 82 [2021-12-14 13:49:32,391 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-14 13:49:32,393 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 52 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:49:32,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 125 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:49:32,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-14 13:49:32,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 56. [2021-12-14 13:49:32,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 55 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:32,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2021-12-14 13:49:32,398 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 39 [2021-12-14 13:49:32,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:49:32,398 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2021-12-14 13:49:32,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:32,398 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2021-12-14 13:49:32,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-14 13:49:32,399 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:49:32,399 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:49:32,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-14 13:49:32,399 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-12-14 13:49:32,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:49:32,400 INFO L85 PathProgramCache]: Analyzing trace with hash -560543098, now seen corresponding path program 1 times [2021-12-14 13:49:32,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:49:32,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215641394] [2021-12-14 13:49:32,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:49:32,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:49:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:49:32,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:49:32,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:49:32,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215641394] [2021-12-14 13:49:32,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215641394] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:49:32,467 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:49:32,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 13:49:32,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195726260] [2021-12-14 13:49:32,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:49:32,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 13:49:32,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:49:32,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 13:49:32,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:49:32,470 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:32,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:49:32,519 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2021-12-14 13:49:32,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 13:49:32,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-14 13:49:32,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:49:32,520 INFO L225 Difference]: With dead ends: 69 [2021-12-14 13:49:32,520 INFO L226 Difference]: Without dead ends: 67 [2021-12-14 13:49:32,520 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-14 13:49:32,521 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 35 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:49:32,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 119 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:49:32,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-14 13:49:32,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2021-12-14 13:49:32,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:32,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2021-12-14 13:49:32,523 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 40 [2021-12-14 13:49:32,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:49:32,524 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2021-12-14 13:49:32,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:32,524 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2021-12-14 13:49:32,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-14 13:49:32,524 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:49:32,524 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-14 13:49:32,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-14 13:49:32,526 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-12-14 13:49:32,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:49:32,526 INFO L85 PathProgramCache]: Analyzing trace with hash 375780089, now seen corresponding path program 1 times [2021-12-14 13:49:32,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:49:32,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986975335] [2021-12-14 13:49:32,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:49:32,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:49:32,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:49:32,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:49:32,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:49:32,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986975335] [2021-12-14 13:49:32,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986975335] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:49:32,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657720539] [2021-12-14 13:49:32,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:49:32,571 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:49:32,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:49:32,588 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:49:32,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 13:49:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:49:32,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-14 13:49:32,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:49:32,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:49:32,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:49:32,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:49:32,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657720539] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:49:32,825 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:49:32,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2021-12-14 13:49:32,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583772910] [2021-12-14 13:49:32,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:49:32,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 13:49:32,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:49:32,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 13:49:32,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 13:49:32,826 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:32,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:49:32,859 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2021-12-14 13:49:32,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 13:49:32,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-14 13:49:32,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:49:32,861 INFO L225 Difference]: With dead ends: 54 [2021-12-14 13:49:32,861 INFO L226 Difference]: Without dead ends: 52 [2021-12-14 13:49:32,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 74 SyntacticMatches, 7 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-12-14 13:49:32,862 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 55 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:49:32,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 54 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:49:32,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-12-14 13:49:32,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-12-14 13:49:32,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:32,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2021-12-14 13:49:32,864 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 40 [2021-12-14 13:49:32,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:49:32,864 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2021-12-14 13:49:32,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:32,864 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2021-12-14 13:49:32,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-14 13:49:32,865 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:49:32,865 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-14 13:49:32,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-14 13:49:33,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:49:33,078 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2021-12-14 13:49:33,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:49:33,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1394778411, now seen corresponding path program 1 times [2021-12-14 13:49:33,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:49:33,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159601371] [2021-12-14 13:49:33,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:49:33,079 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:49:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:49:33,114 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 13:49:33,114 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:49:33,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159601371] [2021-12-14 13:49:33,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159601371] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:49:33,114 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:49:33,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 13:49:33,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985666526] [2021-12-14 13:49:33,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:49:33,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 13:49:33,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:49:33,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 13:49:33,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:49:33,115 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:33,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:49:33,184 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2021-12-14 13:49:33,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 13:49:33,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-12-14 13:49:33,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:49:33,184 INFO L225 Difference]: With dead ends: 71 [2021-12-14 13:49:33,184 INFO L226 Difference]: Without dead ends: 0 [2021-12-14 13:49:33,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-14 13:49:33,185 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 36 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:49:33,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 86 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:49:33,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-14 13:49:33,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-14 13:49:33,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:33,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-14 13:49:33,186 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2021-12-14 13:49:33,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:49:33,186 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-14 13:49:33,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:49:33,186 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-14 13:49:33,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-14 13:49:33,188 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2021-12-14 13:49:33,188 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2021-12-14 13:49:33,188 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2021-12-14 13:49:33,188 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2021-12-14 13:49:33,188 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2021-12-14 13:49:33,188 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2021-12-14 13:49:33,188 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2021-12-14 13:49:33,188 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2021-12-14 13:49:33,188 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2021-12-14 13:49:33,188 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2021-12-14 13:49:33,188 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2021-12-14 13:49:33,189 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2021-12-14 13:49:33,189 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2021-12-14 13:49:33,189 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2021-12-14 13:49:33,189 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2021-12-14 13:49:33,189 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2021-12-14 13:49:33,189 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2021-12-14 13:49:33,189 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2021-12-14 13:49:33,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-14 13:49:33,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-14 13:49:45,613 WARN L227 SmtUtils]: Spent 12.42s on a formula simplification. DAG size of input: 117 DAG size of output: 115 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-14 13:49:49,013 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 97) no Hoare annotation was computed. [2021-12-14 13:49:49,013 INFO L858 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2021-12-14 13:49:49,014 INFO L858 garLoopResultBuilder]: For program point L234(lines 234 338) no Hoare annotation was computed. [2021-12-14 13:49:49,014 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 272) no Hoare annotation was computed. [2021-12-14 13:49:49,014 INFO L858 garLoopResultBuilder]: For program point L135(lines 135 397) no Hoare annotation was computed. [2021-12-14 13:49:49,014 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-14 13:49:49,015 INFO L858 garLoopResultBuilder]: For program point L284(line 284) no Hoare annotation was computed. [2021-12-14 13:49:49,015 INFO L858 garLoopResultBuilder]: For program point L53(lines 53 433) no Hoare annotation was computed. [2021-12-14 13:49:49,015 INFO L858 garLoopResultBuilder]: For program point L384(lines 384 393) no Hoare annotation was computed. [2021-12-14 13:49:49,015 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 255) no Hoare annotation was computed. [2021-12-14 13:49:49,015 INFO L854 garLoopResultBuilder]: At program point L401(lines 131 402) the Hoare annotation is: (and (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 1) (< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|) (let ((.cse0 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))) (.cse1 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0))) (.cse2 (< 0 |ULTIMATE.start_main_~main__scheme~0#1|)) (.cse3 (<= 1 |ULTIMATE.start_main_~main__cp~0#1|)) (.cse4 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~16#1| 0))) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 1) .cse3 .cse4)))) [2021-12-14 13:49:49,015 INFO L858 garLoopResultBuilder]: For program point L104(lines 104 411) no Hoare annotation was computed. [2021-12-14 13:49:49,015 INFO L858 garLoopResultBuilder]: For program point L71(lines 71 416) no Hoare annotation was computed. [2021-12-14 13:49:49,016 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2021-12-14 13:49:49,016 INFO L858 garLoopResultBuilder]: For program point L253(lines 253 329) no Hoare annotation was computed. [2021-12-14 13:49:49,016 INFO L858 garLoopResultBuilder]: For program point L187(lines 187 355) no Hoare annotation was computed. [2021-12-14 13:49:49,016 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 386) no Hoare annotation was computed. [2021-12-14 13:49:49,016 INFO L858 garLoopResultBuilder]: For program point L270(lines 270 322) no Hoare annotation was computed. [2021-12-14 13:49:49,016 INFO L858 garLoopResultBuilder]: For program point L204(lines 204 353) no Hoare annotation was computed. [2021-12-14 13:49:49,016 INFO L858 garLoopResultBuilder]: For program point L386(line 386) no Hoare annotation was computed. [2021-12-14 13:49:49,016 INFO L858 garLoopResultBuilder]: For program point L155(lines 155 360) no Hoare annotation was computed. [2021-12-14 13:49:49,016 INFO L858 garLoopResultBuilder]: For program point L23(lines 23 438) no Hoare annotation was computed. [2021-12-14 13:49:49,017 INFO L858 garLoopResultBuilder]: For program point L255(line 255) no Hoare annotation was computed. [2021-12-14 13:49:49,017 INFO L858 garLoopResultBuilder]: For program point L189(line 189) no Hoare annotation was computed. [2021-12-14 13:49:49,017 INFO L858 garLoopResultBuilder]: For program point L123(lines 123 403) no Hoare annotation was computed. [2021-12-14 13:49:49,017 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2021-12-14 13:49:49,017 INFO L858 garLoopResultBuilder]: For program point L272(line 272) no Hoare annotation was computed. [2021-12-14 13:49:49,017 INFO L858 garLoopResultBuilder]: For program point L41(lines 41 435) no Hoare annotation was computed. [2021-12-14 13:49:49,017 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-14 13:49:49,017 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2021-12-14 13:49:49,017 INFO L858 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2021-12-14 13:49:49,017 INFO L858 garLoopResultBuilder]: For program point L372(lines 372 395) no Hoare annotation was computed. [2021-12-14 13:49:49,018 INFO L858 garLoopResultBuilder]: For program point L306(lines 306 316) no Hoare annotation was computed. [2021-12-14 13:49:49,018 INFO L858 garLoopResultBuilder]: For program point L224(lines 224 344) no Hoare annotation was computed. [2021-12-14 13:49:49,018 INFO L858 garLoopResultBuilder]: For program point L125(line 125) no Hoare annotation was computed. [2021-12-14 13:49:49,018 INFO L858 garLoopResultBuilder]: For program point L59(lines 59 432) no Hoare annotation was computed. [2021-12-14 13:49:49,018 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 113) no Hoare annotation was computed. [2021-12-14 13:49:49,018 INFO L858 garLoopResultBuilder]: For program point L241(lines 241 331) no Hoare annotation was computed. [2021-12-14 13:49:49,018 INFO L858 garLoopResultBuilder]: For program point L175(lines 175 357) no Hoare annotation was computed. [2021-12-14 13:49:49,018 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 284) no Hoare annotation was computed. [2021-12-14 13:49:49,018 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 226) no Hoare annotation was computed. [2021-12-14 13:49:49,019 INFO L858 garLoopResultBuilder]: For program point L374(line 374) no Hoare annotation was computed. [2021-12-14 13:49:49,019 INFO L858 garLoopResultBuilder]: For program point L308(line 308) no Hoare annotation was computed. [2021-12-14 13:49:49,019 INFO L858 garLoopResultBuilder]: For program point L143(lines 143 362) no Hoare annotation was computed. [2021-12-14 13:49:49,019 INFO L858 garLoopResultBuilder]: For program point L226(line 226) no Hoare annotation was computed. [2021-12-14 13:49:49,019 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2021-12-14 13:49:49,019 INFO L858 garLoopResultBuilder]: For program point L61(lines 61 427) no Hoare annotation was computed. [2021-12-14 13:49:49,019 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-14 13:49:49,019 INFO L858 garLoopResultBuilder]: For program point L243(line 243) no Hoare annotation was computed. [2021-12-14 13:49:49,019 INFO L858 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2021-12-14 13:49:49,020 INFO L858 garLoopResultBuilder]: For program point L111(lines 111 405) no Hoare annotation was computed. [2021-12-14 13:49:49,020 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 308) no Hoare annotation was computed. [2021-12-14 13:49:49,020 INFO L854 garLoopResultBuilder]: At program point L392(lines 129 403) the Hoare annotation is: (and (< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|) (let ((.cse0 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))) (.cse1 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 1)) (.cse2 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0))) (.cse3 (< 0 |ULTIMATE.start_main_~main__scheme~0#1|)) (.cse4 (<= 1 |ULTIMATE.start_main_~main__cp~0#1|)) (.cse5 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~17#1| 0)) .cse4 .cse5 (<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~16#1|)) (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 1) .cse4 .cse5)))) [2021-12-14 13:49:49,020 INFO L858 garLoopResultBuilder]: For program point L194(lines 194 354) no Hoare annotation was computed. [2021-12-14 13:49:49,020 INFO L858 garLoopResultBuilder]: For program point L95(lines 95 412) no Hoare annotation was computed. [2021-12-14 13:49:49,020 INFO L858 garLoopResultBuilder]: For program point L29(lines 29 437) no Hoare annotation was computed. [2021-12-14 13:49:49,020 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 125) no Hoare annotation was computed. [2021-12-14 13:49:49,020 INFO L858 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2021-12-14 13:49:49,020 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 296) no Hoare annotation was computed. [2021-12-14 13:49:49,021 INFO L854 garLoopResultBuilder]: At program point L327(lines 262 328) the Hoare annotation is: (and (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1| 1) (let ((.cse0 (let ((.cse1 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~6#1| 0))) (.cse2 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))) (.cse3 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 1)) (.cse4 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0))) (.cse5 (< 0 |ULTIMATE.start_main_~main__scheme~0#1|)) (.cse6 (<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~4#1|)) (.cse7 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1| 0))) (.cse8 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~11#1| 0))) (.cse9 (<= 1 |ULTIMATE.start_main_~main__cp~0#1|)) (.cse10 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0))) (.cse11 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~9#1| 0))) (.cse12 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~9#1| 1)) (.cse13 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~8#1| 0))) (.cse14 (< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)) (.cse15 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~5#1| 0))) (.cse16 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~7#1| 0)))) (or (and .cse1 .cse2 (<= (+ 2 |ULTIMATE.start_main_~main__c~0#1|) |ULTIMATE.start_main_~main__tokenlen~0#1|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~12#1| 0)) .cse15 .cse16))))) (or (and .cse0 (= |ULTIMATE.start_main_~main__c~0#1| 0)) (and (<= 1 |ULTIMATE.start_main_~main__c~0#1|) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~13#1| 0)) .cse0)))) [2021-12-14 13:49:49,021 INFO L858 garLoopResultBuilder]: For program point L294(lines 294 318) no Hoare annotation was computed. [2021-12-14 13:49:49,021 INFO L858 garLoopResultBuilder]: For program point L162(lines 162 359) no Hoare annotation was computed. [2021-12-14 13:49:49,021 INFO L858 garLoopResultBuilder]: For program point L63(lines 63 422) no Hoare annotation was computed. [2021-12-14 13:49:49,021 INFO L854 garLoopResultBuilder]: At program point L410(lines 104 411) the Hoare annotation is: (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0)) [2021-12-14 13:49:49,021 INFO L858 garLoopResultBuilder]: For program point L212(lines 212 346) no Hoare annotation was computed. [2021-12-14 13:49:49,021 INFO L858 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2021-12-14 13:49:49,022 INFO L858 garLoopResultBuilder]: For program point L47(lines 47 434) no Hoare annotation was computed. [2021-12-14 13:49:49,022 INFO L858 garLoopResultBuilder]: For program point L262(lines 262 328) no Hoare annotation was computed. [2021-12-14 13:49:49,022 INFO L858 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2021-12-14 13:49:49,022 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2021-12-14 13:49:49,022 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 374) no Hoare annotation was computed. [2021-12-14 13:49:49,022 INFO L858 garLoopResultBuilder]: For program point L296(line 296) no Hoare annotation was computed. [2021-12-14 13:49:49,022 INFO L858 garLoopResultBuilder]: For program point L65(lines 65 417) no Hoare annotation was computed. [2021-12-14 13:49:49,022 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-14 13:49:49,022 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2021-12-14 13:49:49,022 INFO L858 garLoopResultBuilder]: For program point L214(line 214) no Hoare annotation was computed. [2021-12-14 13:49:49,023 INFO L858 garLoopResultBuilder]: For program point L83(lines 83 414) no Hoare annotation was computed. [2021-12-14 13:49:49,023 INFO L854 garLoopResultBuilder]: At program point L315(lines 230 344) the Hoare annotation is: (let ((.cse2 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~6#1| 0))) (.cse3 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))) (.cse4 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 1)) (.cse5 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0))) (.cse6 (< 0 |ULTIMATE.start_main_~main__scheme~0#1|)) (.cse7 (<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~4#1|)) (.cse8 (< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)) (.cse11 (<= 1 |ULTIMATE.start_main_~main__cp~0#1|)) (.cse12 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0))) (.cse13 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~9#1| 1)) (.cse14 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~8#1| 0))) (.cse15 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~5#1| 0))) (.cse16 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~7#1| 0))) (.cse1 (= |ULTIMATE.start_main_~main__c~0#1| 0))) (or (and (let ((.cse0 (let ((.cse9 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1| 0))) (.cse10 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~11#1| 0)))) (or (and .cse2 .cse3 (<= (+ 2 |ULTIMATE.start_main_~main__c~0#1|) |ULTIMATE.start_main_~main__tokenlen~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~12#1| 0)) .cse15 .cse16))))) (or (and .cse0 .cse1) (and (<= 1 |ULTIMATE.start_main_~main__c~0#1|) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~13#1| 0)) .cse0))) (<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1|)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~8#1| 1) .cse11 .cse12 .cse13 .cse14 (< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|) .cse15 .cse16 .cse1))) [2021-12-14 13:49:49,023 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 243) no Hoare annotation was computed. [2021-12-14 13:49:49,023 INFO L858 garLoopResultBuilder]: For program point L282(lines 282 320) no Hoare annotation was computed. [2021-12-14 13:49:49,023 INFO L861 garLoopResultBuilder]: At program point L431(lines 13 439) the Hoare annotation is: true [2021-12-14 13:49:49,023 INFO L858 garLoopResultBuilder]: For program point L35(lines 35 436) no Hoare annotation was computed. [2021-12-14 13:49:49,025 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:49:49,027 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 13:49:49,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 01:49:49 BoogieIcfgContainer [2021-12-14 13:49:49,043 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 13:49:49,043 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 13:49:49,043 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 13:49:49,044 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 13:49:49,044 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:49:29" (3/4) ... [2021-12-14 13:49:49,047 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-14 13:49:49,057 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2021-12-14 13:49:49,057 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-12-14 13:49:49,058 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-14 13:49:49,058 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-14 13:49:49,100 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 13:49:49,100 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 13:49:49,101 INFO L158 Benchmark]: Toolchain (without parser) took 20755.23ms. Allocated memory was 134.2MB in the beginning and 595.6MB in the end (delta: 461.4MB). Free memory was 100.4MB in the beginning and 542.3MB in the end (delta: -442.0MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2021-12-14 13:49:49,101 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 77.6MB. Free memory is still 37.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 13:49:49,101 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.03ms. Allocated memory is still 134.2MB. Free memory was 100.1MB in the beginning and 99.5MB in the end (delta: 578.3kB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2021-12-14 13:49:49,101 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.78ms. Allocated memory is still 134.2MB. Free memory was 99.5MB in the beginning and 97.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 13:49:49,102 INFO L158 Benchmark]: Boogie Preprocessor took 14.78ms. Allocated memory is still 134.2MB. Free memory was 97.4MB in the beginning and 96.6MB in the end (delta: 810.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 13:49:49,102 INFO L158 Benchmark]: RCFGBuilder took 404.37ms. Allocated memory is still 134.2MB. Free memory was 96.6MB in the beginning and 80.7MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-14 13:49:49,102 INFO L158 Benchmark]: TraceAbstraction took 19900.60ms. Allocated memory was 134.2MB in the beginning and 595.6MB in the end (delta: 461.4MB). Free memory was 79.9MB in the beginning and 549.7MB in the end (delta: -469.8MB). Peak memory consumption was 330.8MB. Max. memory is 16.1GB. [2021-12-14 13:49:49,102 INFO L158 Benchmark]: Witness Printer took 56.74ms. Allocated memory is still 595.6MB. Free memory was 549.7MB in the beginning and 542.3MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-14 13:49:49,104 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 77.6MB. Free memory is still 37.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 302.03ms. Allocated memory is still 134.2MB. Free memory was 100.1MB in the beginning and 99.5MB in the end (delta: 578.3kB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.78ms. Allocated memory is still 134.2MB. Free memory was 99.5MB in the beginning and 97.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.78ms. Allocated memory is still 134.2MB. Free memory was 97.4MB in the beginning and 96.6MB in the end (delta: 810.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 404.37ms. Allocated memory is still 134.2MB. Free memory was 96.6MB in the beginning and 80.7MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 19900.60ms. Allocated memory was 134.2MB in the beginning and 595.6MB in the end (delta: 461.4MB). Free memory was 79.9MB in the beginning and 549.7MB in the end (delta: -469.8MB). Peak memory consumption was 330.8MB. Max. memory is 16.1GB. * Witness Printer took 56.74ms. Allocated memory is still 595.6MB. Free memory was 549.7MB in the beginning and 542.3MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 85]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 97]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 113]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 125]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 145]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 157]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 177]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 189]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 214]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 226]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 243]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 255]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 272]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 284]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 296]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 308]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 374]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 386]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 82 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 19.8s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 15.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2162 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2162 mSDsluCounter, 2684 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1437 mSDsCounter, 115 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1152 IncrementalHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 115 mSolverCounterUnsat, 1247 mSDtfsCounter, 1152 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 342 GetRequests, 213 SyntacticMatches, 18 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=0, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 300 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 15 NumberOfFragments, 714 HoareAnnotationTreeSize, 6 FomulaSimplifications, 58355 FormulaSimplificationTreeSizeReduction, 15.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 312401 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 751 NumberOfCodeBlocks, 751 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 815 ConstructedInterpolants, 0 QuantifiedInterpolants, 1764 SizeOfPredicates, 12 NumberOfNonLiveVariables, 362 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 29 InterpolantComputations, 20 PerfectInterpolantSequences, 11/29 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= __VERIFIER_assert__cond) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= __VERIFIER_assert__cond) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) && main__c == 0) || ((1 <= main__c && !(__VERIFIER_assert__cond == 0)) && ((((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= __VERIFIER_assert__cond) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= __VERIFIER_assert__cond) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))))) && 1 <= __VERIFIER_assert__cond) || (((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= __VERIFIER_assert__cond) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__c == 0) - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: __VERIFIER_assert__cond == 1 && (((((((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || ((((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) && main__c == 0) || ((1 <= main__c && !(__VERIFIER_assert__cond == 0)) && (((((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || ((((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))))) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: !(__VERIFIER_assert__cond == 0) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: main__cp < main__urilen && ((((((((!(__VERIFIER_assert__cond == 0) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && 1 <= __VERIFIER_assert__cond) || ((((((!(__VERIFIER_assert__cond == 0) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0))) - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: (__VERIFIER_assert__cond == 1 && main__cp < main__urilen) && ((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0))) RESULT: Ultimate proved your program to be correct! [2021-12-14 13:49:49,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE