./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/bin/uautomizer-tBqnrhUYjU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/bin/uautomizer-tBqnrhUYjU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/bin/uautomizer-tBqnrhUYjU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/bin/uautomizer-tBqnrhUYjU/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-01-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/bin/uautomizer-tBqnrhUYjU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/bin/uautomizer-tBqnrhUYjU --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-02 22:05:13,632 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 22:05:13,633 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 22:05:13,690 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 22:05:13,691 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 22:05:13,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 22:05:13,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 22:05:13,703 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 22:05:13,706 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 22:05:13,714 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 22:05:13,715 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 22:05:13,717 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 22:05:13,718 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 22:05:13,721 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 22:05:13,724 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 22:05:13,733 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 22:05:13,736 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 22:05:13,737 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 22:05:13,739 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 22:05:13,746 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 22:05:13,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 22:05:13,751 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 22:05:13,754 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 22:05:13,755 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 22:05:13,761 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 22:05:13,761 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 22:05:13,762 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 22:05:13,764 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 22:05:13,765 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 22:05:13,767 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 22:05:13,768 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 22:05:13,769 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 22:05:13,771 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 22:05:13,773 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 22:05:13,774 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 22:05:13,775 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 22:05:13,776 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 22:05:13,776 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 22:05:13,776 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 22:05:13,778 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 22:05:13,778 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 22:05:13,779 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/bin/uautomizer-tBqnrhUYjU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-11-02 22:05:13,829 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 22:05:13,830 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 22:05:13,831 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 22:05:13,831 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 22:05:13,839 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 22:05:13,840 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 22:05:13,840 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 22:05:13,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 22:05:13,841 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-02 22:05:13,841 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-02 22:05:13,842 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-02 22:05:13,842 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-02 22:05:13,842 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 22:05:13,843 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-02 22:05:13,843 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-02 22:05:13,843 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-02 22:05:13,843 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 22:05:13,843 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-02 22:05:13,844 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-02 22:05:13,844 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 22:05:13,844 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 22:05:13,844 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 22:05:13,845 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 22:05:13,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 22:05:13,845 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 22:05:13,845 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 22:05:13,846 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-02 22:05:13,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-02 22:05:13,846 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 22:05:13,846 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/bin/uautomizer-tBqnrhUYjU/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/bin/uautomizer-tBqnrhUYjU 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a [2021-11-02 22:05:14,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 22:05:14,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 22:05:14,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 22:05:14,153 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 22:05:14,155 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 22:05:14,156 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/bin/uautomizer-tBqnrhUYjU/../../sv-benchmarks/c/forester-heap/sll-01-2.i [2021-11-02 22:05:14,224 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/bin/uautomizer-tBqnrhUYjU/data/ad712a1ba/84f3a3324ee14708a5d3f11c92aafc4b/FLAGef8b7670a [2021-11-02 22:05:14,796 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 22:05:14,797 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/sv-benchmarks/c/forester-heap/sll-01-2.i [2021-11-02 22:05:14,812 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/bin/uautomizer-tBqnrhUYjU/data/ad712a1ba/84f3a3324ee14708a5d3f11c92aafc4b/FLAGef8b7670a [2021-11-02 22:05:15,058 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/bin/uautomizer-tBqnrhUYjU/data/ad712a1ba/84f3a3324ee14708a5d3f11c92aafc4b [2021-11-02 22:05:15,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 22:05:15,062 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-11-02 22:05:15,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 22:05:15,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 22:05:15,069 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 22:05:15,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 10:05:15" (1/1) ... [2021-11-02 22:05:15,071 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15b8eaa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:15, skipping insertion in model container [2021-11-02 22:05:15,071 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 10:05:15" (1/1) ... [2021-11-02 22:05:15,081 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 22:05:15,132 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 22:05:15,495 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2021-11-02 22:05:15,502 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2021-11-02 22:05:15,504 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2021-11-02 22:05:15,505 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2021-11-02 22:05:15,509 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2021-11-02 22:05:15,510 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2021-11-02 22:05:15,513 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2021-11-02 22:05:15,514 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2021-11-02 22:05:15,515 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2021-11-02 22:05:15,517 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2021-11-02 22:05:15,519 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2021-11-02 22:05:15,520 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2021-11-02 22:05:15,521 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2021-11-02 22:05:15,526 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 22:05:15,535 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 22:05:15,584 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2021-11-02 22:05:15,587 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2021-11-02 22:05:15,589 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2021-11-02 22:05:15,590 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2021-11-02 22:05:15,593 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2021-11-02 22:05:15,594 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2021-11-02 22:05:15,596 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2021-11-02 22:05:15,597 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2021-11-02 22:05:15,598 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2021-11-02 22:05:15,600 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2021-11-02 22:05:15,602 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2021-11-02 22:05:15,603 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2021-11-02 22:05:15,604 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2021-11-02 22:05:15,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 22:05:15,652 INFO L208 MainTranslator]: Completed translation [2021-11-02 22:05:15,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:15 WrapperNode [2021-11-02 22:05:15,653 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 22:05:15,655 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 22:05:15,655 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 22:05:15,655 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 22:05:15,667 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:15" (1/1) ... [2021-11-02 22:05:15,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:15" (1/1) ... [2021-11-02 22:05:15,710 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:15" (1/1) ... [2021-11-02 22:05:15,710 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:15" (1/1) ... [2021-11-02 22:05:15,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:15" (1/1) ... [2021-11-02 22:05:15,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:15" (1/1) ... [2021-11-02 22:05:15,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:15" (1/1) ... [2021-11-02 22:05:15,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 22:05:15,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 22:05:15,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 22:05:15,760 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 22:05:15,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:15" (1/1) ... [2021-11-02 22:05:15,768 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 22:05:15,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:05:15,791 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-02 22:05:15,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-02 22:05:15,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-11-02 22:05:15,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 22:05:15,837 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-11-02 22:05:15,837 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-11-02 22:05:15,837 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-11-02 22:05:15,838 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-11-02 22:05:15,838 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-11-02 22:05:15,838 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-11-02 22:05:15,838 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-11-02 22:05:15,838 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-11-02 22:05:15,838 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-11-02 22:05:15,838 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-11-02 22:05:15,839 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-11-02 22:05:15,839 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-11-02 22:05:15,839 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-11-02 22:05:15,839 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-11-02 22:05:15,839 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-11-02 22:05:15,839 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-11-02 22:05:15,839 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-11-02 22:05:15,840 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-11-02 22:05:15,840 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-11-02 22:05:15,840 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-11-02 22:05:15,840 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-11-02 22:05:15,840 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-11-02 22:05:15,840 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-11-02 22:05:15,840 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-11-02 22:05:15,841 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-11-02 22:05:15,841 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-11-02 22:05:15,841 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-11-02 22:05:15,841 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-11-02 22:05:15,841 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-11-02 22:05:15,842 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-11-02 22:05:15,842 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-11-02 22:05:15,842 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-11-02 22:05:15,842 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-11-02 22:05:15,842 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-11-02 22:05:15,842 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-11-02 22:05:15,842 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-11-02 22:05:15,843 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-11-02 22:05:15,843 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-11-02 22:05:15,843 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-11-02 22:05:15,844 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-11-02 22:05:15,845 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-11-02 22:05:15,845 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-11-02 22:05:15,846 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-11-02 22:05:15,846 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-11-02 22:05:15,846 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-11-02 22:05:15,846 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-11-02 22:05:15,846 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-11-02 22:05:15,847 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-11-02 22:05:15,847 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-11-02 22:05:15,847 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-11-02 22:05:15,847 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-11-02 22:05:15,847 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-11-02 22:05:15,847 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-11-02 22:05:15,847 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-11-02 22:05:15,848 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-11-02 22:05:15,848 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-11-02 22:05:15,849 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-11-02 22:05:15,849 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-11-02 22:05:15,849 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-11-02 22:05:15,849 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-11-02 22:05:15,849 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-11-02 22:05:15,849 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-11-02 22:05:15,849 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-11-02 22:05:15,850 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-11-02 22:05:15,850 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-11-02 22:05:15,850 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-11-02 22:05:15,850 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-11-02 22:05:15,850 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-11-02 22:05:15,850 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-11-02 22:05:15,850 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-11-02 22:05:15,851 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-11-02 22:05:15,851 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-11-02 22:05:15,851 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-11-02 22:05:15,851 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-11-02 22:05:15,851 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-11-02 22:05:15,851 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-11-02 22:05:15,851 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-11-02 22:05:15,852 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-11-02 22:05:15,852 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-11-02 22:05:15,852 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-11-02 22:05:15,852 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-11-02 22:05:15,852 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-11-02 22:05:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-11-02 22:05:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-11-02 22:05:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-11-02 22:05:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-11-02 22:05:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-11-02 22:05:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-11-02 22:05:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-11-02 22:05:15,855 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-11-02 22:05:15,855 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-11-02 22:05:15,855 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-11-02 22:05:15,855 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-11-02 22:05:15,855 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-11-02 22:05:15,856 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-11-02 22:05:15,856 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-11-02 22:05:15,856 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-11-02 22:05:15,856 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-11-02 22:05:15,856 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-11-02 22:05:15,857 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-11-02 22:05:15,857 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-11-02 22:05:15,858 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-11-02 22:05:15,860 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-11-02 22:05:15,861 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-11-02 22:05:15,861 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-11-02 22:05:15,861 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-11-02 22:05:15,862 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-11-02 22:05:15,862 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-11-02 22:05:15,863 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-11-02 22:05:15,863 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-11-02 22:05:15,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 22:05:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-11-02 22:05:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-02 22:05:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-02 22:05:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-02 22:05:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 22:05:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-11-02 22:05:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-02 22:05:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 22:05:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-02 22:05:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-02 22:05:16,708 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 22:05:16,724 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2021-11-02 22:05:16,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:05:16 BoogieIcfgContainer [2021-11-02 22:05:16,727 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 22:05:16,729 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 22:05:16,729 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 22:05:16,733 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 22:05:16,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 10:05:15" (1/3) ... [2021-11-02 22:05:16,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48395f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 10:05:16, skipping insertion in model container [2021-11-02 22:05:16,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:15" (2/3) ... [2021-11-02 22:05:16,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48395f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 10:05:16, skipping insertion in model container [2021-11-02 22:05:16,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:05:16" (3/3) ... [2021-11-02 22:05:16,737 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2021-11-02 22:05:16,743 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 22:05:16,743 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2021-11-02 22:05:16,790 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 22:05:16,796 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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-11-02 22:05:16,797 INFO L340 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2021-11-02 22:05:16,832 INFO L276 IsEmpty]: Start isEmpty. Operand has 200 states, 115 states have (on average 2.1652173913043478) internal successors, (249), 195 states have internal predecessors, (249), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-02 22:05:16,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-02 22:05:16,841 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:16,842 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:05:16,842 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:16,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:16,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1164341321, now seen corresponding path program 1 times [2021-11-02 22:05:16,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:16,864 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932932511] [2021-11-02 22:05:16,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:16,865 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:17,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:17,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:05:17,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:17,178 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932932511] [2021-11-02 22:05:17,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932932511] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:05:17,179 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:05:17,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 22:05:17,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383856938] [2021-11-02 22:05:17,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:05:17,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:17,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:05:17,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:05:17,225 INFO L87 Difference]: Start difference. First operand has 200 states, 115 states have (on average 2.1652173913043478) internal successors, (249), 195 states have internal predecessors, (249), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:17,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:17,740 INFO L93 Difference]: Finished difference Result 201 states and 212 transitions. [2021-11-02 22:05:17,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:05:17,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-11-02 22:05:17,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:17,757 INFO L225 Difference]: With dead ends: 201 [2021-11-02 22:05:17,757 INFO L226 Difference]: Without dead ends: 197 [2021-11-02 22:05:17,758 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:05:17,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-11-02 22:05:17,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 192. [2021-11-02 22:05:17,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 117 states have (on average 1.7264957264957266) internal successors, (202), 188 states have internal predecessors, (202), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:17,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 205 transitions. [2021-11-02 22:05:17,893 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 205 transitions. Word has length 7 [2021-11-02 22:05:17,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:17,893 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 205 transitions. [2021-11-02 22:05:17,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:17,894 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 205 transitions. [2021-11-02 22:05:17,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-02 22:05:17,894 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:17,895 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:05:17,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-02 22:05:17,895 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:17,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:17,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1164341322, now seen corresponding path program 1 times [2021-11-02 22:05:17,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:17,897 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979480868] [2021-11-02 22:05:17,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:17,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:17,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:17,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:05:17,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:17,995 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979480868] [2021-11-02 22:05:17,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979480868] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:05:17,996 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:05:17,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 22:05:17,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300313961] [2021-11-02 22:05:17,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:05:17,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:18,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:05:18,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:05:18,005 INFO L87 Difference]: Start difference. First operand 192 states and 205 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:18,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:18,410 INFO L93 Difference]: Finished difference Result 222 states and 234 transitions. [2021-11-02 22:05:18,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:05:18,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-11-02 22:05:18,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:18,413 INFO L225 Difference]: With dead ends: 222 [2021-11-02 22:05:18,414 INFO L226 Difference]: Without dead ends: 222 [2021-11-02 22:05:18,414 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:05:18,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-11-02 22:05:18,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 202. [2021-11-02 22:05:18,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 134 states have (on average 1.664179104477612) internal successors, (223), 198 states have internal predecessors, (223), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:18,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 226 transitions. [2021-11-02 22:05:18,429 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 226 transitions. Word has length 7 [2021-11-02 22:05:18,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:18,429 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 226 transitions. [2021-11-02 22:05:18,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:18,430 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 226 transitions. [2021-11-02 22:05:18,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-02 22:05:18,430 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:18,430 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:05:18,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-02 22:05:18,431 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:18,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:18,432 INFO L85 PathProgramCache]: Analyzing trace with hash -2054455159, now seen corresponding path program 1 times [2021-11-02 22:05:18,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:18,432 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157594498] [2021-11-02 22:05:18,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:18,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:18,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:18,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:05:18,506 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:18,506 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157594498] [2021-11-02 22:05:18,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157594498] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:05:18,511 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:05:18,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:05:18,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979401908] [2021-11-02 22:05:18,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:05:18,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:18,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:05:18,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:05:18,514 INFO L87 Difference]: Start difference. First operand 202 states and 226 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:18,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:18,774 INFO L93 Difference]: Finished difference Result 217 states and 229 transitions. [2021-11-02 22:05:18,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:05:18,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2021-11-02 22:05:18,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:18,778 INFO L225 Difference]: With dead ends: 217 [2021-11-02 22:05:18,778 INFO L226 Difference]: Without dead ends: 217 [2021-11-02 22:05:18,778 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:05:18,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-11-02 22:05:18,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 200. [2021-11-02 22:05:18,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 133 states have (on average 1.6541353383458646) internal successors, (220), 196 states have internal predecessors, (220), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:18,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 223 transitions. [2021-11-02 22:05:18,806 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 223 transitions. Word has length 9 [2021-11-02 22:05:18,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:18,806 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 223 transitions. [2021-11-02 22:05:18,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:18,807 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 223 transitions. [2021-11-02 22:05:18,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-02 22:05:18,807 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:18,807 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:05:18,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-02 22:05:18,807 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr9REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:18,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:18,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1492111941, now seen corresponding path program 1 times [2021-11-02 22:05:18,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:18,808 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132684711] [2021-11-02 22:05:18,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:18,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:18,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:18,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:05:18,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:18,947 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132684711] [2021-11-02 22:05:18,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132684711] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:05:18,947 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:05:18,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 22:05:18,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226687747] [2021-11-02 22:05:18,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 22:05:18,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:18,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 22:05:18,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 22:05:18,949 INFO L87 Difference]: Start difference. First operand 200 states and 223 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:19,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:19,414 INFO L93 Difference]: Finished difference Result 199 states and 222 transitions. [2021-11-02 22:05:19,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 22:05:19,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-11-02 22:05:19,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:19,416 INFO L225 Difference]: With dead ends: 199 [2021-11-02 22:05:19,416 INFO L226 Difference]: Without dead ends: 199 [2021-11-02 22:05:19,417 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-02 22:05:19,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-11-02 22:05:19,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2021-11-02 22:05:19,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 133 states have (on average 1.6466165413533835) internal successors, (219), 195 states have internal predecessors, (219), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:19,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 222 transitions. [2021-11-02 22:05:19,440 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 222 transitions. Word has length 15 [2021-11-02 22:05:19,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:19,441 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 222 transitions. [2021-11-02 22:05:19,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:19,442 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 222 transitions. [2021-11-02 22:05:19,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-02 22:05:19,443 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:19,444 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:05:19,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-02 22:05:19,444 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr10REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:19,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:19,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1492111940, now seen corresponding path program 1 times [2021-11-02 22:05:19,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:19,446 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390381105] [2021-11-02 22:05:19,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:19,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:19,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:19,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:05:19,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:19,617 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390381105] [2021-11-02 22:05:19,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390381105] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:05:19,618 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:05:19,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 22:05:19,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286833192] [2021-11-02 22:05:19,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 22:05:19,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:19,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 22:05:19,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 22:05:19,619 INFO L87 Difference]: Start difference. First operand 199 states and 222 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:19,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:19,960 INFO L93 Difference]: Finished difference Result 198 states and 221 transitions. [2021-11-02 22:05:19,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 22:05:19,960 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-11-02 22:05:19,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:19,962 INFO L225 Difference]: With dead ends: 198 [2021-11-02 22:05:19,962 INFO L226 Difference]: Without dead ends: 198 [2021-11-02 22:05:19,962 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-02 22:05:19,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-02 22:05:19,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-11-02 22:05:19,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 133 states have (on average 1.6390977443609023) internal successors, (218), 194 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:19,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 221 transitions. [2021-11-02 22:05:19,970 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 221 transitions. Word has length 15 [2021-11-02 22:05:19,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:19,971 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 221 transitions. [2021-11-02 22:05:19,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:19,971 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 221 transitions. [2021-11-02 22:05:19,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-02 22:05:19,972 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:19,973 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:05:19,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-02 22:05:19,978 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr19ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:19,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:19,979 INFO L85 PathProgramCache]: Analyzing trace with hash 331044621, now seen corresponding path program 1 times [2021-11-02 22:05:19,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:19,983 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552350603] [2021-11-02 22:05:19,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:19,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:20,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:20,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:05:20,064 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:20,065 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552350603] [2021-11-02 22:05:20,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552350603] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:05:20,065 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:05:20,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:05:20,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870019969] [2021-11-02 22:05:20,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:05:20,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:20,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:05:20,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:05:20,067 INFO L87 Difference]: Start difference. First operand 198 states and 221 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:20,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:20,257 INFO L93 Difference]: Finished difference Result 199 states and 222 transitions. [2021-11-02 22:05:20,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:05:20,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-11-02 22:05:20,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:20,259 INFO L225 Difference]: With dead ends: 199 [2021-11-02 22:05:20,259 INFO L226 Difference]: Without dead ends: 199 [2021-11-02 22:05:20,259 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:05:20,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-11-02 22:05:20,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2021-11-02 22:05:20,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 134 states have (on average 1.6343283582089552) internal successors, (219), 195 states have internal predecessors, (219), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:20,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 222 transitions. [2021-11-02 22:05:20,266 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 222 transitions. Word has length 17 [2021-11-02 22:05:20,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:20,266 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 222 transitions. [2021-11-02 22:05:20,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:20,266 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 222 transitions. [2021-11-02 22:05:20,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-02 22:05:20,267 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:20,268 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:05:20,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-02 22:05:20,268 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr13REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:20,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:20,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1404699164, now seen corresponding path program 1 times [2021-11-02 22:05:20,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:20,269 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978542567] [2021-11-02 22:05:20,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:20,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:20,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:20,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:05:20,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:20,442 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978542567] [2021-11-02 22:05:20,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978542567] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:05:20,443 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:05:20,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 22:05:20,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37791993] [2021-11-02 22:05:20,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 22:05:20,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:20,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 22:05:20,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-02 22:05:20,445 INFO L87 Difference]: Start difference. First operand 199 states and 222 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:20,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:20,995 INFO L93 Difference]: Finished difference Result 199 states and 221 transitions. [2021-11-02 22:05:20,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-02 22:05:20,996 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-11-02 22:05:20,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:20,998 INFO L225 Difference]: With dead ends: 199 [2021-11-02 22:05:20,998 INFO L226 Difference]: Without dead ends: 199 [2021-11-02 22:05:20,998 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-11-02 22:05:20,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-11-02 22:05:21,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2021-11-02 22:05:21,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 134 states have (on average 1.626865671641791) internal successors, (218), 194 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:21,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 221 transitions. [2021-11-02 22:05:21,006 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 221 transitions. Word has length 18 [2021-11-02 22:05:21,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:21,006 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 221 transitions. [2021-11-02 22:05:21,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:21,006 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 221 transitions. [2021-11-02 22:05:21,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-02 22:05:21,007 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:21,007 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:05:21,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-02 22:05:21,008 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr14REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:21,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:21,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1404699165, now seen corresponding path program 1 times [2021-11-02 22:05:21,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:21,009 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577030792] [2021-11-02 22:05:21,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:21,009 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:21,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:21,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:05:21,197 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:21,198 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577030792] [2021-11-02 22:05:21,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577030792] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:05:21,198 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:05:21,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 22:05:21,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955035195] [2021-11-02 22:05:21,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 22:05:21,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:21,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 22:05:21,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-02 22:05:21,200 INFO L87 Difference]: Start difference. First operand 198 states and 221 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:21,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:21,791 INFO L93 Difference]: Finished difference Result 198 states and 220 transitions. [2021-11-02 22:05:21,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-02 22:05:21,792 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-11-02 22:05:21,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:21,793 INFO L225 Difference]: With dead ends: 198 [2021-11-02 22:05:21,793 INFO L226 Difference]: Without dead ends: 198 [2021-11-02 22:05:21,794 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-11-02 22:05:21,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-02 22:05:21,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2021-11-02 22:05:21,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 134 states have (on average 1.6194029850746268) internal successors, (217), 193 states have internal predecessors, (217), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:21,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 220 transitions. [2021-11-02 22:05:21,800 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 220 transitions. Word has length 18 [2021-11-02 22:05:21,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:21,800 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 220 transitions. [2021-11-02 22:05:21,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:21,801 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 220 transitions. [2021-11-02 22:05:21,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-02 22:05:21,801 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:21,801 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:05:21,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-02 22:05:21,802 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr19ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:21,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:21,802 INFO L85 PathProgramCache]: Analyzing trace with hash 307937042, now seen corresponding path program 1 times [2021-11-02 22:05:21,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:21,803 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184651287] [2021-11-02 22:05:21,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:21,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:21,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:21,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:05:21,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:21,913 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184651287] [2021-11-02 22:05:21,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184651287] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:05:21,913 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:05:21,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 22:05:21,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443714297] [2021-11-02 22:05:21,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 22:05:21,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:21,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 22:05:21,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-02 22:05:21,915 INFO L87 Difference]: Start difference. First operand 197 states and 220 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:22,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:22,396 INFO L93 Difference]: Finished difference Result 289 states and 319 transitions. [2021-11-02 22:05:22,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-02 22:05:22,396 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-11-02 22:05:22,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:22,399 INFO L225 Difference]: With dead ends: 289 [2021-11-02 22:05:22,399 INFO L226 Difference]: Without dead ends: 289 [2021-11-02 22:05:22,399 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-11-02 22:05:22,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-11-02 22:05:22,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 194. [2021-11-02 22:05:22,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 132 states have (on average 1.621212121212121) internal successors, (214), 190 states have internal predecessors, (214), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:22,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 217 transitions. [2021-11-02 22:05:22,408 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 217 transitions. Word has length 19 [2021-11-02 22:05:22,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:22,408 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 217 transitions. [2021-11-02 22:05:22,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:22,409 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 217 transitions. [2021-11-02 22:05:22,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-02 22:05:22,410 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:22,410 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:05:22,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-02 22:05:22,411 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr20REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:22,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:22,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1873843689, now seen corresponding path program 1 times [2021-11-02 22:05:22,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:22,416 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112490938] [2021-11-02 22:05:22,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:22,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:22,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:22,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:22,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:05:22,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:22,501 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112490938] [2021-11-02 22:05:22,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112490938] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:05:22,501 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:05:22,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 22:05:22,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336559566] [2021-11-02 22:05:22,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 22:05:22,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:22,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 22:05:22,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 22:05:22,503 INFO L87 Difference]: Start difference. First operand 194 states and 217 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:22,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:22,846 INFO L93 Difference]: Finished difference Result 290 states and 319 transitions. [2021-11-02 22:05:22,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 22:05:22,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-11-02 22:05:22,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:22,849 INFO L225 Difference]: With dead ends: 290 [2021-11-02 22:05:22,850 INFO L226 Difference]: Without dead ends: 290 [2021-11-02 22:05:22,850 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-02 22:05:22,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-11-02 22:05:22,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 197. [2021-11-02 22:05:22,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 135 states have (on average 1.6074074074074074) internal successors, (217), 193 states have internal predecessors, (217), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:22,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 220 transitions. [2021-11-02 22:05:22,875 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 220 transitions. Word has length 21 [2021-11-02 22:05:22,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:22,876 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 220 transitions. [2021-11-02 22:05:22,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:22,876 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 220 transitions. [2021-11-02 22:05:22,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-02 22:05:22,877 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:22,877 INFO L513 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-11-02 22:05:22,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-02 22:05:22,878 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr20REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:22,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:22,878 INFO L85 PathProgramCache]: Analyzing trace with hash -515815524, now seen corresponding path program 1 times [2021-11-02 22:05:22,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:22,879 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320534898] [2021-11-02 22:05:22,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:22,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:22,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:22,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:05:22,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:22,938 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320534898] [2021-11-02 22:05:22,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320534898] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:05:22,938 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:05:22,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:05:22,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234337977] [2021-11-02 22:05:22,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 22:05:22,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:22,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 22:05:22,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 22:05:22,940 INFO L87 Difference]: Start difference. First operand 197 states and 220 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:23,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:23,278 INFO L93 Difference]: Finished difference Result 193 states and 214 transitions. [2021-11-02 22:05:23,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 22:05:23,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-11-02 22:05:23,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:23,281 INFO L225 Difference]: With dead ends: 193 [2021-11-02 22:05:23,281 INFO L226 Difference]: Without dead ends: 193 [2021-11-02 22:05:23,281 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-11-02 22:05:23,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-11-02 22:05:23,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 188. [2021-11-02 22:05:23,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 184 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:23,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 211 transitions. [2021-11-02 22:05:23,287 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 211 transitions. Word has length 23 [2021-11-02 22:05:23,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:23,288 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 211 transitions. [2021-11-02 22:05:23,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:23,288 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 211 transitions. [2021-11-02 22:05:23,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-02 22:05:23,290 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:23,291 INFO L513 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-11-02 22:05:23,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-02 22:05:23,291 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr21REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:23,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:23,291 INFO L85 PathProgramCache]: Analyzing trace with hash -515815523, now seen corresponding path program 1 times [2021-11-02 22:05:23,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:23,292 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993446601] [2021-11-02 22:05:23,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:23,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:23,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:23,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:05:23,428 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:23,428 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993446601] [2021-11-02 22:05:23,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993446601] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:05:23,429 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:05:23,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 22:05:23,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127571011] [2021-11-02 22:05:23,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 22:05:23,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:23,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 22:05:23,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-02 22:05:23,431 INFO L87 Difference]: Start difference. First operand 188 states and 211 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:23,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:23,862 INFO L93 Difference]: Finished difference Result 249 states and 266 transitions. [2021-11-02 22:05:23,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 22:05:23,863 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-11-02 22:05:23,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:23,864 INFO L225 Difference]: With dead ends: 249 [2021-11-02 22:05:23,865 INFO L226 Difference]: Without dead ends: 249 [2021-11-02 22:05:23,865 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-02 22:05:23,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-11-02 22:05:23,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 212. [2021-11-02 22:05:23,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 161 states have (on average 1.5341614906832297) internal successors, (247), 208 states have internal predecessors, (247), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:23,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 250 transitions. [2021-11-02 22:05:23,872 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 250 transitions. Word has length 23 [2021-11-02 22:05:23,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:23,873 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 250 transitions. [2021-11-02 22:05:23,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:23,873 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 250 transitions. [2021-11-02 22:05:23,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-02 22:05:23,874 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:23,874 INFO L513 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-11-02 22:05:23,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-02 22:05:23,874 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr45ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:23,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:23,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1777429398, now seen corresponding path program 1 times [2021-11-02 22:05:23,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:23,875 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690639790] [2021-11-02 22:05:23,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:23,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:23,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:23,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:05:23,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:23,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690639790] [2021-11-02 22:05:23,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690639790] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:05:23,925 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:05:23,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 22:05:23,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409631064] [2021-11-02 22:05:23,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 22:05:23,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:23,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 22:05:23,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 22:05:23,927 INFO L87 Difference]: Start difference. First operand 212 states and 250 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:24,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:24,213 INFO L93 Difference]: Finished difference Result 244 states and 260 transitions. [2021-11-02 22:05:24,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 22:05:24,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-11-02 22:05:24,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:24,215 INFO L225 Difference]: With dead ends: 244 [2021-11-02 22:05:24,215 INFO L226 Difference]: Without dead ends: 244 [2021-11-02 22:05:24,216 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-11-02 22:05:24,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-11-02 22:05:24,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 210. [2021-11-02 22:05:24,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 160 states have (on average 1.525) internal successors, (244), 206 states have internal predecessors, (244), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:24,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 247 transitions. [2021-11-02 22:05:24,223 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 247 transitions. Word has length 25 [2021-11-02 22:05:24,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:24,223 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 247 transitions. [2021-11-02 22:05:24,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:24,224 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 247 transitions. [2021-11-02 22:05:24,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-02 22:05:24,232 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:24,232 INFO L513 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-11-02 22:05:24,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-02 22:05:24,233 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr24REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:24,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:24,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1241440350, now seen corresponding path program 1 times [2021-11-02 22:05:24,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:24,236 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060387723] [2021-11-02 22:05:24,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:24,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:24,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:24,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:05:24,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:24,320 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060387723] [2021-11-02 22:05:24,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060387723] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:05:24,321 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:05:24,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 22:05:24,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704592068] [2021-11-02 22:05:24,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 22:05:24,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:24,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 22:05:24,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-02 22:05:24,322 INFO L87 Difference]: Start difference. First operand 210 states and 247 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:24,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:24,728 INFO L93 Difference]: Finished difference Result 210 states and 247 transitions. [2021-11-02 22:05:24,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 22:05:24,729 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-11-02 22:05:24,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:24,731 INFO L225 Difference]: With dead ends: 210 [2021-11-02 22:05:24,731 INFO L226 Difference]: Without dead ends: 210 [2021-11-02 22:05:24,731 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-02 22:05:24,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-11-02 22:05:24,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2021-11-02 22:05:24,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 160 states have (on average 1.51875) internal successors, (243), 205 states have internal predecessors, (243), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:24,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 246 transitions. [2021-11-02 22:05:24,739 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 246 transitions. Word has length 27 [2021-11-02 22:05:24,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:24,740 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 246 transitions. [2021-11-02 22:05:24,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:24,740 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 246 transitions. [2021-11-02 22:05:24,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-02 22:05:24,741 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:24,741 INFO L513 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-11-02 22:05:24,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-02 22:05:24,742 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr25REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:24,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:24,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1241440351, now seen corresponding path program 1 times [2021-11-02 22:05:24,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:24,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399807915] [2021-11-02 22:05:24,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:24,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:24,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:24,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:05:24,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:24,838 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399807915] [2021-11-02 22:05:24,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399807915] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:05:24,838 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:05:24,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 22:05:24,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533214776] [2021-11-02 22:05:24,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 22:05:24,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:24,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 22:05:24,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-02 22:05:24,841 INFO L87 Difference]: Start difference. First operand 209 states and 246 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:25,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:25,266 INFO L93 Difference]: Finished difference Result 202 states and 239 transitions. [2021-11-02 22:05:25,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-02 22:05:25,266 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-11-02 22:05:25,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:25,267 INFO L225 Difference]: With dead ends: 202 [2021-11-02 22:05:25,268 INFO L226 Difference]: Without dead ends: 202 [2021-11-02 22:05:25,268 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-11-02 22:05:25,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-11-02 22:05:25,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 195. [2021-11-02 22:05:25,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 155 states have (on average 1.4709677419354839) internal successors, (228), 191 states have internal predecessors, (228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:25,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 231 transitions. [2021-11-02 22:05:25,274 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 231 transitions. Word has length 27 [2021-11-02 22:05:25,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:25,275 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 231 transitions. [2021-11-02 22:05:25,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:25,275 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 231 transitions. [2021-11-02 22:05:25,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-02 22:05:25,276 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:25,276 INFO L513 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] [2021-11-02 22:05:25,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-02 22:05:25,276 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr26ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:25,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:25,277 INFO L85 PathProgramCache]: Analyzing trace with hash -976729154, now seen corresponding path program 1 times [2021-11-02 22:05:25,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:25,277 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059179536] [2021-11-02 22:05:25,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:25,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:25,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:25,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:25,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:05:25,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:25,358 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059179536] [2021-11-02 22:05:25,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059179536] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:05:25,361 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:05:25,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 22:05:25,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737853962] [2021-11-02 22:05:25,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 22:05:25,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:25,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 22:05:25,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-02 22:05:25,363 INFO L87 Difference]: Start difference. First operand 195 states and 231 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:25,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:25,679 INFO L93 Difference]: Finished difference Result 198 states and 235 transitions. [2021-11-02 22:05:25,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-02 22:05:25,680 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-11-02 22:05:25,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:25,681 INFO L225 Difference]: With dead ends: 198 [2021-11-02 22:05:25,681 INFO L226 Difference]: Without dead ends: 198 [2021-11-02 22:05:25,682 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-11-02 22:05:25,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-02 22:05:25,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 191. [2021-11-02 22:05:25,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 153 states have (on average 1.4640522875816993) internal successors, (224), 187 states have internal predecessors, (224), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:25,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 227 transitions. [2021-11-02 22:05:25,690 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 227 transitions. Word has length 29 [2021-11-02 22:05:25,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:25,691 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 227 transitions. [2021-11-02 22:05:25,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:25,691 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 227 transitions. [2021-11-02 22:05:25,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-02 22:05:25,693 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:25,693 INFO L513 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-11-02 22:05:25,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-02 22:05:25,693 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr59ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:25,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:25,695 INFO L85 PathProgramCache]: Analyzing trace with hash 90529238, now seen corresponding path program 1 times [2021-11-02 22:05:25,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:25,695 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211847575] [2021-11-02 22:05:25,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:25,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:25,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:25,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:05:25,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:25,748 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211847575] [2021-11-02 22:05:25,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211847575] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:05:25,748 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:05:25,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:05:25,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446491594] [2021-11-02 22:05:25,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:05:25,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:25,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:05:25,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:05:25,755 INFO L87 Difference]: Start difference. First operand 191 states and 227 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:25,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:25,931 INFO L93 Difference]: Finished difference Result 264 states and 315 transitions. [2021-11-02 22:05:25,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:05:25,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-11-02 22:05:25,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:25,934 INFO L225 Difference]: With dead ends: 264 [2021-11-02 22:05:25,934 INFO L226 Difference]: Without dead ends: 264 [2021-11-02 22:05:25,934 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:05:25,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-11-02 22:05:25,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 197. [2021-11-02 22:05:25,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 159 states have (on average 1.4591194968553458) internal successors, (232), 193 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:25,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 235 transitions. [2021-11-02 22:05:25,942 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 235 transitions. Word has length 31 [2021-11-02 22:05:25,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:25,943 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 235 transitions. [2021-11-02 22:05:25,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:25,943 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 235 transitions. [2021-11-02 22:05:25,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-02 22:05:25,944 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:25,945 INFO L513 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] [2021-11-02 22:05:25,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-02 22:05:25,946 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr48ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:25,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:25,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1488582203, now seen corresponding path program 1 times [2021-11-02 22:05:25,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:25,947 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486349173] [2021-11-02 22:05:25,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:25,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:25,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:26,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:26,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:26,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:05:26,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:26,011 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486349173] [2021-11-02 22:05:26,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486349173] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:05:26,011 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:05:26,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:05:26,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129252616] [2021-11-02 22:05:26,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:05:26,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:26,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:05:26,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:05:26,015 INFO L87 Difference]: Start difference. First operand 197 states and 235 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:26,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:26,182 INFO L93 Difference]: Finished difference Result 195 states and 232 transitions. [2021-11-02 22:05:26,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:05:26,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-11-02 22:05:26,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:26,183 INFO L225 Difference]: With dead ends: 195 [2021-11-02 22:05:26,183 INFO L226 Difference]: Without dead ends: 195 [2021-11-02 22:05:26,184 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:05:26,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-11-02 22:05:26,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2021-11-02 22:05:26,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 158 states have (on average 1.4493670886075949) internal successors, (229), 191 states have internal predecessors, (229), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:26,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 232 transitions. [2021-11-02 22:05:26,190 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 232 transitions. Word has length 32 [2021-11-02 22:05:26,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:26,191 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 232 transitions. [2021-11-02 22:05:26,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:26,191 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 232 transitions. [2021-11-02 22:05:26,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-02 22:05:26,192 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:26,192 INFO L513 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] [2021-11-02 22:05:26,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-02 22:05:26,193 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr49REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:26,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:26,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1098596299, now seen corresponding path program 1 times [2021-11-02 22:05:26,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:26,194 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131356818] [2021-11-02 22:05:26,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:26,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:26,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:26,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:05:26,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:26,369 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131356818] [2021-11-02 22:05:26,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131356818] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:05:26,369 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:05:26,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 22:05:26,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596644909] [2021-11-02 22:05:26,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 22:05:26,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:26,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 22:05:26,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-02 22:05:26,373 INFO L87 Difference]: Start difference. First operand 195 states and 232 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:26,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:26,963 INFO L93 Difference]: Finished difference Result 325 states and 363 transitions. [2021-11-02 22:05:26,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-02 22:05:26,964 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2021-11-02 22:05:26,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:26,966 INFO L225 Difference]: With dead ends: 325 [2021-11-02 22:05:26,966 INFO L226 Difference]: Without dead ends: 325 [2021-11-02 22:05:26,966 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2021-11-02 22:05:26,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-11-02 22:05:26,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 228. [2021-11-02 22:05:26,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 191 states have (on average 1.3979057591623036) internal successors, (267), 224 states have internal predecessors, (267), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:26,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 270 transitions. [2021-11-02 22:05:26,974 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 270 transitions. Word has length 33 [2021-11-02 22:05:26,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:26,975 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 270 transitions. [2021-11-02 22:05:26,975 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:26,975 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 270 transitions. [2021-11-02 22:05:26,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-02 22:05:26,975 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:26,976 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:05:26,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-02 22:05:26,976 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr46REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:26,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:26,977 INFO L85 PathProgramCache]: Analyzing trace with hash -49345090, now seen corresponding path program 1 times [2021-11-02 22:05:26,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:26,977 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364402667] [2021-11-02 22:05:26,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:26,978 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:27,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:27,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:05:27,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:27,081 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364402667] [2021-11-02 22:05:27,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364402667] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:05:27,082 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128408837] [2021-11-02 22:05:27,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:27,082 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:05:27,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:05:27,088 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:05:27,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-02 22:05:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:27,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-02 22:05:27,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:05:27,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-02 22:05:27,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-02 22:05:27,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:05:27,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-02 22:05:27,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:05:27,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-02 22:05:28,031 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-11-02 22:05:28,031 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 40 [2021-11-02 22:05:28,051 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-11-02 22:05:28,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 22 [2021-11-02 22:05:28,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:05:28,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128408837] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:05:28,070 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:05:28,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2021-11-02 22:05:28,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848161416] [2021-11-02 22:05:28,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-02 22:05:28,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:28,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-02 22:05:28,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-11-02 22:05:28,072 INFO L87 Difference]: Start difference. First operand 228 states and 270 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:28,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:28,709 INFO L93 Difference]: Finished difference Result 381 states and 422 transitions. [2021-11-02 22:05:28,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-02 22:05:28,710 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-11-02 22:05:28,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:28,712 INFO L225 Difference]: With dead ends: 381 [2021-11-02 22:05:28,712 INFO L226 Difference]: Without dead ends: 381 [2021-11-02 22:05:28,713 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2021-11-02 22:05:28,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-11-02 22:05:28,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 266. [2021-11-02 22:05:28,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 229 states have (on average 1.4017467248908297) internal successors, (321), 262 states have internal predecessors, (321), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:28,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 324 transitions. [2021-11-02 22:05:28,731 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 324 transitions. Word has length 35 [2021-11-02 22:05:28,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:28,731 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 324 transitions. [2021-11-02 22:05:28,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:28,731 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 324 transitions. [2021-11-02 22:05:28,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-02 22:05:28,732 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:28,732 INFO L513 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-11-02 22:05:28,759 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-02 22:05:28,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:05:28,947 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr34REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:28,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:28,947 INFO L85 PathProgramCache]: Analyzing trace with hash -824345932, now seen corresponding path program 1 times [2021-11-02 22:05:28,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:28,947 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488155823] [2021-11-02 22:05:28,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:28,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:29,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:29,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:05:29,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:29,008 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488155823] [2021-11-02 22:05:29,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488155823] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:05:29,008 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:05:29,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 22:05:29,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167926838] [2021-11-02 22:05:29,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 22:05:29,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:29,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 22:05:29,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 22:05:29,010 INFO L87 Difference]: Start difference. First operand 266 states and 324 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:29,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:29,382 INFO L93 Difference]: Finished difference Result 265 states and 323 transitions. [2021-11-02 22:05:29,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 22:05:29,382 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2021-11-02 22:05:29,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:29,385 INFO L225 Difference]: With dead ends: 265 [2021-11-02 22:05:29,385 INFO L226 Difference]: Without dead ends: 265 [2021-11-02 22:05:29,385 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-02 22:05:29,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-11-02 22:05:29,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2021-11-02 22:05:29,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 229 states have (on average 1.3973799126637554) internal successors, (320), 261 states have internal predecessors, (320), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:29,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 323 transitions. [2021-11-02 22:05:29,393 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 323 transitions. Word has length 37 [2021-11-02 22:05:29,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:29,394 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 323 transitions. [2021-11-02 22:05:29,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:29,394 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 323 transitions. [2021-11-02 22:05:29,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-02 22:05:29,395 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:29,395 INFO L513 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-11-02 22:05:29,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-02 22:05:29,396 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr35REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:29,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:29,396 INFO L85 PathProgramCache]: Analyzing trace with hash -824345931, now seen corresponding path program 1 times [2021-11-02 22:05:29,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:29,396 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971009287] [2021-11-02 22:05:29,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:29,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:29,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:29,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:29,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:05:29,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:29,478 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971009287] [2021-11-02 22:05:29,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971009287] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:05:29,479 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:05:29,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 22:05:29,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77112365] [2021-11-02 22:05:29,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 22:05:29,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:29,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 22:05:29,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 22:05:29,480 INFO L87 Difference]: Start difference. First operand 265 states and 323 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:29,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:29,794 INFO L93 Difference]: Finished difference Result 264 states and 322 transitions. [2021-11-02 22:05:29,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 22:05:29,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2021-11-02 22:05:29,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:29,799 INFO L225 Difference]: With dead ends: 264 [2021-11-02 22:05:29,800 INFO L226 Difference]: Without dead ends: 264 [2021-11-02 22:05:29,800 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-02 22:05:29,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-11-02 22:05:29,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2021-11-02 22:05:29,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 229 states have (on average 1.3930131004366813) internal successors, (319), 260 states have internal predecessors, (319), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:29,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 322 transitions. [2021-11-02 22:05:29,809 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 322 transitions. Word has length 37 [2021-11-02 22:05:29,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:29,809 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 322 transitions. [2021-11-02 22:05:29,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:29,810 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 322 transitions. [2021-11-02 22:05:29,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-02 22:05:29,812 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:29,812 INFO L513 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-11-02 22:05:29,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-02 22:05:29,812 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr49REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:29,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:29,813 INFO L85 PathProgramCache]: Analyzing trace with hash 385741532, now seen corresponding path program 1 times [2021-11-02 22:05:29,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:29,813 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998530904] [2021-11-02 22:05:29,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:29,814 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:29,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:30,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:30,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:05:30,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:30,019 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998530904] [2021-11-02 22:05:30,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998530904] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:05:30,019 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:05:30,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-02 22:05:30,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014444654] [2021-11-02 22:05:30,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-02 22:05:30,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:30,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-02 22:05:30,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-11-02 22:05:30,021 INFO L87 Difference]: Start difference. First operand 264 states and 322 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:30,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:30,917 INFO L93 Difference]: Finished difference Result 374 states and 421 transitions. [2021-11-02 22:05:30,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-02 22:05:30,917 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2021-11-02 22:05:30,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:30,919 INFO L225 Difference]: With dead ends: 374 [2021-11-02 22:05:30,919 INFO L226 Difference]: Without dead ends: 374 [2021-11-02 22:05:30,920 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2021-11-02 22:05:30,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2021-11-02 22:05:30,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 265. [2021-11-02 22:05:30,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 232 states have (on average 1.3663793103448276) internal successors, (317), 261 states have internal predecessors, (317), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:30,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 320 transitions. [2021-11-02 22:05:30,931 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 320 transitions. Word has length 38 [2021-11-02 22:05:30,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:30,932 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 320 transitions. [2021-11-02 22:05:30,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:30,932 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 320 transitions. [2021-11-02 22:05:30,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-02 22:05:30,933 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:30,933 INFO L513 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-11-02 22:05:30,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-02 22:05:30,934 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr50REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:30,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:30,934 INFO L85 PathProgramCache]: Analyzing trace with hash 385741533, now seen corresponding path program 1 times [2021-11-02 22:05:30,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:30,935 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115489889] [2021-11-02 22:05:30,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:30,935 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:31,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:31,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:05:31,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:31,202 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115489889] [2021-11-02 22:05:31,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115489889] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:05:31,202 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:05:31,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-02 22:05:31,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464362866] [2021-11-02 22:05:31,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-02 22:05:31,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:31,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-02 22:05:31,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-11-02 22:05:31,204 INFO L87 Difference]: Start difference. First operand 265 states and 320 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:32,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:32,297 INFO L93 Difference]: Finished difference Result 430 states and 478 transitions. [2021-11-02 22:05:32,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-02 22:05:32,297 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2021-11-02 22:05:32,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:32,300 INFO L225 Difference]: With dead ends: 430 [2021-11-02 22:05:32,300 INFO L226 Difference]: Without dead ends: 430 [2021-11-02 22:05:32,301 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2021-11-02 22:05:32,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2021-11-02 22:05:32,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 271. [2021-11-02 22:05:32,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 238 states have (on average 1.361344537815126) internal successors, (324), 267 states have internal predecessors, (324), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:32,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 327 transitions. [2021-11-02 22:05:32,311 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 327 transitions. Word has length 38 [2021-11-02 22:05:32,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:32,311 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 327 transitions. [2021-11-02 22:05:32,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:32,312 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 327 transitions. [2021-11-02 22:05:32,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-02 22:05:32,313 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:32,313 INFO L513 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-11-02 22:05:32,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-02 22:05:32,313 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr44ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:32,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:32,314 INFO L85 PathProgramCache]: Analyzing trace with hash 2104055878, now seen corresponding path program 1 times [2021-11-02 22:05:32,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:32,314 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787310248] [2021-11-02 22:05:32,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:32,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:32,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:32,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:32,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:05:32,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:32,388 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787310248] [2021-11-02 22:05:32,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787310248] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:05:32,388 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:05:32,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:05:32,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997426607] [2021-11-02 22:05:32,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:05:32,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:32,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:05:32,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:05:32,391 INFO L87 Difference]: Start difference. First operand 271 states and 327 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:32,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:32,581 INFO L93 Difference]: Finished difference Result 273 states and 329 transitions. [2021-11-02 22:05:32,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:05:32,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2021-11-02 22:05:32,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:32,585 INFO L225 Difference]: With dead ends: 273 [2021-11-02 22:05:32,585 INFO L226 Difference]: Without dead ends: 273 [2021-11-02 22:05:32,586 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:05:32,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-11-02 22:05:32,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2021-11-02 22:05:32,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 240 states have (on average 1.3583333333333334) internal successors, (326), 269 states have internal predecessors, (326), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:32,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 329 transitions. [2021-11-02 22:05:32,601 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 329 transitions. Word has length 39 [2021-11-02 22:05:32,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:32,601 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 329 transitions. [2021-11-02 22:05:32,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:32,602 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 329 transitions. [2021-11-02 22:05:32,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-02 22:05:32,603 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:32,603 INFO L513 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-11-02 22:05:32,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-02 22:05:32,603 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr64ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:32,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:32,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1003773134, now seen corresponding path program 1 times [2021-11-02 22:05:32,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:32,605 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414020285] [2021-11-02 22:05:32,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:32,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:32,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:32,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-02 22:05:32,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:32,711 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414020285] [2021-11-02 22:05:32,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414020285] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:05:32,711 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:05:32,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 22:05:32,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128545630] [2021-11-02 22:05:32,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 22:05:32,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:32,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 22:05:32,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-02 22:05:32,713 INFO L87 Difference]: Start difference. First operand 273 states and 329 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:33,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:33,038 INFO L93 Difference]: Finished difference Result 288 states and 344 transitions. [2021-11-02 22:05:33,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-02 22:05:33,039 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-11-02 22:05:33,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:33,041 INFO L225 Difference]: With dead ends: 288 [2021-11-02 22:05:33,041 INFO L226 Difference]: Without dead ends: 288 [2021-11-02 22:05:33,041 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-11-02 22:05:33,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2021-11-02 22:05:33,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 282. [2021-11-02 22:05:33,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 249 states have (on average 1.3453815261044177) internal successors, (335), 278 states have internal predecessors, (335), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:33,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 338 transitions. [2021-11-02 22:05:33,049 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 338 transitions. Word has length 40 [2021-11-02 22:05:33,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:33,050 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 338 transitions. [2021-11-02 22:05:33,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:33,050 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 338 transitions. [2021-11-02 22:05:33,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-02 22:05:33,051 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:33,051 INFO L513 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-11-02 22:05:33,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-02 22:05:33,051 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr38REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:33,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:33,052 INFO L85 PathProgramCache]: Analyzing trace with hash 533473399, now seen corresponding path program 1 times [2021-11-02 22:05:33,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:33,052 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934777856] [2021-11-02 22:05:33,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:33,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:33,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:33,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:05:33,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:33,191 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934777856] [2021-11-02 22:05:33,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934777856] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:05:33,191 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:05:33,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 22:05:33,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988814219] [2021-11-02 22:05:33,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 22:05:33,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:33,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 22:05:33,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-02 22:05:33,193 INFO L87 Difference]: Start difference. First operand 282 states and 338 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:33,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:33,516 INFO L93 Difference]: Finished difference Result 282 states and 338 transitions. [2021-11-02 22:05:33,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-02 22:05:33,516 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-11-02 22:05:33,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:33,518 INFO L225 Difference]: With dead ends: 282 [2021-11-02 22:05:33,518 INFO L226 Difference]: Without dead ends: 282 [2021-11-02 22:05:33,519 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-11-02 22:05:33,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-11-02 22:05:33,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2021-11-02 22:05:33,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 249 states have (on average 1.3413654618473896) internal successors, (334), 277 states have internal predecessors, (334), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:33,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 337 transitions. [2021-11-02 22:05:33,527 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 337 transitions. Word has length 40 [2021-11-02 22:05:33,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:33,527 INFO L470 AbstractCegarLoop]: Abstraction has 281 states and 337 transitions. [2021-11-02 22:05:33,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:33,528 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 337 transitions. [2021-11-02 22:05:33,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-02 22:05:33,528 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:33,529 INFO L513 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-11-02 22:05:33,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-02 22:05:33,529 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr39REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:33,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:33,530 INFO L85 PathProgramCache]: Analyzing trace with hash 533473400, now seen corresponding path program 1 times [2021-11-02 22:05:33,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:33,530 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842643840] [2021-11-02 22:05:33,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:33,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:33,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:33,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:33,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-11-02 22:05:33,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:33,698 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842643840] [2021-11-02 22:05:33,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842643840] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:05:33,699 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:05:33,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 22:05:33,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124693735] [2021-11-02 22:05:33,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 22:05:33,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:33,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 22:05:33,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-02 22:05:33,701 INFO L87 Difference]: Start difference. First operand 281 states and 337 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:34,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:34,168 INFO L93 Difference]: Finished difference Result 281 states and 337 transitions. [2021-11-02 22:05:34,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-02 22:05:34,172 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-11-02 22:05:34,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:34,174 INFO L225 Difference]: With dead ends: 281 [2021-11-02 22:05:34,175 INFO L226 Difference]: Without dead ends: 281 [2021-11-02 22:05:34,175 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-11-02 22:05:34,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-11-02 22:05:34,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 280. [2021-11-02 22:05:34,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 249 states have (on average 1.3373493975903614) internal successors, (333), 276 states have internal predecessors, (333), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:34,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 336 transitions. [2021-11-02 22:05:34,203 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 336 transitions. Word has length 40 [2021-11-02 22:05:34,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:34,203 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 336 transitions. [2021-11-02 22:05:34,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:34,205 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 336 transitions. [2021-11-02 22:05:34,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-02 22:05:34,205 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:34,206 INFO L513 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-11-02 22:05:34,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-02 22:05:34,206 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr51ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:34,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:34,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1330432764, now seen corresponding path program 1 times [2021-11-02 22:05:34,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:34,207 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894852140] [2021-11-02 22:05:34,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:34,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:34,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:34,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:34,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:05:34,608 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:34,608 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894852140] [2021-11-02 22:05:34,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894852140] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:05:34,609 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:05:34,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-02 22:05:34,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561537235] [2021-11-02 22:05:34,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-02 22:05:34,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:34,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-02 22:05:34,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-11-02 22:05:34,612 INFO L87 Difference]: Start difference. First operand 280 states and 336 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:35,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:35,730 INFO L93 Difference]: Finished difference Result 448 states and 489 transitions. [2021-11-02 22:05:35,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-02 22:05:35,731 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-11-02 22:05:35,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:35,734 INFO L225 Difference]: With dead ends: 448 [2021-11-02 22:05:35,734 INFO L226 Difference]: Without dead ends: 448 [2021-11-02 22:05:35,735 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2021-11-02 22:05:35,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-11-02 22:05:35,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 280. [2021-11-02 22:05:35,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 249 states have (on average 1.3333333333333333) internal successors, (332), 276 states have internal predecessors, (332), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:35,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 335 transitions. [2021-11-02 22:05:35,744 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 335 transitions. Word has length 40 [2021-11-02 22:05:35,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:35,744 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 335 transitions. [2021-11-02 22:05:35,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:35,745 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 335 transitions. [2021-11-02 22:05:35,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-02 22:05:35,745 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:35,746 INFO L513 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, 1] [2021-11-02 22:05:35,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-02 22:05:35,746 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr44ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:35,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:35,747 INFO L85 PathProgramCache]: Analyzing trace with hash -930257781, now seen corresponding path program 1 times [2021-11-02 22:05:35,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:35,747 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369050956] [2021-11-02 22:05:35,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:35,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:35,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:35,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:05:35,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:35,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369050956] [2021-11-02 22:05:35,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369050956] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:05:35,854 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:05:35,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 22:05:35,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237238062] [2021-11-02 22:05:35,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 22:05:35,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:35,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 22:05:35,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-02 22:05:35,855 INFO L87 Difference]: Start difference. First operand 280 states and 335 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:36,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:36,157 INFO L93 Difference]: Finished difference Result 290 states and 346 transitions. [2021-11-02 22:05:36,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-02 22:05:36,158 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2021-11-02 22:05:36,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:36,160 INFO L225 Difference]: With dead ends: 290 [2021-11-02 22:05:36,160 INFO L226 Difference]: Without dead ends: 290 [2021-11-02 22:05:36,161 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-11-02 22:05:36,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-11-02 22:05:36,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 276. [2021-11-02 22:05:36,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 246 states have (on average 1.329268292682927) internal successors, (327), 272 states have internal predecessors, (327), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:36,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 330 transitions. [2021-11-02 22:05:36,169 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 330 transitions. Word has length 41 [2021-11-02 22:05:36,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:36,169 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 330 transitions. [2021-11-02 22:05:36,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:36,170 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 330 transitions. [2021-11-02 22:05:36,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-02 22:05:36,171 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:36,171 INFO L513 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, 1, 1] [2021-11-02 22:05:36,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-02 22:05:36,171 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr77ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:36,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:36,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1804534839, now seen corresponding path program 1 times [2021-11-02 22:05:36,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:36,172 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660781118] [2021-11-02 22:05:36,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:36,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:36,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:36,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-02 22:05:36,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:36,221 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660781118] [2021-11-02 22:05:36,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660781118] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:05:36,221 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:05:36,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 22:05:36,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58701376] [2021-11-02 22:05:36,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:05:36,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:36,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:05:36,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:05:36,223 INFO L87 Difference]: Start difference. First operand 276 states and 330 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:36,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:36,424 INFO L93 Difference]: Finished difference Result 289 states and 334 transitions. [2021-11-02 22:05:36,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:05:36,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2021-11-02 22:05:36,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:36,426 INFO L225 Difference]: With dead ends: 289 [2021-11-02 22:05:36,426 INFO L226 Difference]: Without dead ends: 289 [2021-11-02 22:05:36,427 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:05:36,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-11-02 22:05:36,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 277. [2021-11-02 22:05:36,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 247 states have (on average 1.3279352226720649) internal successors, (328), 273 states have internal predecessors, (328), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:36,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 331 transitions. [2021-11-02 22:05:36,435 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 331 transitions. Word has length 42 [2021-11-02 22:05:36,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:36,435 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 331 transitions. [2021-11-02 22:05:36,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:36,436 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 331 transitions. [2021-11-02 22:05:36,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-02 22:05:36,436 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:36,437 INFO L513 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, 1, 1, 1] [2021-11-02 22:05:36,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-02 22:05:36,437 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr54ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:36,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:36,438 INFO L85 PathProgramCache]: Analyzing trace with hash 968459560, now seen corresponding path program 1 times [2021-11-02 22:05:36,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:36,438 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459166457] [2021-11-02 22:05:36,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:36,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:36,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:36,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:05:36,767 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:36,767 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459166457] [2021-11-02 22:05:36,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459166457] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:05:36,767 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:05:36,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-02 22:05:36,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105812582] [2021-11-02 22:05:36,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-02 22:05:36,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:36,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-02 22:05:36,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-11-02 22:05:36,769 INFO L87 Difference]: Start difference. First operand 277 states and 331 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:37,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:37,733 INFO L93 Difference]: Finished difference Result 428 states and 475 transitions. [2021-11-02 22:05:37,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-02 22:05:37,736 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2021-11-02 22:05:37,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:37,738 INFO L225 Difference]: With dead ends: 428 [2021-11-02 22:05:37,739 INFO L226 Difference]: Without dead ends: 428 [2021-11-02 22:05:37,739 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=711, Unknown=0, NotChecked=0, Total=870 [2021-11-02 22:05:37,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-11-02 22:05:37,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 277. [2021-11-02 22:05:37,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 247 states have (on average 1.3238866396761133) internal successors, (327), 273 states have internal predecessors, (327), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:37,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 330 transitions. [2021-11-02 22:05:37,748 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 330 transitions. Word has length 43 [2021-11-02 22:05:37,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:37,749 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 330 transitions. [2021-11-02 22:05:37,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:37,749 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 330 transitions. [2021-11-02 22:05:37,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-02 22:05:37,750 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:37,750 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:05:37,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-02 22:05:37,751 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr62REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:37,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:37,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1207787386, now seen corresponding path program 1 times [2021-11-02 22:05:37,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:37,752 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813036437] [2021-11-02 22:05:37,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:37,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:37,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:37,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:05:37,919 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:37,919 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813036437] [2021-11-02 22:05:37,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813036437] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:05:37,919 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791442224] [2021-11-02 22:05:37,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:37,920 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:05:37,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:05:37,921 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:05:37,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-02 22:05:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:38,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-02 22:05:38,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:05:38,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-02 22:05:38,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-02 22:05:38,247 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-11-02 22:05:38,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-11-02 22:05:38,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:05:38,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-02 22:05:38,713 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-02 22:05:38,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2021-11-02 22:05:38,724 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-02 22:05:38,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 13 [2021-11-02 22:05:38,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-02 22:05:38,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791442224] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:05:38,763 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:05:38,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 11 [2021-11-02 22:05:38,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311534463] [2021-11-02 22:05:38,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-02 22:05:38,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:38,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-02 22:05:38,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-11-02 22:05:38,767 INFO L87 Difference]: Start difference. First operand 277 states and 330 transitions. Second operand has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:39,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:39,590 INFO L93 Difference]: Finished difference Result 409 states and 450 transitions. [2021-11-02 22:05:39,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-02 22:05:39,591 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2021-11-02 22:05:39,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:39,594 INFO L225 Difference]: With dead ends: 409 [2021-11-02 22:05:39,594 INFO L226 Difference]: Without dead ends: 409 [2021-11-02 22:05:39,594 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2021-11-02 22:05:39,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2021-11-02 22:05:39,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 301. [2021-11-02 22:05:39,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 271 states have (on average 1.3357933579335792) internal successors, (362), 297 states have internal predecessors, (362), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:39,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 365 transitions. [2021-11-02 22:05:39,604 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 365 transitions. Word has length 45 [2021-11-02 22:05:39,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:39,605 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 365 transitions. [2021-11-02 22:05:39,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:39,605 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 365 transitions. [2021-11-02 22:05:39,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-02 22:05:39,606 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:39,606 INFO L513 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, 1, 1, 1, 1, 1] [2021-11-02 22:05:39,646 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-02 22:05:39,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:05:39,828 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting mainErr64ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:39,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:39,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1891470081, now seen corresponding path program 1 times [2021-11-02 22:05:39,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:39,829 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759541446] [2021-11-02 22:05:39,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:39,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:39,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:39,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-02 22:05:39,877 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:39,877 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759541446] [2021-11-02 22:05:39,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759541446] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:05:39,877 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:05:39,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:05:39,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935064457] [2021-11-02 22:05:39,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:05:39,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:39,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:05:39,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:05:39,879 INFO L87 Difference]: Start difference. First operand 301 states and 365 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:40,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:40,090 INFO L93 Difference]: Finished difference Result 303 states and 365 transitions. [2021-11-02 22:05:40,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:05:40,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2021-11-02 22:05:40,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:40,092 INFO L225 Difference]: With dead ends: 303 [2021-11-02 22:05:40,092 INFO L226 Difference]: Without dead ends: 303 [2021-11-02 22:05:40,093 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:05:40,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-11-02 22:05:40,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2021-11-02 22:05:40,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 270 states have (on average 1.325925925925926) internal successors, (358), 295 states have internal predecessors, (358), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:40,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 361 transitions. [2021-11-02 22:05:40,101 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 361 transitions. Word has length 45 [2021-11-02 22:05:40,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:40,101 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 361 transitions. [2021-11-02 22:05:40,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:40,102 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 361 transitions. [2021-11-02 22:05:40,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-02 22:05:40,102 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:40,103 INFO L513 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, 1, 1, 1, 1, 1, 1] [2021-11-02 22:05:40,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-02 22:05:40,103 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting mainErr79ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:40,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:40,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1213297892, now seen corresponding path program 1 times [2021-11-02 22:05:40,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:40,104 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678256385] [2021-11-02 22:05:40,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:40,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:40,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:40,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:40,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-02 22:05:40,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:40,166 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678256385] [2021-11-02 22:05:40,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678256385] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:05:40,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661476903] [2021-11-02 22:05:40,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:40,167 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 22:05:40,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:05:40,172 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-02 22:05:40,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-02 22:05:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:40,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-02 22:05:40,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:05:40,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-02 22:05:40,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661476903] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 22:05:40,778 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:05:40,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-11-02 22:05:40,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955514048] [2021-11-02 22:05:40,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 22:05:40,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:40,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 22:05:40,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-02 22:05:40,782 INFO L87 Difference]: Start difference. First operand 299 states and 361 transitions. Second operand has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:41,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:41,119 INFO L93 Difference]: Finished difference Result 330 states and 392 transitions. [2021-11-02 22:05:41,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 22:05:41,120 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2021-11-02 22:05:41,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:41,122 INFO L225 Difference]: With dead ends: 330 [2021-11-02 22:05:41,122 INFO L226 Difference]: Without dead ends: 306 [2021-11-02 22:05:41,123 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-02 22:05:41,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-11-02 22:05:41,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2021-11-02 22:05:41,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 277 states have (on average 1.3176895306859207) internal successors, (365), 302 states have internal predecessors, (365), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:41,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 368 transitions. [2021-11-02 22:05:41,130 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 368 transitions. Word has length 46 [2021-11-02 22:05:41,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:41,130 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 368 transitions. [2021-11-02 22:05:41,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:41,131 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 368 transitions. [2021-11-02 22:05:41,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-02 22:05:41,131 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:41,131 INFO L513 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, 1, 1, 1, 1, 1, 1] [2021-11-02 22:05:41,168 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-02 22:05:41,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/bin/uautomizer-tBqnrhUYjU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-11-02 22:05:41,344 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting mainErr65REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:41,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:41,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1493965183, now seen corresponding path program 1 times [2021-11-02 22:05:41,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:41,345 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993863322] [2021-11-02 22:05:41,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:41,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:41,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:41,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-02 22:05:41,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:41,533 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993863322] [2021-11-02 22:05:41,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993863322] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:05:41,533 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:05:41,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 22:05:41,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443576127] [2021-11-02 22:05:41,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-02 22:05:41,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:41,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-02 22:05:41,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-02 22:05:41,535 INFO L87 Difference]: Start difference. First operand 306 states and 368 transitions. Second operand has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:42,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:42,108 INFO L93 Difference]: Finished difference Result 349 states and 402 transitions. [2021-11-02 22:05:42,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-02 22:05:42,109 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2021-11-02 22:05:42,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:42,111 INFO L225 Difference]: With dead ends: 349 [2021-11-02 22:05:42,111 INFO L226 Difference]: Without dead ends: 349 [2021-11-02 22:05:42,112 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2021-11-02 22:05:42,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-11-02 22:05:42,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 313. [2021-11-02 22:05:42,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 284 states have (on average 1.3169014084507042) internal successors, (374), 309 states have internal predecessors, (374), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:42,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 377 transitions. [2021-11-02 22:05:42,120 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 377 transitions. Word has length 46 [2021-11-02 22:05:42,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:42,121 INFO L470 AbstractCegarLoop]: Abstraction has 313 states and 377 transitions. [2021-11-02 22:05:42,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:42,121 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 377 transitions. [2021-11-02 22:05:42,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-02 22:05:42,122 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:42,122 INFO L513 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, 1, 1, 1, 1, 1, 1] [2021-11-02 22:05:42,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-02 22:05:42,123 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting mainErr66REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:42,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:42,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1493965182, now seen corresponding path program 1 times [2021-11-02 22:05:42,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:42,123 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083505766] [2021-11-02 22:05:42,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:42,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:42,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-02 22:05:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:42,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-02 22:05:42,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:42,344 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083505766] [2021-11-02 22:05:42,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083505766] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:05:42,345 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:05:42,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-02 22:05:42,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789834728] [2021-11-02 22:05:42,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-02 22:05:42,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:42,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-02 22:05:42,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-11-02 22:05:42,347 INFO L87 Difference]: Start difference. First operand 313 states and 377 transitions. Second operand has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:42,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:42,982 INFO L93 Difference]: Finished difference Result 349 states and 402 transitions. [2021-11-02 22:05:42,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-02 22:05:42,983 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2021-11-02 22:05:42,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:42,985 INFO L225 Difference]: With dead ends: 349 [2021-11-02 22:05:42,985 INFO L226 Difference]: Without dead ends: 349 [2021-11-02 22:05:42,986 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2021-11-02 22:05:42,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-11-02 22:05:42,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 319. [2021-11-02 22:05:42,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 290 states have (on average 1.313793103448276) internal successors, (381), 315 states have internal predecessors, (381), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:42,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 384 transitions. [2021-11-02 22:05:42,994 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 384 transitions. Word has length 46 [2021-11-02 22:05:42,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:42,994 INFO L470 AbstractCegarLoop]: Abstraction has 319 states and 384 transitions. [2021-11-02 22:05:42,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-02 22:05:42,994 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 384 transitions. [2021-11-02 22:05:42,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-02 22:05:42,995 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:42,995 INFO L513 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, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:05:42,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-02 22:05:42,996 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting mainErr57REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-11-02 22:05:42,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:42,996 INFO L85 PathProgramCache]: Analyzing trace with hash 292246064, now seen corresponding path program 1 times [2021-11-02 22:05:42,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:42,997 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136759815] [2021-11-02 22:05:42,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:42,997 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:05:43,016 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:05:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:05:43,064 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:05:43,064 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-02 22:05:43,065 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr57REQUIRES_VIOLATION [2021-11-02 22:05:43,067 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-11-02 22:05:43,067 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-11-02 22:05:43,068 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2ASSERT_VIOLATIONMEMORY_LEAK [2021-11-02 22:05:43,068 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-11-02 22:05:43,068 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-11-02 22:05:43,068 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-11-02 22:05:43,069 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-11-02 22:05:43,069 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-11-02 22:05:43,069 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-11-02 22:05:43,069 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-11-02 22:05:43,069 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-11-02 22:05:43,069 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-11-02 22:05:43,070 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION [2021-11-02 22:05:43,070 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION [2021-11-02 22:05:43,070 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION [2021-11-02 22:05:43,070 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-11-02 22:05:43,070 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION [2021-11-02 22:05:43,071 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17REQUIRES_VIOLATION [2021-11-02 22:05:43,071 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION [2021-11-02 22:05:43,071 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19ASSERT_VIOLATIONMEMORY_LEAK [2021-11-02 22:05:43,071 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION [2021-11-02 22:05:43,071 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21REQUIRES_VIOLATION [2021-11-02 22:05:43,072 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22REQUIRES_VIOLATION [2021-11-02 22:05:43,072 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23REQUIRES_VIOLATION [2021-11-02 22:05:43,072 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION [2021-11-02 22:05:43,072 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION [2021-11-02 22:05:43,072 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26ASSERT_VIOLATIONMEMORY_LEAK [2021-11-02 22:05:43,073 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27ASSERT_VIOLATIONMEMORY_LEAK [2021-11-02 22:05:43,073 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION [2021-11-02 22:05:43,073 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr29REQUIRES_VIOLATION [2021-11-02 22:05:43,073 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr30REQUIRES_VIOLATION [2021-11-02 22:05:43,073 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr31REQUIRES_VIOLATION [2021-11-02 22:05:43,073 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr32REQUIRES_VIOLATION [2021-11-02 22:05:43,074 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr33REQUIRES_VIOLATION [2021-11-02 22:05:43,074 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr34REQUIRES_VIOLATION [2021-11-02 22:05:43,074 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr35REQUIRES_VIOLATION [2021-11-02 22:05:43,074 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr36REQUIRES_VIOLATION [2021-11-02 22:05:43,074 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr37REQUIRES_VIOLATION [2021-11-02 22:05:43,074 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr38REQUIRES_VIOLATION [2021-11-02 22:05:43,075 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr39REQUIRES_VIOLATION [2021-11-02 22:05:43,075 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr40REQUIRES_VIOLATION [2021-11-02 22:05:43,075 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr41REQUIRES_VIOLATION [2021-11-02 22:05:43,075 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr42REQUIRES_VIOLATION [2021-11-02 22:05:43,075 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr43REQUIRES_VIOLATION [2021-11-02 22:05:43,076 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr44ASSERT_VIOLATIONMEMORY_LEAK [2021-11-02 22:05:43,076 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr45ASSERT_VIOLATIONMEMORY_LEAK [2021-11-02 22:05:43,076 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr46REQUIRES_VIOLATION [2021-11-02 22:05:43,076 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr47REQUIRES_VIOLATION [2021-11-02 22:05:43,076 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr48ASSERT_VIOLATIONMEMORY_LEAK [2021-11-02 22:05:43,077 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr49REQUIRES_VIOLATION [2021-11-02 22:05:43,077 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr50REQUIRES_VIOLATION [2021-11-02 22:05:43,077 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr51ASSERT_VIOLATIONMEMORY_LEAK [2021-11-02 22:05:43,077 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr52REQUIRES_VIOLATION [2021-11-02 22:05:43,077 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr53REQUIRES_VIOLATION [2021-11-02 22:05:43,078 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr54ASSERT_VIOLATIONMEMORY_LEAK [2021-11-02 22:05:43,078 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr55REQUIRES_VIOLATION [2021-11-02 22:05:43,078 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr56REQUIRES_VIOLATION [2021-11-02 22:05:43,078 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr58REQUIRES_VIOLATION [2021-11-02 22:05:43,078 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr59ASSERT_VIOLATIONMEMORY_LEAK [2021-11-02 22:05:43,078 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr60REQUIRES_VIOLATION [2021-11-02 22:05:43,079 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr61REQUIRES_VIOLATION [2021-11-02 22:05:43,079 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr62REQUIRES_VIOLATION [2021-11-02 22:05:43,079 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr63REQUIRES_VIOLATION [2021-11-02 22:05:43,079 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr64ASSERT_VIOLATIONMEMORY_LEAK [2021-11-02 22:05:43,079 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr65REQUIRES_VIOLATION [2021-11-02 22:05:43,080 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr66REQUIRES_VIOLATION [2021-11-02 22:05:43,080 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr67ASSERT_VIOLATIONMEMORY_LEAK [2021-11-02 22:05:43,080 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr68REQUIRES_VIOLATION [2021-11-02 22:05:43,080 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr69REQUIRES_VIOLATION [2021-11-02 22:05:43,080 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr70ASSERT_VIOLATIONMEMORY_LEAK [2021-11-02 22:05:43,081 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr71ASSERT_VIOLATIONMEMORY_FREE [2021-11-02 22:05:43,081 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr72ASSERT_VIOLATIONMEMORY_FREE [2021-11-02 22:05:43,081 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr73ASSERT_VIOLATIONMEMORY_FREE [2021-11-02 22:05:43,081 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr74REQUIRES_VIOLATION [2021-11-02 22:05:43,081 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr75REQUIRES_VIOLATION [2021-11-02 22:05:43,081 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr76ASSERT_VIOLATIONMEMORY_FREE [2021-11-02 22:05:43,082 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr77ASSERT_VIOLATIONMEMORY_FREE [2021-11-02 22:05:43,082 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr78ASSERT_VIOLATIONMEMORY_FREE [2021-11-02 22:05:43,082 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr79ENSURES_VIOLATIONMEMORY_LEAK [2021-11-02 22:05:43,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-02 22:05:43,086 INFO L731 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:05:43,091 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-02 22:05:43,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 10:05:43 BoogieIcfgContainer [2021-11-02 22:05:43,132 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-02 22:05:43,133 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-02 22:05:43,133 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-02 22:05:43,133 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-02 22:05:43,134 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:05:16" (3/4) ... [2021-11-02 22:05:43,136 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-02 22:05:43,187 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/bin/uautomizer-tBqnrhUYjU/witness.graphml [2021-11-02 22:05:43,187 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-02 22:05:43,188 INFO L168 Benchmark]: Toolchain (without parser) took 28125.74 ms. Allocated memory was 96.5 MB in the beginning and 172.0 MB in the end (delta: 75.5 MB). Free memory was 54.3 MB in the beginning and 103.5 MB in the end (delta: -49.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 16.1 GB. [2021-11-02 22:05:43,189 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 96.5 MB. Free memory is still 71.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-02 22:05:43,189 INFO L168 Benchmark]: CACSL2BoogieTranslator took 590.55 ms. Allocated memory is still 96.5 MB. Free memory was 54.1 MB in the beginning and 61.7 MB in the end (delta: -7.6 MB). Peak memory consumption was 4.4 MB. Max. memory is 16.1 GB. [2021-11-02 22:05:43,190 INFO L168 Benchmark]: Boogie Preprocessor took 103.73 ms. Allocated memory is still 96.5 MB. Free memory was 61.7 MB in the beginning and 58.5 MB in the end (delta: 3.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-02 22:05:43,190 INFO L168 Benchmark]: RCFGBuilder took 967.69 ms. Allocated memory was 96.5 MB in the beginning and 117.4 MB in the end (delta: 21.0 MB). Free memory was 58.5 MB in the beginning and 84.9 MB in the end (delta: -26.4 MB). Peak memory consumption was 36.5 MB. Max. memory is 16.1 GB. [2021-11-02 22:05:43,191 INFO L168 Benchmark]: TraceAbstraction took 26403.57 ms. Allocated memory was 117.4 MB in the beginning and 172.0 MB in the end (delta: 54.5 MB). Free memory was 84.3 MB in the beginning and 105.6 MB in the end (delta: -21.3 MB). Peak memory consumption was 34.2 MB. Max. memory is 16.1 GB. [2021-11-02 22:05:43,191 INFO L168 Benchmark]: Witness Printer took 54.26 ms. Allocated memory is still 172.0 MB. Free memory was 105.6 MB in the beginning and 103.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-02 22:05:43,194 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.31 ms. Allocated memory is still 96.5 MB. Free memory is still 71.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 590.55 ms. Allocated memory is still 96.5 MB. Free memory was 54.1 MB in the beginning and 61.7 MB in the end (delta: -7.6 MB). Peak memory consumption was 4.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 103.73 ms. Allocated memory is still 96.5 MB. Free memory was 61.7 MB in the beginning and 58.5 MB in the end (delta: 3.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 967.69 ms. Allocated memory was 96.5 MB in the beginning and 117.4 MB in the end (delta: 21.0 MB). Free memory was 58.5 MB in the beginning and 84.9 MB in the end (delta: -26.4 MB). Peak memory consumption was 36.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 26403.57 ms. Allocated memory was 117.4 MB in the beginning and 172.0 MB in the end (delta: 54.5 MB). Free memory was 84.3 MB in the beginning and 105.6 MB in the end (delta: -21.3 MB). Peak memory consumption was 34.2 MB. Max. memory is 16.1 GB. * Witness Printer took 54.26 ms. Allocated memory is still 172.0 MB. Free memory was 105.6 MB in the beginning and 103.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * 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 - CounterExampleResult [Line: 1040]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1002] SLL* list = malloc(sizeof(SLL)); [L1003] list->next = ((void*)0) VAL [list={-1:0}] [L1004] COND FALSE !(!(list != ((void*)0))) VAL [list={-1:0}] [L1004] COND FALSE !(__VERIFIER_nondet_int()) [L1004] list->inner = malloc(sizeof(SLL)) VAL [list={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1004] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1004] list->inner->next = ((void*)0) VAL [list={-1:0}, list->inner={-2:0}] [L1004] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1004] list->inner->inner = ((void*)0) VAL [list={-1:0}, list->inner={-2:0}] [L1004] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1004] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={-1:0}, list->inner={-2:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1] [L1004] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1006] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1019] end = ((void*)0) [L1020] end = list VAL [end={-1:0}, list={-1:0}] [L1023] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1025] COND TRUE ((void*)0) != end [L1027] int len = 0; VAL [end={-1:0}, len=0, list={-1:0}] [L1028] EXPR end->inner VAL [end={-1:0}, end->inner={-2:0}, len=0, list={-1:0}] [L1028] SLL* inner = end->inner; [L1029] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={-2:0}, len=0, list={-1:0}] [L1031] COND TRUE len == 0 [L1032] len = 1 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1035] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1036] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}] [L1036] COND FALSE !(!(((void*)0) == inner->inner)) [L1037] EXPR inner->next VAL [end={-1:0}, inner={-2:0}, inner->next={0:0}, len=1, list={-1:0}] [L1037] COND FALSE !(!(((void*)0) == inner->next)) [L1038] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}] [L1038] inner = inner->inner [L1039] COND TRUE len == 1 VAL [end={-1:0}, inner={0:0}, len=1, list={-1:0}] [L1040] inner->inner - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1050]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1050]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1054]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 203 locations, 80 error locations. Started 1 CEGAR loops. OverallTime: 26.2s, OverallIterations: 38, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 5010 SDtfs, 6834 SDslu, 14758 SDs, 0 SdLazy, 16128 SolverSat, 483 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 593 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 373 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=319occurred in iteration=37, InterpolantAutomatonStates: 351, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 37 MinimizatonAttempts, 1401 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 1307 NumberOfCodeBlocks, 1307 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1220 ConstructedInterpolants, 3 QuantifiedInterpolants, 11356 SizeOfPredicates, 13 NumberOfNonLiveVariables, 583 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 40 InterpolantComputations, 34 PerfectInterpolantSequences, 12/19 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 RESULT: Ultimate proved your program to be incorrect! [2021-11-02 22:05:43,262 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7de13b67-f253-48f2-a2dd-980f8375db29/bin/uautomizer-tBqnrhUYjU/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)