./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-queue-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-queue-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9d0fe8819c9f9684711883fabc222e5491a603f3 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-queue-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9d0fe8819c9f9684711883fabc222e5491a603f3 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 03:36:30,590 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 03:36:30,593 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 03:36:30,679 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 03:36:30,680 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 03:36:30,691 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 03:36:30,694 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 03:36:30,700 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 03:36:30,703 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 03:36:30,713 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 03:36:30,715 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 03:36:30,718 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 03:36:30,718 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 03:36:30,723 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 03:36:30,725 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 03:36:30,728 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 03:36:30,729 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 03:36:30,735 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 03:36:30,739 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 03:36:30,747 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 03:36:30,750 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 03:36:30,751 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 03:36:30,754 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 03:36:30,756 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 03:36:30,763 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 03:36:30,763 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 03:36:30,764 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 03:36:30,766 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 03:36:30,766 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 03:36:30,768 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 03:36:30,768 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 03:36:30,770 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 03:36:30,772 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 03:36:30,774 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 03:36:30,775 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 03:36:30,776 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 03:36:30,777 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 03:36:30,777 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 03:36:30,777 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 03:36:30,779 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 03:36:30,780 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 03:36:30,783 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2020-11-30 03:36:30,834 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 03:36:30,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 03:36:30,836 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-30 03:36:30,837 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-30 03:36:30,837 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-30 03:36:30,837 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-30 03:36:30,838 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-30 03:36:30,838 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-30 03:36:30,838 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-30 03:36:30,839 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-30 03:36:30,840 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-30 03:36:30,840 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-30 03:36:30,841 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-30 03:36:30,841 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-30 03:36:30,841 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-30 03:36:30,842 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 03:36:30,842 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 03:36:30,843 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 03:36:30,843 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 03:36:30,843 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 03:36:30,844 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 03:36:30,844 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 03:36:30,844 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 03:36:30,845 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-11-30 03:36:30,845 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-11-30 03:36:30,845 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-11-30 03:36:30,846 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 03:36:30,846 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 03:36:30,846 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 03:36:30,846 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 03:36:30,847 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 03:36:30,847 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 03:36:30,848 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 03:36:30,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 03:36:30,848 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 03:36:30,849 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 03:36:30,849 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-30 03:36:30,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 03:36:30,849 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 03:36:30,850 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 03:36:30,850 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/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-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan 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 -> Taipan 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 -> 9d0fe8819c9f9684711883fabc222e5491a603f3 [2020-11-30 03:36:31,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 03:36:31,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 03:36:31,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 03:36:31,185 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 03:36:31,185 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 03:36:31,187 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/../../sv-benchmarks/c/forester-heap/dll-queue-1.i [2020-11-30 03:36:31,259 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/data/8d61847f5/aa3469b328fa4ab49769b64bf8ba2487/FLAG4b2c45b84 [2020-11-30 03:36:31,940 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 03:36:31,941 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/sv-benchmarks/c/forester-heap/dll-queue-1.i [2020-11-30 03:36:31,973 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/data/8d61847f5/aa3469b328fa4ab49769b64bf8ba2487/FLAG4b2c45b84 [2020-11-30 03:36:32,226 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/data/8d61847f5/aa3469b328fa4ab49769b64bf8ba2487 [2020-11-30 03:36:32,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 03:36:32,235 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 03:36:32,245 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 03:36:32,246 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 03:36:32,250 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 03:36:32,251 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:36:32" (1/1) ... [2020-11-30 03:36:32,253 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72146241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:36:32, skipping insertion in model container [2020-11-30 03:36:32,253 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:36:32" (1/1) ... [2020-11-30 03:36:32,262 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 03:36:32,310 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 03:36:32,718 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 03:36:32,728 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 03:36:32,794 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 03:36:32,870 INFO L208 MainTranslator]: Completed translation [2020-11-30 03:36:32,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:36:32 WrapperNode [2020-11-30 03:36:32,871 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 03:36:32,873 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 03:36:32,873 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 03:36:32,873 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 03:36:32,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:36:32" (1/1) ... [2020-11-30 03:36:32,924 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:36:32" (1/1) ... [2020-11-30 03:36:32,957 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 03:36:32,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 03:36:32,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 03:36:32,959 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 03:36:32,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:36:32" (1/1) ... [2020-11-30 03:36:32,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:36:32" (1/1) ... [2020-11-30 03:36:32,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:36:32" (1/1) ... [2020-11-30 03:36:32,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:36:32" (1/1) ... [2020-11-30 03:36:32,987 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:36:32" (1/1) ... [2020-11-30 03:36:32,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:36:32" (1/1) ... [2020-11-30 03:36:33,000 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:36:32" (1/1) ... [2020-11-30 03:36:33,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 03:36:33,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 03:36:33,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 03:36:33,023 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 03:36:33,024 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:36:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 03:36:33,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-30 03:36:33,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 03:36:33,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-30 03:36:33,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-30 03:36:33,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 03:36:33,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-30 03:36:33,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 03:36:33,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 03:36:33,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 03:36:33,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 03:36:34,334 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 03:36:34,335 INFO L298 CfgBuilder]: Removed 63 assume(true) statements. [2020-11-30 03:36:34,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:36:34 BoogieIcfgContainer [2020-11-30 03:36:34,338 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 03:36:34,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 03:36:34,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 03:36:34,344 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 03:36:34,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 03:36:32" (1/3) ... [2020-11-30 03:36:34,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ed45d5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:36:34, skipping insertion in model container [2020-11-30 03:36:34,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:36:32" (2/3) ... [2020-11-30 03:36:34,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ed45d5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:36:34, skipping insertion in model container [2020-11-30 03:36:34,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:36:34" (3/3) ... [2020-11-30 03:36:34,348 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-queue-1.i [2020-11-30 03:36:34,359 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 03:36:34,364 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 76 error locations. [2020-11-30 03:36:34,397 INFO L253 AbstractCegarLoop]: Starting to check reachability of 76 error locations. [2020-11-30 03:36:34,417 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 03:36:34,417 INFO L378 AbstractCegarLoop]: Hoare is false [2020-11-30 03:36:34,418 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 03:36:34,418 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 03:36:34,418 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 03:36:34,418 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 03:36:34,418 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 03:36:34,418 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 03:36:34,443 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states. [2020-11-30 03:36:34,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2020-11-30 03:36:34,452 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:36:34,453 INFO L422 BasicCegarLoop]: trace histogram [1, 1] [2020-11-30 03:36:34,457 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 03:36:34,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:36:34,464 INFO L82 PathProgramCache]: Analyzing trace with hash 17581, now seen corresponding path program 1 times [2020-11-30 03:36:34,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:36:34,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226229515] [2020-11-30 03:36:34,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:36:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:36:34,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:36:34,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226229515] [2020-11-30 03:36:34,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:36:34,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-30 03:36:34,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883959356] [2020-11-30 03:36:34,654 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 03:36:34,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:36:34,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 03:36:34,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 03:36:34,673 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 3 states. [2020-11-30 03:36:34,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:36:34,951 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2020-11-30 03:36:34,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 03:36:34,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2020-11-30 03:36:34,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:36:34,974 INFO L225 Difference]: With dead ends: 175 [2020-11-30 03:36:34,976 INFO L226 Difference]: Without dead ends: 173 [2020-11-30 03:36:34,980 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 03:36:35,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-11-30 03:36:35,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2020-11-30 03:36:35,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-11-30 03:36:35,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 181 transitions. [2020-11-30 03:36:35,075 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 181 transitions. Word has length 2 [2020-11-30 03:36:35,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:36:35,075 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 181 transitions. [2020-11-30 03:36:35,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 03:36:35,076 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 181 transitions. [2020-11-30 03:36:35,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2020-11-30 03:36:35,076 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:36:35,076 INFO L422 BasicCegarLoop]: trace histogram [1, 1] [2020-11-30 03:36:35,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 03:36:35,078 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 03:36:35,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:36:35,082 INFO L82 PathProgramCache]: Analyzing trace with hash 17582, now seen corresponding path program 1 times [2020-11-30 03:36:35,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:36:35,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161828865] [2020-11-30 03:36:35,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:36:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:36:35,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:36:35,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161828865] [2020-11-30 03:36:35,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:36:35,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-30 03:36:35,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337886902] [2020-11-30 03:36:35,170 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 03:36:35,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:36:35,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 03:36:35,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 03:36:35,172 INFO L87 Difference]: Start difference. First operand 170 states and 181 transitions. Second operand 3 states. [2020-11-30 03:36:35,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:36:35,344 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2020-11-30 03:36:35,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 03:36:35,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2020-11-30 03:36:35,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:36:35,347 INFO L225 Difference]: With dead ends: 161 [2020-11-30 03:36:35,347 INFO L226 Difference]: Without dead ends: 161 [2020-11-30 03:36:35,348 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 03:36:35,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-11-30 03:36:35,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2020-11-30 03:36:35,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-11-30 03:36:35,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2020-11-30 03:36:35,370 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 169 transitions. Word has length 2 [2020-11-30 03:36:35,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:36:35,371 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 169 transitions. [2020-11-30 03:36:35,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 03:36:35,371 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2020-11-30 03:36:35,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-30 03:36:35,372 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:36:35,373 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:36:35,373 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 03:36:35,377 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 03:36:35,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:36:35,380 INFO L82 PathProgramCache]: Analyzing trace with hash 810946257, now seen corresponding path program 1 times [2020-11-30 03:36:35,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:36:35,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293545456] [2020-11-30 03:36:35,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:36:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:36:35,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:36:35,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293545456] [2020-11-30 03:36:35,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:36:35,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 03:36:35,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86164747] [2020-11-30 03:36:35,519 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 03:36:35,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:36:35,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 03:36:35,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 03:36:35,520 INFO L87 Difference]: Start difference. First operand 159 states and 169 transitions. Second operand 4 states. [2020-11-30 03:36:35,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:36:35,743 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2020-11-30 03:36:35,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 03:36:35,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-11-30 03:36:35,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:36:35,747 INFO L225 Difference]: With dead ends: 167 [2020-11-30 03:36:35,747 INFO L226 Difference]: Without dead ends: 167 [2020-11-30 03:36:35,747 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 03:36:35,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2020-11-30 03:36:35,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 159. [2020-11-30 03:36:35,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-11-30 03:36:35,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 173 transitions. [2020-11-30 03:36:35,765 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 173 transitions. Word has length 7 [2020-11-30 03:36:35,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:36:35,766 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 173 transitions. [2020-11-30 03:36:35,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 03:36:35,766 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 173 transitions. [2020-11-30 03:36:35,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-30 03:36:35,766 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:36:35,766 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:36:35,767 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 03:36:35,767 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 03:36:35,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:36:35,768 INFO L82 PathProgramCache]: Analyzing trace with hash 810946258, now seen corresponding path program 1 times [2020-11-30 03:36:35,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:36:35,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001675121] [2020-11-30 03:36:35,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:36:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:36:35,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:36:35,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001675121] [2020-11-30 03:36:35,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:36:35,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 03:36:35,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084659647] [2020-11-30 03:36:35,864 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 03:36:35,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:36:35,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 03:36:35,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 03:36:35,865 INFO L87 Difference]: Start difference. First operand 159 states and 173 transitions. Second operand 4 states. [2020-11-30 03:36:36,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:36:36,130 INFO L93 Difference]: Finished difference Result 260 states and 275 transitions. [2020-11-30 03:36:36,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 03:36:36,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-11-30 03:36:36,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:36:36,132 INFO L225 Difference]: With dead ends: 260 [2020-11-30 03:36:36,133 INFO L226 Difference]: Without dead ends: 260 [2020-11-30 03:36:36,133 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 03:36:36,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2020-11-30 03:36:36,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 165. [2020-11-30 03:36:36,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-11-30 03:36:36,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 181 transitions. [2020-11-30 03:36:36,150 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 181 transitions. Word has length 7 [2020-11-30 03:36:36,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:36:36,150 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 181 transitions. [2020-11-30 03:36:36,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 03:36:36,151 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 181 transitions. [2020-11-30 03:36:36,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-30 03:36:36,151 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:36:36,151 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:36:36,152 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 03:36:36,152 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 03:36:36,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:36:36,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1930312055, now seen corresponding path program 1 times [2020-11-30 03:36:36,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:36:36,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338286510] [2020-11-30 03:36:36,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:36:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:36:36,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:36:36,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338286510] [2020-11-30 03:36:36,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:36:36,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 03:36:36,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851954826] [2020-11-30 03:36:36,213 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 03:36:36,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:36:36,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 03:36:36,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 03:36:36,214 INFO L87 Difference]: Start difference. First operand 165 states and 181 transitions. Second operand 3 states. [2020-11-30 03:36:36,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:36:36,275 INFO L93 Difference]: Finished difference Result 150 states and 165 transitions. [2020-11-30 03:36:36,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 03:36:36,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-30 03:36:36,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:36:36,276 INFO L225 Difference]: With dead ends: 150 [2020-11-30 03:36:36,277 INFO L226 Difference]: Without dead ends: 150 [2020-11-30 03:36:36,277 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 03:36:36,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2020-11-30 03:36:36,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2020-11-30 03:36:36,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-11-30 03:36:36,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2020-11-30 03:36:36,302 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 9 [2020-11-30 03:36:36,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:36:36,302 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2020-11-30 03:36:36,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 03:36:36,302 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2020-11-30 03:36:36,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-30 03:36:36,303 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:36:36,303 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:36:36,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 03:36:36,304 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 03:36:36,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:36:36,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1930272276, now seen corresponding path program 1 times [2020-11-30 03:36:36,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:36:36,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006803375] [2020-11-30 03:36:36,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:36:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:36:36,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:36:36,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006803375] [2020-11-30 03:36:36,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:36:36,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 03:36:36,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069238983] [2020-11-30 03:36:36,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 03:36:36,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:36:36,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 03:36:36,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 03:36:36,370 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 5 states. [2020-11-30 03:36:36,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:36:36,652 INFO L93 Difference]: Finished difference Result 248 states and 269 transitions. [2020-11-30 03:36:36,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 03:36:36,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-11-30 03:36:36,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:36:36,654 INFO L225 Difference]: With dead ends: 248 [2020-11-30 03:36:36,654 INFO L226 Difference]: Without dead ends: 248 [2020-11-30 03:36:36,654 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-30 03:36:36,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2020-11-30 03:36:36,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 149. [2020-11-30 03:36:36,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-11-30 03:36:36,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 163 transitions. [2020-11-30 03:36:36,672 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 163 transitions. Word has length 9 [2020-11-30 03:36:36,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:36:36,675 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 163 transitions. [2020-11-30 03:36:36,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 03:36:36,675 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 163 transitions. [2020-11-30 03:36:36,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-30 03:36:36,675 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:36:36,676 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:36:36,677 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 03:36:36,678 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 03:36:36,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:36:36,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1930272277, now seen corresponding path program 1 times [2020-11-30 03:36:36,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:36:36,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243758214] [2020-11-30 03:36:36,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:36:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:36:36,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:36:36,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243758214] [2020-11-30 03:36:36,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:36:36,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 03:36:36,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919927489] [2020-11-30 03:36:36,759 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 03:36:36,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:36:36,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 03:36:36,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 03:36:36,760 INFO L87 Difference]: Start difference. First operand 149 states and 163 transitions. Second operand 5 states. [2020-11-30 03:36:37,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:36:37,073 INFO L93 Difference]: Finished difference Result 258 states and 279 transitions. [2020-11-30 03:36:37,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 03:36:37,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-11-30 03:36:37,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:36:37,076 INFO L225 Difference]: With dead ends: 258 [2020-11-30 03:36:37,076 INFO L226 Difference]: Without dead ends: 258 [2020-11-30 03:36:37,076 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-30 03:36:37,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2020-11-30 03:36:37,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 148. [2020-11-30 03:36:37,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-11-30 03:36:37,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 161 transitions. [2020-11-30 03:36:37,085 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 161 transitions. Word has length 9 [2020-11-30 03:36:37,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:36:37,085 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 161 transitions. [2020-11-30 03:36:37,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 03:36:37,086 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 161 transitions. [2020-11-30 03:36:37,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-30 03:36:37,086 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:36:37,087 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:36:37,087 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-30 03:36:37,087 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 03:36:37,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:36:37,088 INFO L82 PathProgramCache]: Analyzing trace with hash -433709484, now seen corresponding path program 1 times [2020-11-30 03:36:37,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:36:37,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990768529] [2020-11-30 03:36:37,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:36:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:36:37,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:36:37,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990768529] [2020-11-30 03:36:37,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:36:37,259 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 03:36:37,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543300961] [2020-11-30 03:36:37,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 03:36:37,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:36:37,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 03:36:37,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-11-30 03:36:37,260 INFO L87 Difference]: Start difference. First operand 148 states and 161 transitions. Second operand 8 states. [2020-11-30 03:36:37,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:36:37,657 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2020-11-30 03:36:37,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 03:36:37,657 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2020-11-30 03:36:37,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:36:37,659 INFO L225 Difference]: With dead ends: 152 [2020-11-30 03:36:37,659 INFO L226 Difference]: Without dead ends: 152 [2020-11-30 03:36:37,660 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-11-30 03:36:37,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-11-30 03:36:37,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 147. [2020-11-30 03:36:37,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-11-30 03:36:37,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 160 transitions. [2020-11-30 03:36:37,665 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 160 transitions. Word has length 11 [2020-11-30 03:36:37,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:36:37,666 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 160 transitions. [2020-11-30 03:36:37,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 03:36:37,667 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 160 transitions. [2020-11-30 03:36:37,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-30 03:36:37,668 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:36:37,668 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:36:37,668 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 03:36:37,669 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 03:36:37,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:36:37,669 INFO L82 PathProgramCache]: Analyzing trace with hash -433709483, now seen corresponding path program 1 times [2020-11-30 03:36:37,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:36:37,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753692665] [2020-11-30 03:36:37,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:36:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:36:37,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:36:37,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753692665] [2020-11-30 03:36:37,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:36:37,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 03:36:37,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738171202] [2020-11-30 03:36:37,862 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 03:36:37,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:36:37,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 03:36:37,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-11-30 03:36:37,863 INFO L87 Difference]: Start difference. First operand 147 states and 160 transitions. Second operand 9 states. [2020-11-30 03:36:38,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:36:38,687 INFO L93 Difference]: Finished difference Result 220 states and 233 transitions. [2020-11-30 03:36:38,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-30 03:36:38,688 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2020-11-30 03:36:38,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:36:38,689 INFO L225 Difference]: With dead ends: 220 [2020-11-30 03:36:38,689 INFO L226 Difference]: Without dead ends: 220 [2020-11-30 03:36:38,689 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2020-11-30 03:36:38,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2020-11-30 03:36:38,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 134. [2020-11-30 03:36:38,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-11-30 03:36:38,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2020-11-30 03:36:38,698 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 11 [2020-11-30 03:36:38,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:36:38,699 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2020-11-30 03:36:38,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 03:36:38,700 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2020-11-30 03:36:38,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-30 03:36:38,701 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:36:38,701 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:36:38,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 03:36:38,702 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 03:36:38,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:36:38,709 INFO L82 PathProgramCache]: Analyzing trace with hash 617277330, now seen corresponding path program 1 times [2020-11-30 03:36:38,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:36:38,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211590512] [2020-11-30 03:36:38,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:36:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:36:38,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:36:38,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211590512] [2020-11-30 03:36:38,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:36:38,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 03:36:38,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413516349] [2020-11-30 03:36:38,761 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 03:36:38,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:36:38,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 03:36:38,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 03:36:38,762 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand 3 states. [2020-11-30 03:36:38,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:36:38,814 INFO L93 Difference]: Finished difference Result 183 states and 201 transitions. [2020-11-30 03:36:38,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 03:36:38,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-11-30 03:36:38,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:36:38,817 INFO L225 Difference]: With dead ends: 183 [2020-11-30 03:36:38,817 INFO L226 Difference]: Without dead ends: 183 [2020-11-30 03:36:38,817 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 03:36:38,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2020-11-30 03:36:38,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 147. [2020-11-30 03:36:38,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-11-30 03:36:38,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 160 transitions. [2020-11-30 03:36:38,822 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 160 transitions. Word has length 15 [2020-11-30 03:36:38,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:36:38,823 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 160 transitions. [2020-11-30 03:36:38,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 03:36:38,823 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 160 transitions. [2020-11-30 03:36:38,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-30 03:36:38,825 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:36:38,825 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:36:38,826 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-30 03:36:38,826 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 03:36:38,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:36:38,826 INFO L82 PathProgramCache]: Analyzing trace with hash 403446922, now seen corresponding path program 1 times [2020-11-30 03:36:38,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:36:38,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687415497] [2020-11-30 03:36:38,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:36:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:36:38,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:36:38,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687415497] [2020-11-30 03:36:38,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:36:38,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 03:36:38,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092343730] [2020-11-30 03:36:38,934 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 03:36:38,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:36:38,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 03:36:38,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 03:36:38,935 INFO L87 Difference]: Start difference. First operand 147 states and 160 transitions. Second operand 5 states. [2020-11-30 03:36:39,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:36:39,100 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2020-11-30 03:36:39,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 03:36:39,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-11-30 03:36:39,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:36:39,101 INFO L225 Difference]: With dead ends: 152 [2020-11-30 03:36:39,101 INFO L226 Difference]: Without dead ends: 152 [2020-11-30 03:36:39,102 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-30 03:36:39,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-11-30 03:36:39,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2020-11-30 03:36:39,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-11-30 03:36:39,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 163 transitions. [2020-11-30 03:36:39,106 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 163 transitions. Word has length 17 [2020-11-30 03:36:39,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:36:39,106 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 163 transitions. [2020-11-30 03:36:39,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 03:36:39,106 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 163 transitions. [2020-11-30 03:36:39,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-30 03:36:39,107 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:36:39,107 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:36:39,107 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-30 03:36:39,107 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 03:36:39,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:36:39,108 INFO L82 PathProgramCache]: Analyzing trace with hash -378425913, now seen corresponding path program 1 times [2020-11-30 03:36:39,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:36:39,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231593896] [2020-11-30 03:36:39,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:36:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:36:39,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:36:39,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231593896] [2020-11-30 03:36:39,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:36:39,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 03:36:39,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806232169] [2020-11-30 03:36:39,173 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 03:36:39,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:36:39,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 03:36:39,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 03:36:39,173 INFO L87 Difference]: Start difference. First operand 150 states and 163 transitions. Second operand 4 states. [2020-11-30 03:36:39,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:36:39,288 INFO L93 Difference]: Finished difference Result 150 states and 162 transitions. [2020-11-30 03:36:39,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 03:36:39,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-11-30 03:36:39,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:36:39,290 INFO L225 Difference]: With dead ends: 150 [2020-11-30 03:36:39,290 INFO L226 Difference]: Without dead ends: 150 [2020-11-30 03:36:39,291 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 03:36:39,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2020-11-30 03:36:39,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2020-11-30 03:36:39,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-11-30 03:36:39,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 162 transitions. [2020-11-30 03:36:39,298 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 162 transitions. Word has length 18 [2020-11-30 03:36:39,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:36:39,298 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 162 transitions. [2020-11-30 03:36:39,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 03:36:39,298 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 162 transitions. [2020-11-30 03:36:39,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-30 03:36:39,301 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:36:39,301 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:36:39,301 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-30 03:36:39,302 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 03:36:39,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:36:39,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1530424475, now seen corresponding path program 1 times [2020-11-30 03:36:39,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:36:39,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024041708] [2020-11-30 03:36:39,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:36:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:36:39,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:36:39,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024041708] [2020-11-30 03:36:39,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:36:39,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-30 03:36:39,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255936460] [2020-11-30 03:36:39,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 03:36:39,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:36:39,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 03:36:39,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-11-30 03:36:39,407 INFO L87 Difference]: Start difference. First operand 150 states and 162 transitions. Second operand 9 states. [2020-11-30 03:36:39,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:36:39,913 INFO L93 Difference]: Finished difference Result 151 states and 161 transitions. [2020-11-30 03:36:39,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-30 03:36:39,914 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-11-30 03:36:39,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:36:39,915 INFO L225 Difference]: With dead ends: 151 [2020-11-30 03:36:39,915 INFO L226 Difference]: Without dead ends: 151 [2020-11-30 03:36:39,916 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2020-11-30 03:36:39,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-11-30 03:36:39,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2020-11-30 03:36:39,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-11-30 03:36:39,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 159 transitions. [2020-11-30 03:36:39,920 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 159 transitions. Word has length 18 [2020-11-30 03:36:39,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:36:39,920 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 159 transitions. [2020-11-30 03:36:39,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 03:36:39,921 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 159 transitions. [2020-11-30 03:36:39,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-30 03:36:39,921 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:36:39,921 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:36:39,922 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-30 03:36:39,922 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 03:36:39,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:36:39,922 INFO L82 PathProgramCache]: Analyzing trace with hash 603329608, now seen corresponding path program 1 times [2020-11-30 03:36:39,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:36:39,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996669717] [2020-11-30 03:36:39,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:36:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:36:40,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:36:40,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996669717] [2020-11-30 03:36:40,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957181685] [2020-11-30 03:36:40,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:36:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:36:40,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 11 conjunts are in the unsatisfiable core [2020-11-30 03:36:40,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:36:40,288 INFO L384 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 [2020-11-30 03:36:40,288 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:36:40,322 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:36:40,327 INFO L384 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 [2020-11-30 03:36:40,327 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:36:40,340 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:36:40,341 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:36:40,341 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2020-11-30 03:36:40,368 INFO L384 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 0 case distinctions, treesize of input 26 treesize of output 21 [2020-11-30 03:36:40,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:36:40,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:36:40,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:36:40,383 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 20 [2020-11-30 03:36:40,385 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:36:40,392 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:36:40,392 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:36:40,409 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:36:40,416 INFO L384 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 0 case distinctions, treesize of input 26 treesize of output 21 [2020-11-30 03:36:40,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:36:40,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:36:40,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:36:40,427 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 20 [2020-11-30 03:36:40,428 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-30 03:36:40,434 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:36:40,434 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:36:40,444 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:36:40,445 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:36:40,445 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:33 [2020-11-30 03:36:40,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:36:40,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:36:40,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:36:40,481 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2020-11-30 03:36:40,483 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:36:40,498 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:36:40,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:36:40,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:36:40,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:36:40,508 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2020-11-30 03:36:40,509 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:36:40,519 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:36:40,520 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:36:40,520 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:71, output treesize:33 [2020-11-30 03:36:40,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:36:40,559 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2020-11-30 03:36:40,561 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:36:40,570 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:36:40,587 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-11-30 03:36:40,587 INFO L384 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 24 treesize of output 10 [2020-11-30 03:36:40,589 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:36:40,627 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:36:40,627 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:36:40,628 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2020-11-30 03:36:40,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:36:40,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:36:40,645 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:36:40,660 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:36:40,663 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:36:40,681 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:36:40,685 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-30 03:36:40,688 INFO L545 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:36:40,695 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:36:40,696 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-11-30 03:36:40,696 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:107, output treesize:35 [2020-11-30 03:36:40,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:36:40,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [893821188] [2020-11-30 03:36:40,745 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2020-11-30 03:36:40,746 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 03:36:40,751 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-11-30 03:36:40,757 INFO L176 IcfgInterpreter]: Starting interpretation [2020-11-30 03:36:40,758 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-11-30 03:36:41,350 WARN L220 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:36:41,482 WARN L220 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:36:41,718 INFO L180 IcfgInterpreter]: Interpretation finished [2020-11-30 03:36:41,936 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2020-11-30 03:36:42,184 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2020-11-30 03:36:42,478 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2020-11-30 03:36:42,854 WARN L193 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2020-11-30 03:36:43,248 WARN L193 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 95 [2020-11-30 03:36:43,928 WARN L193 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 89 [2020-11-30 03:36:44,390 WARN L193 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 91 [2020-11-30 03:36:44,960 WARN L193 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 86 [2020-11-30 03:36:45,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2020-11-30 03:36:45,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [4, 5, 4] total 14 [2020-11-30 03:36:45,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405875898] [2020-11-30 03:36:45,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-30 03:36:45,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:36:45,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-30 03:36:45,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-11-30 03:36:45,143 INFO L87 Difference]: Start difference. First operand 147 states and 159 transitions. Second operand 11 states. [2020-11-30 03:36:45,417 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2020-11-30 03:36:45,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:36:45,915 INFO L93 Difference]: Finished difference Result 159 states and 171 transitions. [2020-11-30 03:36:45,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-30 03:36:45,916 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-11-30 03:36:45,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:36:45,917 INFO L225 Difference]: With dead ends: 159 [2020-11-30 03:36:45,917 INFO L226 Difference]: Without dead ends: 159 [2020-11-30 03:36:45,917 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 41 SyntacticMatches, 14 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2020-11-30 03:36:45,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-11-30 03:36:45,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 153. [2020-11-30 03:36:45,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-11-30 03:36:45,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 166 transitions. [2020-11-30 03:36:45,923 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 166 transitions. Word has length 21 [2020-11-30 03:36:45,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:36:45,923 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 166 transitions. [2020-11-30 03:36:45,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-30 03:36:45,924 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 166 transitions. [2020-11-30 03:36:45,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-30 03:36:45,924 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:36:45,925 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:36:46,151 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-11-30 03:36:46,151 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 03:36:46,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:36:46,152 INFO L82 PathProgramCache]: Analyzing trace with hash 603330614, now seen corresponding path program 1 times [2020-11-30 03:36:46,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:36:46,152 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246038712] [2020-11-30 03:36:46,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:36:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:36:46,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:36:46,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246038712] [2020-11-30 03:36:46,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846169673] [2020-11-30 03:36:46,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:36:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:36:46,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-30 03:36:46,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:36:46,570 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2020-11-30 03:36:46,735 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 31 [2020-11-30 03:36:46,945 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2020-11-30 03:36:47,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:36:47,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:36:47,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:36:47,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1493008297] [2020-11-30 03:36:47,771 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2020-11-30 03:36:47,771 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 03:36:47,772 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-11-30 03:36:47,772 INFO L176 IcfgInterpreter]: Starting interpretation [2020-11-30 03:36:47,772 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-11-30 03:36:48,233 WARN L220 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:36:48,296 WARN L220 Elim1Store]: Array PQE input equivalent to false [2020-11-30 03:36:48,588 INFO L180 IcfgInterpreter]: Interpretation finished [2020-11-30 03:36:48,919 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2020-11-30 03:36:49,169 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2020-11-30 03:36:49,495 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2020-11-30 03:36:49,823 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2020-11-30 03:36:50,120 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 95 [2020-11-30 03:36:50,770 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 89 [2020-11-30 03:36:51,227 WARN L193 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 91 [2020-11-30 03:36:51,861 WARN L193 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 86 [2020-11-30 03:36:52,136 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-11-30 03:36:52,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 03:36:52,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 8 [2020-11-30 03:36:52,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259087887] [2020-11-30 03:36:52,138 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 03:36:52,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:36:52,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 03:36:52,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2020-11-30 03:36:52,139 INFO L87 Difference]: Start difference. First operand 153 states and 166 transitions. Second operand 10 states. [2020-11-30 03:36:53,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:36:53,151 INFO L93 Difference]: Finished difference Result 174 states and 187 transitions. [2020-11-30 03:36:53,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 03:36:53,152 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-11-30 03:36:53,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:36:53,153 INFO L225 Difference]: With dead ends: 174 [2020-11-30 03:36:53,153 INFO L226 Difference]: Without dead ends: 172 [2020-11-30 03:36:53,154 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 24 SyntacticMatches, 21 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2020-11-30 03:36:53,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-11-30 03:36:53,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 159. [2020-11-30 03:36:53,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-11-30 03:36:53,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 172 transitions. [2020-11-30 03:36:53,164 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 172 transitions. Word has length 21 [2020-11-30 03:36:53,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:36:53,165 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 172 transitions. [2020-11-30 03:36:53,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 03:36:53,165 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 172 transitions. [2020-11-30 03:36:53,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-30 03:36:53,167 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:36:53,167 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:36:53,368 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2020-11-30 03:36:53,368 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 03:36:53,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:36:53,369 INFO L82 PathProgramCache]: Analyzing trace with hash -907109701, now seen corresponding path program 2 times [2020-11-30 03:36:53,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:36:53,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656420388] [2020-11-30 03:36:53,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:36:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:36:53,456 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:36:53,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656420388] [2020-11-30 03:36:53,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119073782] [2020-11-30 03:36:53,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:36:53,560 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-11-30 03:36:53,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 03:36:53,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 03:36:53,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:36:53,712 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:36:53,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:36:53,773 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:36:53,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [563950356] [2020-11-30 03:36:53,776 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2020-11-30 03:36:53,777 INFO L166 IcfgInterpreter]: Building call graph [2020-11-30 03:36:53,777 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-11-30 03:36:53,777 INFO L176 IcfgInterpreter]: Starting interpretation [2020-11-30 03:36:53,777 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-11-30 03:36:54,394 INFO L180 IcfgInterpreter]: Interpretation finished [2020-11-30 03:36:54,719 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2020-11-30 03:36:54,986 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2020-11-30 03:36:55,241 WARN L193 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2020-11-30 03:36:55,522 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2020-11-30 03:36:55,862 WARN L193 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 95 [2020-11-30 03:36:56,403 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 89 [2020-11-30 03:36:56,757 WARN L193 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 91 [2020-11-30 03:36:57,305 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 86 [2020-11-30 03:36:57,759 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-11-30 03:36:57,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-11-30 03:36:57,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 6] total 10 [2020-11-30 03:36:57,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737773445] [2020-11-30 03:36:57,760 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 03:36:57,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-30 03:36:57,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 03:36:57,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2020-11-30 03:36:57,760 INFO L87 Difference]: Start difference. First operand 159 states and 172 transitions. Second operand 10 states. [2020-11-30 03:36:58,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:36:58,067 INFO L93 Difference]: Finished difference Result 154 states and 165 transitions. [2020-11-30 03:36:58,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 03:36:58,074 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-11-30 03:36:58,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:36:58,076 INFO L225 Difference]: With dead ends: 154 [2020-11-30 03:36:58,076 INFO L226 Difference]: Without dead ends: 140 [2020-11-30 03:36:58,076 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 48 SyntacticMatches, 15 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2020-11-30 03:36:58,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-11-30 03:36:58,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2020-11-30 03:36:58,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-11-30 03:36:58,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 151 transitions. [2020-11-30 03:36:58,081 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 151 transitions. Word has length 26 [2020-11-30 03:36:58,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:36:58,082 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 151 transitions. [2020-11-30 03:36:58,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 03:36:58,082 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 151 transitions. [2020-11-30 03:36:58,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-30 03:36:58,083 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:36:58,083 INFO L422 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] [2020-11-30 03:36:58,307 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:36:58,307 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 03:36:58,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:36:58,308 INFO L82 PathProgramCache]: Analyzing trace with hash 955933834, now seen corresponding path program 1 times [2020-11-30 03:36:58,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 03:36:58,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328628363] [2020-11-30 03:36:58,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 03:36:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:36:58,381 ERROR L253 erpolLogProxyWrapper]: Interpolant 9 not inductive [2020-11-30 03:36:58,395 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2020-11-30 03:36:58,396 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:219) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:876) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:343) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:343) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:197) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:283) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:295) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:231) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:241) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-11-30 03:36:58,407 INFO L168 Benchmark]: Toolchain (without parser) took 26171.84 ms. Allocated memory was 104.9 MB in the beginning and 272.6 MB in the end (delta: 167.8 MB). Free memory was 79.0 MB in the beginning and 144.2 MB in the end (delta: -65.2 MB). Peak memory consumption was 102.6 MB. Max. memory is 16.1 GB. [2020-11-30 03:36:58,408 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 104.9 MB. Free memory was 63.8 MB in the beginning and 63.7 MB in the end (delta: 56.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 03:36:58,408 INFO L168 Benchmark]: CACSL2BoogieTranslator took 626.62 ms. Allocated memory is still 104.9 MB. Free memory was 78.8 MB in the beginning and 69.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 03:36:58,409 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.04 ms. Allocated memory is still 104.9 MB. Free memory was 69.3 MB in the beginning and 66.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 03:36:58,409 INFO L168 Benchmark]: Boogie Preprocessor took 63.03 ms. Allocated memory is still 104.9 MB. Free memory was 66.5 MB in the beginning and 64.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 03:36:58,410 INFO L168 Benchmark]: RCFGBuilder took 1315.72 ms. Allocated memory was 104.9 MB in the beginning and 148.9 MB in the end (delta: 44.0 MB). Free memory was 64.2 MB in the beginning and 77.4 MB in the end (delta: -13.1 MB). Peak memory consumption was 32.2 MB. Max. memory is 16.1 GB. [2020-11-30 03:36:58,410 INFO L168 Benchmark]: TraceAbstraction took 24066.65 ms. Allocated memory was 148.9 MB in the beginning and 272.6 MB in the end (delta: 123.7 MB). Free memory was 76.8 MB in the beginning and 144.2 MB in the end (delta: -67.4 MB). Peak memory consumption was 54.8 MB. Max. memory is 16.1 GB. [2020-11-30 03:36:58,413 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.32 ms. Allocated memory is still 104.9 MB. Free memory was 63.8 MB in the beginning and 63.7 MB in the end (delta: 56.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 626.62 ms. Allocated memory is still 104.9 MB. Free memory was 78.8 MB in the beginning and 69.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 85.04 ms. Allocated memory is still 104.9 MB. Free memory was 69.3 MB in the beginning and 66.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 63.03 ms. Allocated memory is still 104.9 MB. Free memory was 66.5 MB in the beginning and 64.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1315.72 ms. Allocated memory was 104.9 MB in the beginning and 148.9 MB in the end (delta: 44.0 MB). Free memory was 64.2 MB in the beginning and 77.4 MB in the end (delta: -13.1 MB). Peak memory consumption was 32.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 24066.65 ms. Allocated memory was 148.9 MB in the beginning and 272.6 MB in the end (delta: 123.7 MB). Free memory was 76.8 MB in the beginning and 144.2 MB in the end (delta: -67.4 MB). Peak memory consumption was 54.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:219) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-a4ecdab [2020-11-30 03:37:01,480 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 03:37:01,483 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 03:37:01,542 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 03:37:01,543 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 03:37:01,549 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 03:37:01,554 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 03:37:01,559 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 03:37:01,564 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 03:37:01,572 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 03:37:01,574 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 03:37:01,576 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 03:37:01,577 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 03:37:01,578 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 03:37:01,580 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 03:37:01,582 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 03:37:01,583 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 03:37:01,584 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 03:37:01,587 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 03:37:01,590 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 03:37:01,592 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 03:37:01,594 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 03:37:01,596 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 03:37:01,598 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 03:37:01,602 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 03:37:01,603 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 03:37:01,603 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 03:37:01,605 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 03:37:01,606 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 03:37:01,607 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 03:37:01,608 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 03:37:01,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 03:37:01,617 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 03:37:01,618 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 03:37:01,620 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 03:37:01,621 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 03:37:01,622 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 03:37:01,622 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 03:37:01,623 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 03:37:01,625 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 03:37:01,626 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 03:37:01,627 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2020-11-30 03:37:01,662 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 03:37:01,663 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 03:37:01,664 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-30 03:37:01,665 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-30 03:37:01,665 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-30 03:37:01,666 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-30 03:37:01,666 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-30 03:37:01,667 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-30 03:37:01,667 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-30 03:37:01,668 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 03:37:01,669 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 03:37:01,669 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 03:37:01,670 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 03:37:01,670 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-11-30 03:37:01,676 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 03:37:01,677 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 03:37:01,677 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 03:37:01,678 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-11-30 03:37:01,678 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-11-30 03:37:01,678 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-11-30 03:37:01,679 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 03:37:01,679 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 03:37:01,680 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-11-30 03:37:01,680 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-11-30 03:37:01,681 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 03:37:01,682 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 03:37:01,683 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 03:37:01,684 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 03:37:01,684 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 03:37:01,685 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 03:37:01,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 03:37:01,686 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 03:37:01,686 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 03:37:01,687 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-11-30 03:37:01,687 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-11-30 03:37:01,687 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 03:37:01,689 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 03:37:01,689 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/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-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan 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 -> Taipan 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 -> 9d0fe8819c9f9684711883fabc222e5491a603f3 [2020-11-30 03:37:02,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 03:37:02,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 03:37:02,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 03:37:02,235 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 03:37:02,236 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 03:37:02,237 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/../../sv-benchmarks/c/forester-heap/dll-queue-1.i [2020-11-30 03:37:02,316 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/data/be51001ae/e1190c659c08449bab1b57d15872181e/FLAGb3b4d89dc [2020-11-30 03:37:03,099 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 03:37:03,101 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/sv-benchmarks/c/forester-heap/dll-queue-1.i [2020-11-30 03:37:03,127 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/data/be51001ae/e1190c659c08449bab1b57d15872181e/FLAGb3b4d89dc [2020-11-30 03:37:03,312 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/data/be51001ae/e1190c659c08449bab1b57d15872181e [2020-11-30 03:37:03,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 03:37:03,318 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 03:37:03,320 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 03:37:03,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 03:37:03,325 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 03:37:03,326 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:37:03" (1/1) ... [2020-11-30 03:37:03,328 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61fcb0a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:37:03, skipping insertion in model container [2020-11-30 03:37:03,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:37:03" (1/1) ... [2020-11-30 03:37:03,338 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 03:37:03,427 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 03:37:03,898 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 03:37:03,940 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 03:37:04,013 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 03:37:04,097 INFO L208 MainTranslator]: Completed translation [2020-11-30 03:37:04,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:37:04 WrapperNode [2020-11-30 03:37:04,099 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 03:37:04,101 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 03:37:04,101 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 03:37:04,102 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 03:37:04,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:37:04" (1/1) ... [2020-11-30 03:37:04,153 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:37:04" (1/1) ... [2020-11-30 03:37:04,196 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 03:37:04,197 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 03:37:04,197 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 03:37:04,197 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 03:37:04,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:37:04" (1/1) ... [2020-11-30 03:37:04,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:37:04" (1/1) ... [2020-11-30 03:37:04,214 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:37:04" (1/1) ... [2020-11-30 03:37:04,215 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:37:04" (1/1) ... [2020-11-30 03:37:04,237 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:37:04" (1/1) ... [2020-11-30 03:37:04,251 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:37:04" (1/1) ... [2020-11-30 03:37:04,255 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:37:04" (1/1) ... [2020-11-30 03:37:04,262 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 03:37:04,263 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 03:37:04,263 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 03:37:04,264 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 03:37:04,265 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:37:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 03:37:04,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-11-30 03:37:04,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-30 03:37:04,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-30 03:37:04,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 03:37:04,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-30 03:37:04,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 03:37:04,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-11-30 03:37:04,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-11-30 03:37:04,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 03:37:04,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 03:37:05,839 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 03:37:05,840 INFO L298 CfgBuilder]: Removed 63 assume(true) statements. [2020-11-30 03:37:05,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:37:05 BoogieIcfgContainer [2020-11-30 03:37:05,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 03:37:05,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 03:37:05,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 03:37:05,849 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 03:37:05,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 03:37:03" (1/3) ... [2020-11-30 03:37:05,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@93caeea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:37:05, skipping insertion in model container [2020-11-30 03:37:05,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:37:04" (2/3) ... [2020-11-30 03:37:05,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@93caeea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:37:05, skipping insertion in model container [2020-11-30 03:37:05,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:37:05" (3/3) ... [2020-11-30 03:37:05,853 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-queue-1.i [2020-11-30 03:37:05,866 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 03:37:05,871 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 76 error locations. [2020-11-30 03:37:05,885 INFO L253 AbstractCegarLoop]: Starting to check reachability of 76 error locations. [2020-11-30 03:37:05,907 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 03:37:05,907 INFO L378 AbstractCegarLoop]: Hoare is false [2020-11-30 03:37:05,907 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 03:37:05,907 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 03:37:05,907 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 03:37:05,908 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 03:37:05,908 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 03:37:05,908 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 03:37:05,931 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states. [2020-11-30 03:37:05,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-11-30 03:37:05,938 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:37:05,939 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-11-30 03:37:05,940 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 03:37:05,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:37:05,947 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2020-11-30 03:37:05,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:37:05,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478417078] [2020-11-30 03:37:05,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-11-30 03:37:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:37:06,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 03:37:06,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:37:06,161 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-11-30 03:37:06,161 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:06,170 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:06,170 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:06,171 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 03:37:06,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:06,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:37:06,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:06,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478417078] [2020-11-30 03:37:06,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:37:06,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-11-30 03:37:06,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634722645] [2020-11-30 03:37:06,201 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 03:37:06,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 03:37:06,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 03:37:06,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 03:37:06,225 INFO L87 Difference]: Start difference. First operand 205 states. Second operand 3 states. [2020-11-30 03:37:06,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:37:06,942 INFO L93 Difference]: Finished difference Result 188 states and 197 transitions. [2020-11-30 03:37:06,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 03:37:06,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-11-30 03:37:06,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:37:06,961 INFO L225 Difference]: With dead ends: 188 [2020-11-30 03:37:06,961 INFO L226 Difference]: Without dead ends: 184 [2020-11-30 03:37:06,963 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 03:37:06,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2020-11-30 03:37:07,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2020-11-30 03:37:07,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-11-30 03:37:07,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 191 transitions. [2020-11-30 03:37:07,016 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 191 transitions. Word has length 3 [2020-11-30 03:37:07,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:37:07,016 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 191 transitions. [2020-11-30 03:37:07,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 03:37:07,017 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 191 transitions. [2020-11-30 03:37:07,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-11-30 03:37:07,017 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:37:07,017 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-11-30 03:37:07,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-11-30 03:37:07,220 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 03:37:07,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:37:07,221 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2020-11-30 03:37:07,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:37:07,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1106696509] [2020-11-30 03:37:07,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-11-30 03:37:07,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:37:07,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 03:37:07,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:37:07,315 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-11-30 03:37:07,315 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:07,326 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:07,326 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:07,327 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-30 03:37:07,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:07,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:37:07,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:07,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1106696509] [2020-11-30 03:37:07,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:37:07,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2020-11-30 03:37:07,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215485760] [2020-11-30 03:37:07,407 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 03:37:07,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 03:37:07,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 03:37:07,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 03:37:07,409 INFO L87 Difference]: Start difference. First operand 180 states and 191 transitions. Second operand 4 states. [2020-11-30 03:37:07,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:37:07,880 INFO L93 Difference]: Finished difference Result 173 states and 182 transitions. [2020-11-30 03:37:07,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 03:37:07,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2020-11-30 03:37:07,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:37:07,883 INFO L225 Difference]: With dead ends: 173 [2020-11-30 03:37:07,884 INFO L226 Difference]: Without dead ends: 173 [2020-11-30 03:37:07,884 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 03:37:07,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-11-30 03:37:07,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 169. [2020-11-30 03:37:07,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2020-11-30 03:37:07,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 179 transitions. [2020-11-30 03:37:07,901 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 179 transitions. Word has length 3 [2020-11-30 03:37:07,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:37:07,902 INFO L481 AbstractCegarLoop]: Abstraction has 169 states and 179 transitions. [2020-11-30 03:37:07,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 03:37:07,902 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 179 transitions. [2020-11-30 03:37:07,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-30 03:37:07,903 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:37:07,903 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:37:08,117 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-11-30 03:37:08,118 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 03:37:08,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:37:08,119 INFO L82 PathProgramCache]: Analyzing trace with hash 59261803, now seen corresponding path program 1 times [2020-11-30 03:37:08,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:37:08,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806443450] [2020-11-30 03:37:08,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-11-30 03:37:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:37:08,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-30 03:37:08,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:37:08,254 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-11-30 03:37:08,254 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:08,258 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:08,259 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:08,259 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 03:37:08,336 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:08,337 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 30 [2020-11-30 03:37:08,339 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:08,367 INFO L625 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2020-11-30 03:37:08,369 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:37:08,369 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2020-11-30 03:37:08,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:08,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:37:08,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:08,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806443450] [2020-11-30 03:37:08,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:37:08,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-11-30 03:37:08,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087145993] [2020-11-30 03:37:08,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 03:37:08,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 03:37:08,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 03:37:08,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 03:37:08,431 INFO L87 Difference]: Start difference. First operand 169 states and 179 transitions. Second operand 4 states. [2020-11-30 03:37:08,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:37:08,938 INFO L93 Difference]: Finished difference Result 179 states and 188 transitions. [2020-11-30 03:37:08,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 03:37:08,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-11-30 03:37:08,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:37:08,941 INFO L225 Difference]: With dead ends: 179 [2020-11-30 03:37:08,941 INFO L226 Difference]: Without dead ends: 179 [2020-11-30 03:37:08,941 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 03:37:08,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-11-30 03:37:08,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 170. [2020-11-30 03:37:08,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-11-30 03:37:08,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 184 transitions. [2020-11-30 03:37:08,956 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 184 transitions. Word has length 8 [2020-11-30 03:37:08,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:37:08,957 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 184 transitions. [2020-11-30 03:37:08,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 03:37:08,957 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 184 transitions. [2020-11-30 03:37:08,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-30 03:37:08,962 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:37:08,963 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:37:09,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-11-30 03:37:09,164 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 03:37:09,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:37:09,165 INFO L82 PathProgramCache]: Analyzing trace with hash 59261804, now seen corresponding path program 1 times [2020-11-30 03:37:09,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:37:09,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1360609497] [2020-11-30 03:37:09,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-11-30 03:37:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:37:09,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 03:37:09,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:37:09,289 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-11-30 03:37:09,289 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:09,296 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:09,296 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:09,296 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-30 03:37:09,358 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:09,359 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 30 [2020-11-30 03:37:09,360 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:09,391 INFO L625 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2020-11-30 03:37:09,393 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:37:09,393 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:14 [2020-11-30 03:37:09,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:09,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:37:09,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:09,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1360609497] [2020-11-30 03:37:09,718 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:37:09,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 6 [2020-11-30 03:37:09,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433613608] [2020-11-30 03:37:09,719 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 03:37:09,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 03:37:09,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 03:37:09,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-30 03:37:09,721 INFO L87 Difference]: Start difference. First operand 170 states and 184 transitions. Second operand 7 states. [2020-11-30 03:37:11,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:37:11,096 INFO L93 Difference]: Finished difference Result 273 states and 288 transitions. [2020-11-30 03:37:11,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 03:37:11,097 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2020-11-30 03:37:11,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:37:11,099 INFO L225 Difference]: With dead ends: 273 [2020-11-30 03:37:11,099 INFO L226 Difference]: Without dead ends: 273 [2020-11-30 03:37:11,100 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-11-30 03:37:11,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-11-30 03:37:11,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 170. [2020-11-30 03:37:11,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-11-30 03:37:11,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 184 transitions. [2020-11-30 03:37:11,120 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 184 transitions. Word has length 8 [2020-11-30 03:37:11,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:37:11,121 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 184 transitions. [2020-11-30 03:37:11,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 03:37:11,121 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 184 transitions. [2020-11-30 03:37:11,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 03:37:11,122 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:37:11,122 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:37:11,323 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-11-30 03:37:11,323 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 03:37:11,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:37:11,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1116057457, now seen corresponding path program 1 times [2020-11-30 03:37:11,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:37:11,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290719177] [2020-11-30 03:37:11,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-11-30 03:37:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:37:11,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 03:37:11,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:37:11,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:11,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:37:11,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:11,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [290719177] [2020-11-30 03:37:11,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:37:11,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-11-30 03:37:11,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978648849] [2020-11-30 03:37:11,409 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 03:37:11,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 03:37:11,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 03:37:11,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 03:37:11,416 INFO L87 Difference]: Start difference. First operand 170 states and 184 transitions. Second operand 3 states. [2020-11-30 03:37:11,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:37:11,533 INFO L93 Difference]: Finished difference Result 155 states and 168 transitions. [2020-11-30 03:37:11,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 03:37:11,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-11-30 03:37:11,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:37:11,535 INFO L225 Difference]: With dead ends: 155 [2020-11-30 03:37:11,535 INFO L226 Difference]: Without dead ends: 155 [2020-11-30 03:37:11,536 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 03:37:11,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-11-30 03:37:11,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2020-11-30 03:37:11,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-11-30 03:37:11,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 168 transitions. [2020-11-30 03:37:11,556 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 168 transitions. Word has length 10 [2020-11-30 03:37:11,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:37:11,557 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 168 transitions. [2020-11-30 03:37:11,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 03:37:11,558 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 168 transitions. [2020-11-30 03:37:11,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 03:37:11,558 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:37:11,559 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:37:11,778 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-11-30 03:37:11,778 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 03:37:11,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:37:11,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1116017678, now seen corresponding path program 1 times [2020-11-30 03:37:11,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:37:11,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005340455] [2020-11-30 03:37:11,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-11-30 03:37:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:37:11,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 03:37:11,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:37:11,902 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-11-30 03:37:11,902 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:11,905 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:11,906 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:11,906 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 03:37:11,937 INFO L384 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 [2020-11-30 03:37:11,937 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:11,950 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:11,951 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:11,952 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2020-11-30 03:37:11,974 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-11-30 03:37:11,975 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:11,979 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:11,980 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:11,980 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2020-11-30 03:37:11,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:11,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:37:11,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:11,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005340455] [2020-11-30 03:37:11,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:37:11,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-11-30 03:37:11,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871647354] [2020-11-30 03:37:11,995 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 03:37:11,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 03:37:11,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 03:37:11,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 03:37:11,996 INFO L87 Difference]: Start difference. First operand 155 states and 168 transitions. Second operand 5 states. [2020-11-30 03:37:12,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:37:12,754 INFO L93 Difference]: Finished difference Result 256 states and 276 transitions. [2020-11-30 03:37:12,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 03:37:12,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-11-30 03:37:12,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:37:12,757 INFO L225 Difference]: With dead ends: 256 [2020-11-30 03:37:12,757 INFO L226 Difference]: Without dead ends: 256 [2020-11-30 03:37:12,757 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-30 03:37:12,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2020-11-30 03:37:12,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 154. [2020-11-30 03:37:12,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-11-30 03:37:12,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 167 transitions. [2020-11-30 03:37:12,766 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 167 transitions. Word has length 10 [2020-11-30 03:37:12,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:37:12,766 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 167 transitions. [2020-11-30 03:37:12,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 03:37:12,767 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 167 transitions. [2020-11-30 03:37:12,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 03:37:12,767 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:37:12,767 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:37:12,983 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-11-30 03:37:12,983 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 03:37:12,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:37:12,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1116017679, now seen corresponding path program 1 times [2020-11-30 03:37:12,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:37:12,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1509783966] [2020-11-30 03:37:12,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-11-30 03:37:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:37:13,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 03:37:13,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:37:13,076 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-11-30 03:37:13,076 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:13,082 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:13,082 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:13,082 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-30 03:37:13,119 INFO L384 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 [2020-11-30 03:37:13,119 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:13,169 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:13,176 INFO L384 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 [2020-11-30 03:37:13,177 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:13,192 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:13,193 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:13,193 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2020-11-30 03:37:13,260 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-11-30 03:37:13,261 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:13,274 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:13,282 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2020-11-30 03:37:13,282 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:13,295 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:13,296 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:13,296 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2020-11-30 03:37:13,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:13,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:37:13,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:13,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1509783966] [2020-11-30 03:37:13,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:37:13,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-11-30 03:37:13,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131175206] [2020-11-30 03:37:13,474 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 03:37:13,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 03:37:13,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 03:37:13,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-30 03:37:13,482 INFO L87 Difference]: Start difference. First operand 154 states and 167 transitions. Second operand 8 states. [2020-11-30 03:37:15,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:37:15,399 INFO L93 Difference]: Finished difference Result 268 states and 289 transitions. [2020-11-30 03:37:15,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 03:37:15,401 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2020-11-30 03:37:15,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:37:15,403 INFO L225 Difference]: With dead ends: 268 [2020-11-30 03:37:15,403 INFO L226 Difference]: Without dead ends: 268 [2020-11-30 03:37:15,404 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-11-30 03:37:15,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2020-11-30 03:37:15,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 153. [2020-11-30 03:37:15,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-11-30 03:37:15,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 166 transitions. [2020-11-30 03:37:15,411 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 166 transitions. Word has length 10 [2020-11-30 03:37:15,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:37:15,411 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 166 transitions. [2020-11-30 03:37:15,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 03:37:15,411 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 166 transitions. [2020-11-30 03:37:15,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-30 03:37:15,412 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:37:15,412 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:37:15,613 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-11-30 03:37:15,613 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 03:37:15,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:37:15,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1834952304, now seen corresponding path program 1 times [2020-11-30 03:37:15,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:37:15,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1478760388] [2020-11-30 03:37:15,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-11-30 03:37:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:37:15,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjunts are in the unsatisfiable core [2020-11-30 03:37:15,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:37:15,731 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-11-30 03:37:15,732 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:15,734 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:15,734 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:15,734 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 03:37:15,769 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:15,770 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2020-11-30 03:37:15,772 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:15,791 INFO L625 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2020-11-30 03:37:15,791 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:15,792 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2020-11-30 03:37:15,818 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2020-11-30 03:37:15,818 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:15,828 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:15,829 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:15,830 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:25 [2020-11-30 03:37:15,929 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:15,929 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 57 [2020-11-30 03:37:15,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 03:37:15,935 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:15,955 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:15,956 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:37:15,956 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2020-11-30 03:37:16,029 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:16,030 INFO L384 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 33 [2020-11-30 03:37:16,031 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:16,038 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:16,043 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:37:16,044 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:15 [2020-11-30 03:37:16,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:16,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:37:20,344 WARN L193 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 19 [2020-11-30 03:37:22,367 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32))) (= (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~item~0.base) c_ULTIMATE.start_main_~item~0.offset))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (bvadd |ULTIMATE.start_main_#t~mem6.offset| (_ bv4 32)) c_ULTIMATE.start_main_~item~0.base))) c_ULTIMATE.start_main_~item~0.base) c_ULTIMATE.start_main_~item~0.offset)))) is different from false [2020-11-30 03:37:22,390 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:22,411 INFO L625 ElimStorePlain]: treesize reduction 27, result has 15.6 percent of original size [2020-11-30 03:37:22,411 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:22,411 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:5 [2020-11-30 03:37:22,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:22,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1478760388] [2020-11-30 03:37:22,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:37:22,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 7] imperfect sequences [] total 14 [2020-11-30 03:37:22,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183533682] [2020-11-30 03:37:22,444 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-30 03:37:22,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 03:37:22,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-30 03:37:22,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=137, Unknown=2, NotChecked=24, Total=210 [2020-11-30 03:37:22,446 INFO L87 Difference]: Start difference. First operand 153 states and 166 transitions. Second operand 15 states. [2020-11-30 03:37:24,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:37:24,832 INFO L93 Difference]: Finished difference Result 263 states and 278 transitions. [2020-11-30 03:37:24,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-30 03:37:24,836 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2020-11-30 03:37:24,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:37:24,838 INFO L225 Difference]: With dead ends: 263 [2020-11-30 03:37:24,838 INFO L226 Difference]: Without dead ends: 263 [2020-11-30 03:37:24,839 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=184, Invalid=418, Unknown=2, NotChecked=46, Total=650 [2020-11-30 03:37:24,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2020-11-30 03:37:24,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 152. [2020-11-30 03:37:24,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-11-30 03:37:24,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2020-11-30 03:37:24,847 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 14 [2020-11-30 03:37:24,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:37:24,847 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2020-11-30 03:37:24,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-30 03:37:24,848 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2020-11-30 03:37:24,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-30 03:37:24,850 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:37:24,850 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:37:25,072 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-11-30 03:37:25,072 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 03:37:25,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:37:25,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1834952303, now seen corresponding path program 1 times [2020-11-30 03:37:25,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:37:25,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [448607566] [2020-11-30 03:37:25,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-11-30 03:37:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:37:25,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 18 conjunts are in the unsatisfiable core [2020-11-30 03:37:25,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:37:25,226 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-11-30 03:37:25,227 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:25,230 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:25,230 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:25,230 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 03:37:25,248 INFO L441 ElimStorePlain]: Different costs {0=[|v_#length_80|], 1=[|v_#valid_89|]} [2020-11-30 03:37:25,252 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-11-30 03:37:25,253 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:25,263 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:25,272 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:25,272 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 17 [2020-11-30 03:37:25,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 03:37:25,287 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:25,299 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:25,299 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:25,300 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2020-11-30 03:37:25,344 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2020-11-30 03:37:25,344 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:25,368 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:25,374 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2020-11-30 03:37:25,375 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:25,397 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:25,398 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:25,398 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2020-11-30 03:37:25,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:25,489 INFO L384 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 29 treesize of output 24 [2020-11-30 03:37:25,490 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:25,526 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:25,575 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:25,575 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 68 [2020-11-30 03:37:25,578 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-11-30 03:37:25,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 03:37:25,581 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-11-30 03:37:25,668 INFO L625 ElimStorePlain]: treesize reduction 54, result has 49.5 percent of original size [2020-11-30 03:37:25,669 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:37:25,669 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2020-11-30 03:37:25,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:25,763 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2020-11-30 03:37:25,766 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:25,794 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:25,814 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:25,815 INFO L384 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 33 [2020-11-30 03:37:25,816 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:25,828 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:25,829 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:25,830 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2020-11-30 03:37:25,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:25,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:37:28,173 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_1 (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6.base|) (bvadd v_prenex_1 (_ bv4 32)) c_ULTIMATE.start_main_~item~0.offset)) c_ULTIMATE.start_main_~item~0.base) c_ULTIMATE.start_main_~item~0.offset))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32))) (let ((.cse1 (bvadd |ULTIMATE.start_main_#t~mem6.offset| (_ bv4 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6.base|) .cse1 c_ULTIMATE.start_main_~item~0.offset)) c_ULTIMATE.start_main_~item~0.base) c_ULTIMATE.start_main_~item~0.offset) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6.base|) .cse1 c_ULTIMATE.start_main_~item~0.base)) c_ULTIMATE.start_main_~item~0.base) c_ULTIMATE.start_main_~item~0.offset)))))) is different from false [2020-11-30 03:37:34,565 WARN L193 SmtUtils]: Spent 2.88 s on a formula simplification that was a NOOP. DAG size: 34 [2020-11-30 03:37:34,616 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:34,868 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2020-11-30 03:37:34,868 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:34,879 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:35,336 WARN L193 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2020-11-30 03:37:35,337 INFO L625 ElimStorePlain]: treesize reduction 59, result has 54.3 percent of original size [2020-11-30 03:37:35,369 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:35,551 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-11-30 03:37:35,551 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:35,552 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:37:35,563 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:37:35,584 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:37:35,595 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:37:35,599 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 5 xjuncts. [2020-11-30 03:37:35,599 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:133, output treesize:47 [2020-11-30 03:37:35,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:35,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [448607566] [2020-11-30 03:37:35,790 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:37:35,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2020-11-30 03:37:35,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938271252] [2020-11-30 03:37:35,791 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-30 03:37:35,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 03:37:35,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-30 03:37:35,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=172, Unknown=1, NotChecked=26, Total=240 [2020-11-30 03:37:35,792 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand 16 states. [2020-11-30 03:37:37,245 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 43 [2020-11-30 03:37:37,483 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2020-11-30 03:37:40,578 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 42 [2020-11-30 03:37:40,828 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2020-11-30 03:37:42,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:37:42,579 INFO L93 Difference]: Finished difference Result 233 states and 246 transitions. [2020-11-30 03:37:42,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-30 03:37:42,580 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2020-11-30 03:37:42,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:37:42,582 INFO L225 Difference]: With dead ends: 233 [2020-11-30 03:37:42,582 INFO L226 Difference]: Without dead ends: 233 [2020-11-30 03:37:42,583 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=275, Invalid=658, Unknown=1, NotChecked=58, Total=992 [2020-11-30 03:37:42,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-11-30 03:37:42,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 145. [2020-11-30 03:37:42,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-11-30 03:37:42,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 157 transitions. [2020-11-30 03:37:42,589 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 157 transitions. Word has length 14 [2020-11-30 03:37:42,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:37:42,589 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 157 transitions. [2020-11-30 03:37:42,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-30 03:37:42,590 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 157 transitions. [2020-11-30 03:37:42,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-30 03:37:42,590 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:37:42,591 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:37:42,803 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-11-30 03:37:42,807 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 03:37:42,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:37:42,807 INFO L82 PathProgramCache]: Analyzing trace with hash 522785196, now seen corresponding path program 1 times [2020-11-30 03:37:42,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:37:42,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255358709] [2020-11-30 03:37:42,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-11-30 03:37:42,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:37:42,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 03:37:42,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:37:42,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:42,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:37:42,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:42,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [255358709] [2020-11-30 03:37:42,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:37:42,912 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-11-30 03:37:42,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531276306] [2020-11-30 03:37:42,913 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 03:37:42,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 03:37:42,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 03:37:42,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 03:37:42,914 INFO L87 Difference]: Start difference. First operand 145 states and 157 transitions. Second operand 4 states. [2020-11-30 03:37:42,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:37:42,989 INFO L93 Difference]: Finished difference Result 263 states and 290 transitions. [2020-11-30 03:37:42,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 03:37:42,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-11-30 03:37:42,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:37:42,992 INFO L225 Difference]: With dead ends: 263 [2020-11-30 03:37:42,992 INFO L226 Difference]: Without dead ends: 263 [2020-11-30 03:37:42,992 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 03:37:42,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2020-11-30 03:37:42,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 176. [2020-11-30 03:37:42,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-11-30 03:37:43,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 192 transitions. [2020-11-30 03:37:43,000 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 192 transitions. Word has length 16 [2020-11-30 03:37:43,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:37:43,001 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 192 transitions. [2020-11-30 03:37:43,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 03:37:43,001 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 192 transitions. [2020-11-30 03:37:43,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-30 03:37:43,003 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:37:43,003 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:37:43,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-11-30 03:37:43,221 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 03:37:43,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:37:43,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1272526174, now seen corresponding path program 1 times [2020-11-30 03:37:43,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:37:43,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1063459350] [2020-11-30 03:37:43,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2020-11-30 03:37:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:37:43,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-30 03:37:43,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:37:43,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:43,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:37:43,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:43,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1063459350] [2020-11-30 03:37:43,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:37:43,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-11-30 03:37:43,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061086694] [2020-11-30 03:37:43,319 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 03:37:43,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 03:37:43,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 03:37:43,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 03:37:43,320 INFO L87 Difference]: Start difference. First operand 176 states and 192 transitions. Second operand 4 states. [2020-11-30 03:37:43,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:37:43,383 INFO L93 Difference]: Finished difference Result 207 states and 224 transitions. [2020-11-30 03:37:43,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 03:37:43,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-11-30 03:37:43,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:37:43,385 INFO L225 Difference]: With dead ends: 207 [2020-11-30 03:37:43,386 INFO L226 Difference]: Without dead ends: 207 [2020-11-30 03:37:43,386 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 03:37:43,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2020-11-30 03:37:43,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 185. [2020-11-30 03:37:43,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-11-30 03:37:43,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 203 transitions. [2020-11-30 03:37:43,393 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 203 transitions. Word has length 18 [2020-11-30 03:37:43,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:37:43,393 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 203 transitions. [2020-11-30 03:37:43,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 03:37:43,393 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 203 transitions. [2020-11-30 03:37:43,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-30 03:37:43,399 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:37:43,399 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:37:43,617 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-11-30 03:37:43,621 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 03:37:43,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:37:43,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1180539215, now seen corresponding path program 1 times [2020-11-30 03:37:43,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:37:43,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54128577] [2020-11-30 03:37:43,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2020-11-30 03:37:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:37:43,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 03:37:43,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:37:43,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:43,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:37:43,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:43,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [54128577] [2020-11-30 03:37:43,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:37:43,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 6 [2020-11-30 03:37:43,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606061503] [2020-11-30 03:37:43,780 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 03:37:43,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 03:37:43,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 03:37:43,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-30 03:37:43,781 INFO L87 Difference]: Start difference. First operand 185 states and 203 transitions. Second operand 7 states. [2020-11-30 03:37:44,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:37:44,211 INFO L93 Difference]: Finished difference Result 189 states and 206 transitions. [2020-11-30 03:37:44,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 03:37:44,216 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-11-30 03:37:44,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:37:44,218 INFO L225 Difference]: With dead ends: 189 [2020-11-30 03:37:44,218 INFO L226 Difference]: Without dead ends: 189 [2020-11-30 03:37:44,218 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2020-11-30 03:37:44,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-11-30 03:37:44,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 185. [2020-11-30 03:37:44,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-11-30 03:37:44,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 202 transitions. [2020-11-30 03:37:44,226 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 202 transitions. Word has length 20 [2020-11-30 03:37:44,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:37:44,226 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 202 transitions. [2020-11-30 03:37:44,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 03:37:44,227 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 202 transitions. [2020-11-30 03:37:44,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-30 03:37:44,228 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:37:44,228 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 03:37:44,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2020-11-30 03:37:44,440 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 03:37:44,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:37:44,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1168053736, now seen corresponding path program 1 times [2020-11-30 03:37:44,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:37:44,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286896869] [2020-11-30 03:37:44,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2020-11-30 03:37:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:37:44,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 11 conjunts are in the unsatisfiable core [2020-11-30 03:37:44,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:37:44,548 INFO L384 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 [2020-11-30 03:37:44,548 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:44,559 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:44,563 INFO L384 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 [2020-11-30 03:37:44,564 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:44,572 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:44,572 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:44,572 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2020-11-30 03:37:44,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:44,605 INFO L384 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 [2020-11-30 03:37:44,606 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:44,628 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:44,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:44,638 INFO L384 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 [2020-11-30 03:37:44,638 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:44,655 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:44,655 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:44,656 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2020-11-30 03:37:44,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:44,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:44,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:44,690 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2020-11-30 03:37:44,690 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:44,721 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:44,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:44,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:44,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:44,736 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2020-11-30 03:37:44,737 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:44,748 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:44,749 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:44,749 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:71, output treesize:33 [2020-11-30 03:37:44,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:44,783 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2020-11-30 03:37:44,791 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:44,809 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:44,813 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-11-30 03:37:44,813 INFO L384 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 24 treesize of output 10 [2020-11-30 03:37:44,815 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:44,820 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:44,820 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:44,820 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2020-11-30 03:37:44,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:44,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:37:44,846 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:37:44,855 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:37:44,864 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:44,911 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:44,915 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:37:44,918 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:44,924 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:44,925 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-11-30 03:37:44,925 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:97, output treesize:25 [2020-11-30 03:37:44,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:44,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286896869] [2020-11-30 03:37:44,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:37:44,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 6 [2020-11-30 03:37:44,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437345489] [2020-11-30 03:37:44,937 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 03:37:44,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 03:37:44,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 03:37:44,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-30 03:37:44,938 INFO L87 Difference]: Start difference. First operand 185 states and 202 transitions. Second operand 6 states. [2020-11-30 03:37:45,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:37:45,356 INFO L93 Difference]: Finished difference Result 182 states and 196 transitions. [2020-11-30 03:37:45,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 03:37:45,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-11-30 03:37:45,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:37:45,358 INFO L225 Difference]: With dead ends: 182 [2020-11-30 03:37:45,358 INFO L226 Difference]: Without dead ends: 182 [2020-11-30 03:37:45,358 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-11-30 03:37:45,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-11-30 03:37:45,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 179. [2020-11-30 03:37:45,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-11-30 03:37:45,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 193 transitions. [2020-11-30 03:37:45,363 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 193 transitions. Word has length 20 [2020-11-30 03:37:45,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:37:45,363 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 193 transitions. [2020-11-30 03:37:45,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 03:37:45,363 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 193 transitions. [2020-11-30 03:37:45,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-30 03:37:45,364 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:37:45,364 INFO L422 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] [2020-11-30 03:37:45,575 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2020-11-30 03:37:45,575 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 03:37:45,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:37:45,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1765664575, now seen corresponding path program 1 times [2020-11-30 03:37:45,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:37:45,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552195043] [2020-11-30 03:37:45,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2020-11-30 03:37:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:37:45,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 03:37:45,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:37:45,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:45,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:45,749 INFO L350 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-11-30 03:37:45,749 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 16 [2020-11-30 03:37:45,750 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:45,771 INFO L625 ElimStorePlain]: treesize reduction 8, result has 66.7 percent of original size [2020-11-30 03:37:45,772 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 03:37:45,772 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2020-11-30 03:37:45,830 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:45,830 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 44 [2020-11-30 03:37:45,831 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:45,855 INFO L625 ElimStorePlain]: treesize reduction 28, result has 36.4 percent of original size [2020-11-30 03:37:45,856 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 03:37:45,856 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2020-11-30 03:37:45,912 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:45,912 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 44 [2020-11-30 03:37:45,913 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:45,940 INFO L625 ElimStorePlain]: treesize reduction 22, result has 42.1 percent of original size [2020-11-30 03:37:45,941 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 03:37:45,941 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2020-11-30 03:37:45,969 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:45,970 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2020-11-30 03:37:45,970 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:45,974 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:45,976 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:45,976 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2020-11-30 03:37:45,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:45,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:37:46,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:46,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1552195043] [2020-11-30 03:37:46,019 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:37:46,019 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-11-30 03:37:46,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793989131] [2020-11-30 03:37:46,019 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 03:37:46,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 03:37:46,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 03:37:46,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 03:37:46,020 INFO L87 Difference]: Start difference. First operand 179 states and 193 transitions. Second operand 5 states. [2020-11-30 03:37:46,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:37:46,271 INFO L93 Difference]: Finished difference Result 177 states and 189 transitions. [2020-11-30 03:37:46,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 03:37:46,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-11-30 03:37:46,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:37:46,273 INFO L225 Difference]: With dead ends: 177 [2020-11-30 03:37:46,273 INFO L226 Difference]: Without dead ends: 177 [2020-11-30 03:37:46,274 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-30 03:37:46,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-11-30 03:37:46,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2020-11-30 03:37:46,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-11-30 03:37:46,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 189 transitions. [2020-11-30 03:37:46,279 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 189 transitions. Word has length 22 [2020-11-30 03:37:46,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:37:46,279 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 189 transitions. [2020-11-30 03:37:46,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 03:37:46,279 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 189 transitions. [2020-11-30 03:37:46,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-30 03:37:46,280 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:37:46,280 INFO L422 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] [2020-11-30 03:37:46,487 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2020-11-30 03:37:46,488 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 03:37:46,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:37:46,488 INFO L82 PathProgramCache]: Analyzing trace with hash 2043976726, now seen corresponding path program 1 times [2020-11-30 03:37:46,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:37:46,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941318611] [2020-11-30 03:37:46,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2020-11-30 03:37:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:37:46,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2020-11-30 03:37:46,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:37:46,574 INFO L384 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 [2020-11-30 03:37:46,575 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:46,583 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:46,589 INFO L384 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 [2020-11-30 03:37:46,589 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:46,595 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:46,595 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:46,595 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2020-11-30 03:37:46,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:46,612 INFO L384 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 [2020-11-30 03:37:46,612 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:46,627 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:46,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:46,643 INFO L384 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 [2020-11-30 03:37:46,644 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:46,660 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:46,661 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:46,661 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2020-11-30 03:37:46,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:46,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:46,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:46,707 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2020-11-30 03:37:46,707 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:46,749 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:46,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:46,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:46,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:46,761 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2020-11-30 03:37:46,761 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:46,778 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:46,778 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:46,778 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:71, output treesize:33 [2020-11-30 03:37:46,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:46,797 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2020-11-30 03:37:46,799 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:46,815 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:46,821 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-11-30 03:37:46,821 INFO L384 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 24 treesize of output 10 [2020-11-30 03:37:46,822 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:46,828 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:46,828 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:46,829 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2020-11-30 03:37:46,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:46,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:37:46,868 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:37:46,883 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:37:46,888 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:46,926 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:46,931 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:37:46,936 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:46,944 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:46,945 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-11-30 03:37:46,945 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:97, output treesize:25 [2020-11-30 03:37:46,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:46,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1941318611] [2020-11-30 03:37:46,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [757769456] [2020-11-30 03:37:46,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 03:37:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:37:47,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 13 conjunts are in the unsatisfiable core [2020-11-30 03:37:47,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:37:47,162 INFO L384 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 [2020-11-30 03:37:47,163 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:47,176 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:47,181 INFO L384 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 [2020-11-30 03:37:47,181 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:47,189 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:47,189 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:47,190 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2020-11-30 03:37:47,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:47,221 INFO L384 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 [2020-11-30 03:37:47,222 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:47,239 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:47,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:47,248 INFO L384 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 [2020-11-30 03:37:47,248 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:47,260 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:47,260 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:47,261 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2020-11-30 03:37:47,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:47,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:47,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:47,331 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2020-11-30 03:37:47,332 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:47,375 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:47,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:47,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:47,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:47,383 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2020-11-30 03:37:47,383 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:47,396 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:47,396 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:47,397 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:74, output treesize:36 [2020-11-30 03:37:47,425 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-11-30 03:37:47,426 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:47,435 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:47,439 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:47,439 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2020-11-30 03:37:47,440 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:47,444 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:47,445 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:47,445 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2020-11-30 03:37:47,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:47,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:37:47,452 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:37:47,485 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:37:47,490 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:47,527 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:47,530 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:47,532 INFO L545 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:37:47,539 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:47,540 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-11-30 03:37:47,541 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:97, output treesize:25 [2020-11-30 03:37:47,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:47,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822650855] [2020-11-30 03:37:47,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:37:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:37:47,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-30 03:37:47,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:37:47,647 INFO L384 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 [2020-11-30 03:37:47,647 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:47,655 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:47,657 INFO L384 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 [2020-11-30 03:37:47,658 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:47,663 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:47,663 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:47,663 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2020-11-30 03:37:47,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:47,691 INFO L384 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 [2020-11-30 03:37:47,692 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:47,713 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:47,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:47,720 INFO L384 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 [2020-11-30 03:37:47,720 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:47,737 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:47,737 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:47,737 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2020-11-30 03:37:47,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:47,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:47,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:47,755 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2020-11-30 03:37:47,755 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:47,778 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:47,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:47,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:47,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:47,785 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2020-11-30 03:37:47,786 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:47,797 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:47,797 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:47,798 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:71, output treesize:33 [2020-11-30 03:37:47,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:37:47,874 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2020-11-30 03:37:47,875 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:47,892 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:47,897 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-11-30 03:37:47,898 INFO L384 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 24 treesize of output 10 [2020-11-30 03:37:47,899 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:47,905 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:47,905 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:47,905 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2020-11-30 03:37:47,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:47,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:37:47,918 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:37:47,927 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:37:47,933 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:47,972 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:47,978 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:47,981 INFO L545 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:37:47,989 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:47,990 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-11-30 03:37:47,990 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:97, output treesize:25 [2020-11-30 03:37:48,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:48,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-11-30 03:37:48,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7, 5, 7, 5] total 10 [2020-11-30 03:37:48,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837302045] [2020-11-30 03:37:48,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 03:37:48,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 03:37:48,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 03:37:48,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-30 03:37:48,007 INFO L87 Difference]: Start difference. First operand 176 states and 189 transitions. Second operand 10 states. [2020-11-30 03:37:48,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:37:48,651 INFO L93 Difference]: Finished difference Result 183 states and 196 transitions. [2020-11-30 03:37:48,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 03:37:48,652 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2020-11-30 03:37:48,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:37:48,654 INFO L225 Difference]: With dead ends: 183 [2020-11-30 03:37:48,654 INFO L226 Difference]: Without dead ends: 183 [2020-11-30 03:37:48,654 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 118 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-11-30 03:37:48,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2020-11-30 03:37:48,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2020-11-30 03:37:48,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-11-30 03:37:48,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 196 transitions. [2020-11-30 03:37:48,665 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 196 transitions. Word has length 23 [2020-11-30 03:37:48,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:37:48,665 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 196 transitions. [2020-11-30 03:37:48,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 03:37:48,665 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 196 transitions. [2020-11-30 03:37:48,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-30 03:37:48,666 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:37:48,666 INFO L422 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] [2020-11-30 03:37:49,279 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 03:37:49,280 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 03:37:49,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:37:49,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1061231960, now seen corresponding path program 1 times [2020-11-30 03:37:49,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:37:49,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1222558776] [2020-11-30 03:37:49,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2020-11-30 03:37:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:37:49,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-30 03:37:49,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:37:49,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:49,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:37:51,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:51,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1222558776] [2020-11-30 03:37:51,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1170774569] [2020-11-30 03:37:51,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 03:37:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:37:51,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 03:37:51,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:37:51,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:51,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:37:51,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:51,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871865751] [2020-11-30 03:37:51,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:37:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:37:51,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 03:37:51,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:37:51,760 INFO L350 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2020-11-30 03:37:51,760 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2020-11-30 03:37:51,760 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:51,784 INFO L625 ElimStorePlain]: treesize reduction 10, result has 69.7 percent of original size [2020-11-30 03:37:51,785 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-30 03:37:51,785 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 03:37:51,785 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:12, output treesize:23 [2020-11-30 03:37:51,786 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-30 03:37:51,827 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-30 03:37:52,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:52,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:37:52,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:52,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-11-30 03:37:52,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 4] total 11 [2020-11-30 03:37:52,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698915954] [2020-11-30 03:37:52,019 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-30 03:37:52,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 03:37:52,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-30 03:37:52,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=96, Unknown=1, NotChecked=0, Total=132 [2020-11-30 03:37:52,020 INFO L87 Difference]: Start difference. First operand 183 states and 196 transitions. Second operand 12 states. [2020-11-30 03:37:53,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:37:53,035 INFO L93 Difference]: Finished difference Result 185 states and 197 transitions. [2020-11-30 03:37:53,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 03:37:53,036 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2020-11-30 03:37:53,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:37:53,037 INFO L225 Difference]: With dead ends: 185 [2020-11-30 03:37:53,037 INFO L226 Difference]: Without dead ends: 168 [2020-11-30 03:37:53,037 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=51, Invalid=130, Unknown=1, NotChecked=0, Total=182 [2020-11-30 03:37:53,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2020-11-30 03:37:53,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2020-11-30 03:37:53,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-11-30 03:37:53,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 180 transitions. [2020-11-30 03:37:53,042 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 180 transitions. Word has length 24 [2020-11-30 03:37:53,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:37:53,042 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 180 transitions. [2020-11-30 03:37:53,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-30 03:37:53,043 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 180 transitions. [2020-11-30 03:37:53,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-11-30 03:37:53,043 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:37:53,044 INFO L422 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] [2020-11-30 03:37:53,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3,21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 03:37:53,656 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 03:37:53,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:37:53,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1900408552, now seen corresponding path program 1 times [2020-11-30 03:37:53,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:37:53,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [196962172] [2020-11-30 03:37:53,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2020-11-30 03:37:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:37:53,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-30 03:37:53,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:37:53,797 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-11-30 03:37:53,797 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:53,799 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:53,799 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:53,800 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 03:37:53,825 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:53,825 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-11-30 03:37:53,826 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:53,835 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:53,835 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:53,836 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:15 [2020-11-30 03:37:53,863 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2020-11-30 03:37:53,863 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:53,875 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:53,876 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:53,876 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2020-11-30 03:37:53,952 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:53,952 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 56 [2020-11-30 03:37:53,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 03:37:53,954 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-11-30 03:37:54,000 INFO L625 ElimStorePlain]: treesize reduction 39, result has 48.0 percent of original size [2020-11-30 03:37:54,000 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:37:54,000 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2020-11-30 03:37:54,217 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:54,218 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 109 [2020-11-30 03:37:54,219 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:54,273 INFO L625 ElimStorePlain]: treesize reduction 40, result has 48.7 percent of original size [2020-11-30 03:37:54,274 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 03:37:54,274 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2020-11-30 03:37:54,467 INFO L350 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2020-11-30 03:37:54,467 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 78 [2020-11-30 03:37:54,469 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-30 03:37:54,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 03:37:54,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 03:37:54,473 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-11-30 03:37:54,503 INFO L625 ElimStorePlain]: treesize reduction 80, result has 25.9 percent of original size [2020-11-30 03:37:54,504 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:37:54,504 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:28 [2020-11-30 03:37:54,571 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:54,571 INFO L384 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30 [2020-11-30 03:37:54,572 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:37:54,584 INFO L625 ElimStorePlain]: treesize reduction 12, result has 42.9 percent of original size [2020-11-30 03:37:54,588 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:37:54,588 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2020-11-30 03:37:54,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:37:54,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:37:54,638 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:37:54,643 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:37:54,643 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:37:54,643 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2020-11-30 03:37:56,700 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~item~0.offset (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~item~0.base (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~item~0.base) ULTIMATE.start_main_~item~0.offset (_ bv0 32)) (bvadd ULTIMATE.start_main_~item~0.offset (_ bv8 32)) v_DerPreprocessor_17)) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset) (_ bv0 32)))) is different from false [2020-11-30 03:37:57,913 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification that was a NOOP. DAG size: 18 [2020-11-30 03:38:04,008 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2020-11-30 03:38:06,026 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~item~0.offset_82 (_ BitVec 32)) (|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32))) (not (= (_ bv0 32) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6.base|) (bvadd |ULTIMATE.start_main_#t~mem6.offset| (_ bv4 32)) c_ULTIMATE.start_main_~item~0.base)))) (let ((.cse1 (select (select .cse0 c_ULTIMATE.start_main_~item~0.base) c_ULTIMATE.start_main_~item~0.offset))) (store .cse0 .cse1 (store (store (select .cse0 .cse1) v_ULTIMATE.start_main_~item~0.offset_82 (_ bv0 32)) (bvadd v_ULTIMATE.start_main_~item~0.offset_82 (_ bv8 32)) v_DerPreprocessor_17)))) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset)))) is different from false [2020-11-30 03:38:08,037 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~item~0.offset_82 (_ BitVec 32)) (|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32))) (not (= (select (select (let ((.cse0 (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~item~0.base) c_ULTIMATE.start_main_~item~0.offset))) (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) (bvadd |ULTIMATE.start_main_#t~mem6.offset| (_ bv4 32)) c_ULTIMATE.start_main_~item~0.base))))) (let ((.cse1 (select (select .cse0 c_ULTIMATE.start_main_~item~0.base) c_ULTIMATE.start_main_~item~0.offset))) (store .cse0 .cse1 (store (store (select .cse0 .cse1) v_ULTIMATE.start_main_~item~0.offset_82 (_ bv0 32)) (bvadd v_ULTIMATE.start_main_~item~0.offset_82 (_ bv8 32)) v_DerPreprocessor_17)))) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset) (_ bv0 32)))) is different from false [2020-11-30 03:38:08,049 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1946 treesize of output 1938 [2020-11-30 03:38:08,052 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-11-30 03:38:08,663 WARN L193 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 41 [2020-11-30 03:38:08,664 INFO L625 ElimStorePlain]: treesize reduction 1848, result has 4.0 percent of original size [2020-11-30 03:38:08,667 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-11-30 03:38:08,667 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:133, output treesize:15 [2020-11-30 03:38:08,668 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-11-30 03:38:08,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:38:08,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [196962172] [2020-11-30 03:38:08,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [164179847] [2020-11-30 03:38:08,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 03:38:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:38:09,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-30 03:38:09,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:38:09,153 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-11-30 03:38:09,154 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:38:09,160 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:38:09,160 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:38:09,161 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-30 03:38:09,291 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:38:09,291 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-11-30 03:38:09,292 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 03:38:09,296 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:38:09,315 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:38:09,316 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:38:09,316 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:18 [2020-11-30 03:38:09,392 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2020-11-30 03:38:09,393 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:38:09,414 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:38:09,415 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:38:09,415 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2020-11-30 03:38:09,630 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:38:09,630 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 56 [2020-11-30 03:38:09,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 03:38:09,633 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-11-30 03:38:09,711 INFO L625 ElimStorePlain]: treesize reduction 39, result has 50.0 percent of original size [2020-11-30 03:38:09,712 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:38:09,712 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2020-11-30 03:38:10,130 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:38:10,130 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 109 [2020-11-30 03:38:10,132 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:38:10,205 INFO L625 ElimStorePlain]: treesize reduction 40, result has 50.6 percent of original size [2020-11-30 03:38:10,206 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 03:38:10,207 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:41 [2020-11-30 03:38:10,429 INFO L350 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2020-11-30 03:38:10,429 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 78 [2020-11-30 03:38:10,431 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-30 03:38:10,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 03:38:10,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 03:38:10,434 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-11-30 03:38:10,475 INFO L625 ElimStorePlain]: treesize reduction 81, result has 27.7 percent of original size [2020-11-30 03:38:10,476 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:38:10,476 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:31 [2020-11-30 03:38:10,617 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:38:10,617 INFO L384 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30 [2020-11-30 03:38:10,618 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:38:10,637 INFO L625 ElimStorePlain]: treesize reduction 12, result has 42.9 percent of original size [2020-11-30 03:38:10,638 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:38:10,638 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:4 [2020-11-30 03:38:10,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:38:10,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:38:10,654 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:38:10,661 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:38:10,661 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:38:10,661 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2020-11-30 03:38:12,744 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~item~0.offset_86 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32))) (not (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~item~0.base) c_ULTIMATE.start_main_~item~0.offset))) (store |c_#memory_$Pointer$.base| .cse0 (store (store (select |c_#memory_$Pointer$.base| .cse0) v_ULTIMATE.start_main_~item~0.offset_86 (_ bv0 32)) (bvadd v_ULTIMATE.start_main_~item~0.offset_86 (_ bv8 32)) v_DerPreprocessor_17))) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset) (_ bv0 32)))) is different from false [2020-11-30 03:38:14,755 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32)) (v_ULTIMATE.start_main_~item~0.offset_86 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32))) (not (= (_ bv0 32) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6.base|) (bvadd |ULTIMATE.start_main_#t~mem6.offset| (_ bv4 32)) c_ULTIMATE.start_main_~item~0.base)))) (let ((.cse1 (select (select .cse0 c_ULTIMATE.start_main_~item~0.base) c_ULTIMATE.start_main_~item~0.offset))) (store .cse0 .cse1 (store (store (select .cse0 .cse1) v_ULTIMATE.start_main_~item~0.offset_86 (_ bv0 32)) (bvadd v_ULTIMATE.start_main_~item~0.offset_86 (_ bv8 32)) v_DerPreprocessor_17)))) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset)))) is different from false [2020-11-30 03:38:16,797 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32)) (v_ULTIMATE.start_main_~item~0.offset_86 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32))) (not (= (select (select (let ((.cse0 (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~item~0.base) c_ULTIMATE.start_main_~item~0.offset))) (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) (bvadd |ULTIMATE.start_main_#t~mem6.offset| (_ bv4 32)) c_ULTIMATE.start_main_~item~0.base))))) (let ((.cse1 (select (select .cse0 c_ULTIMATE.start_main_~item~0.base) c_ULTIMATE.start_main_~item~0.offset))) (store .cse0 .cse1 (store (store (select .cse0 .cse1) v_ULTIMATE.start_main_~item~0.offset_86 (_ bv0 32)) (bvadd v_ULTIMATE.start_main_~item~0.offset_86 (_ bv8 32)) v_DerPreprocessor_17)))) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset) (_ bv0 32)))) is different from false [2020-11-30 03:38:16,823 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16563 treesize of output 16499 [2020-11-30 03:38:16,835 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-11-30 03:38:18,438 WARN L193 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 128 DAG size of output: 39 [2020-11-30 03:38:18,439 INFO L625 ElimStorePlain]: treesize reduction 16341, result has 0.4 percent of original size [2020-11-30 03:38:18,443 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-11-30 03:38:18,444 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:38:18,445 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:38:18,447 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 5 xjuncts. [2020-11-30 03:38:18,447 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:133, output treesize:40 [2020-11-30 03:38:18,459 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-11-30 03:38:18,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:38:18,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366804890] [2020-11-30 03:38:18,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:38:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:38:18,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 21 conjunts are in the unsatisfiable core [2020-11-30 03:38:18,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:38:18,659 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-11-30 03:38:18,660 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:38:18,662 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:38:18,662 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:38:18,662 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 03:38:18,679 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:38:18,679 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 17 [2020-11-30 03:38:18,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 03:38:18,682 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:38:18,691 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:38:18,691 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:38:18,691 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2020-11-30 03:38:18,748 INFO L384 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 [2020-11-30 03:38:18,748 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:38:18,768 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:38:18,768 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:38:18,768 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2020-11-30 03:38:18,917 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:38:18,917 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 52 [2020-11-30 03:38:18,918 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-11-30 03:38:18,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 03:38:18,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 03:38:18,921 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-11-30 03:38:18,998 INFO L625 ElimStorePlain]: treesize reduction 109, result has 20.4 percent of original size [2020-11-30 03:38:18,999 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:38:18,999 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2020-11-30 03:38:19,397 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_115|], 6=[|v_#memory_$Pointer$.base_128|]} [2020-11-30 03:38:19,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:38:19,414 INFO L384 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 19 treesize of output 18 [2020-11-30 03:38:19,414 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:38:19,455 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:38:19,590 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2020-11-30 03:38:19,591 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:38:19,591 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 105 [2020-11-30 03:38:19,592 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:38:19,668 INFO L625 ElimStorePlain]: treesize reduction 40, result has 54.5 percent of original size [2020-11-30 03:38:19,669 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 03:38:19,669 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:48 [2020-11-30 03:38:19,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:38:19,833 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2020-11-30 03:38:19,834 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:38:19,863 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:38:19,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:38:19,869 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2020-11-30 03:38:19,870 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:38:19,887 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:38:19,888 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:38:19,888 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:71, output treesize:33 [2020-11-30 03:38:19,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 03:38:20,001 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2020-11-30 03:38:20,002 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:38:20,044 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 21 [2020-11-30 03:38:20,046 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:38:20,088 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:38:20,107 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:38:20,108 INFO L384 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30 [2020-11-30 03:38:20,108 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-30 03:38:20,153 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:38:20,153 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2020-11-30 03:38:20,154 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-30 03:38:20,208 INFO L625 ElimStorePlain]: treesize reduction 24, result has 44.2 percent of original size [2020-11-30 03:38:20,209 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-11-30 03:38:20,209 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:123, output treesize:9 [2020-11-30 03:38:20,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:38:20,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:38:20,518 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:38:20,525 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:38:20,675 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2020-11-30 03:38:20,675 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:38:20,682 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:38:20,687 INFO L545 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:38:20,789 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2020-11-30 03:38:20,789 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:38:20,790 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2020-11-30 03:38:20,790 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:81 [2020-11-30 03:38:21,719 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2020-11-30 03:38:22,303 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2020-11-30 03:38:22,363 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:38:22,363 INFO L384 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 162 treesize of output 137 [2020-11-30 03:38:22,364 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:38:22,365 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:38:22,367 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:38:22,367 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-11-30 03:38:22,368 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:38:22,369 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:38:22,370 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:38:22,373 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:38:22,374 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:38:22,384 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:38:22,385 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-11-30 03:38:22,385 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:38:22,386 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:38:22,387 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:38:22,388 INFO L545 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 03:38:23,404 WARN L193 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2020-11-30 03:38:23,405 INFO L625 ElimStorePlain]: treesize reduction 45, result has 80.2 percent of original size [2020-11-30 03:38:23,436 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:38:23,436 INFO L384 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 169 treesize of output 140 [2020-11-30 03:38:23,437 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:38:23,439 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-11-30 03:38:23,439 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:38:23,440 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 03:38:23,441 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:38:23,444 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 03:38:23,446 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 03:38:23,447 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:38:23,449 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 03:38:23,452 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:38:23,472 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-11-30 03:38:23,473 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:38:23,474 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 03:38:23,475 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:38:23,477 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 03:38:23,480 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 03:38:23,481 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:38:23,483 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 03:38:23,485 INFO L545 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 03:38:24,567 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2020-11-30 03:38:24,567 INFO L625 ElimStorePlain]: treesize reduction 45, result has 81.3 percent of original size [2020-11-30 03:38:24,571 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:38:24,572 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:38:24,573 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:38:24,574 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:38:24,579 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:38:24,580 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 3 conjuncts [2020-11-30 03:38:24,581 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-11-30 03:38:24,585 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2020-11-30 03:38:24,585 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:165, output treesize:195 [2020-11-30 03:38:24,586 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:38:24,587 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:38:24,588 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:38:24,589 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:38:24,591 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:38:24,592 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 3 conjuncts [2020-11-30 03:38:24,593 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-11-30 03:38:25,108 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:38:25,109 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:38:25,110 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-11-30 03:38:25,111 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:38:25,998 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:38:26,000 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:38:26,002 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:39:42,174 WARN L193 SmtUtils]: Spent 58.02 s on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2020-11-30 03:39:52,434 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:39:52,435 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 3 conjuncts [2020-11-30 03:39:52,437 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-11-30 03:39:52,484 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 03:39:52,485 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 03:39:52,494 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2020-11-30 03:39:52,495 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:39:52,498 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 03:39:52,499 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 03:39:52,505 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-11-30 03:39:52,505 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-30 03:39:52,556 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 03:39:52,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:39:52,565 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 03:39:52,566 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 03:39:52,578 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 8 treesize of output 4 [2020-11-30 03:39:52,579 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-30 03:39:52,583 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 03:39:52,584 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 03:39:52,586 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-11-30 03:39:52,586 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-30 03:39:52,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:39:52,617 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 03:39:52,618 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-11-30 03:39:52,651 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 03:39:52,651 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 03:39:52,658 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 8 treesize of output 4 [2020-11-30 03:39:52,659 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-11-30 03:39:52,664 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 03:39:52,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:39:52,668 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 03:39:52,669 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 03:39:52,675 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2020-11-30 03:39:52,676 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-11-30 03:39:52,679 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 03:39:52,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:39:52,681 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 03:39:52,682 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-11-30 03:39:52,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:39:52,689 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 03:39:52,690 INFO L545 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-11-30 03:39:52,694 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 03:39:52,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-30 03:39:52,696 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-30 03:39:52,697 INFO L545 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-11-30 03:39:52,853 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2020-11-30 03:39:52,853 INFO L625 ElimStorePlain]: treesize reduction 33, result has 65.3 percent of original size [2020-11-30 03:39:52,856 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 6 xjuncts. [2020-11-30 03:39:52,856 INFO L244 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:475, output treesize:51 [2020-11-30 03:39:52,908 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:39:56,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:39:56,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-11-30 03:39:56,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 13, 13, 13] total 52 [2020-11-30 03:39:56,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441689876] [2020-11-30 03:39:56,413 INFO L461 AbstractCegarLoop]: Interpolant automaton has 52 states [2020-11-30 03:39:56,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 03:39:56,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2020-11-30 03:39:56,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1818, Unknown=11, NotChecked=558, Total=2652 [2020-11-30 03:39:56,415 INFO L87 Difference]: Start difference. First operand 168 states and 180 transitions. Second operand 52 states. [2020-11-30 03:40:02,727 WARN L193 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2020-11-30 03:40:09,135 WARN L193 SmtUtils]: Spent 4.23 s on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2020-11-30 03:40:18,779 WARN L193 SmtUtils]: Spent 6.11 s on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2020-11-30 03:40:40,896 WARN L193 SmtUtils]: Spent 17.77 s on a formula simplification. DAG size of input: 112 DAG size of output: 66 [2020-11-30 03:41:14,473 WARN L193 SmtUtils]: Spent 12.48 s on a formula simplification. DAG size of input: 115 DAG size of output: 69 [2020-11-30 03:41:42,247 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 49 [2020-11-30 03:41:53,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:41:53,792 INFO L93 Difference]: Finished difference Result 237 states and 259 transitions. [2020-11-30 03:41:53,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-30 03:41:53,792 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 31 [2020-11-30 03:41:53,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:41:53,794 INFO L225 Difference]: With dead ends: 237 [2020-11-30 03:41:53,794 INFO L226 Difference]: Without dead ends: 237 [2020-11-30 03:41:53,796 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 123 SyntacticMatches, 8 SemanticMatches, 63 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1173 ImplicationChecksByTransitivity, 163.7s TimeCoverageRelationStatistics Valid=552, Invalid=2883, Unknown=11, NotChecked=714, Total=4160 [2020-11-30 03:41:53,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2020-11-30 03:41:53,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 182. [2020-11-30 03:41:53,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-11-30 03:41:53,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 196 transitions. [2020-11-30 03:41:53,802 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 196 transitions. Word has length 31 [2020-11-30 03:41:53,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:41:53,802 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 196 transitions. [2020-11-30 03:41:53,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2020-11-30 03:41:53,802 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 196 transitions. [2020-11-30 03:41:53,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-11-30 03:41:53,803 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:41:53,803 INFO L422 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] [2020-11-30 03:41:54,418 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3,24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 03:41:54,418 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 03:41:54,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:41:54,419 INFO L82 PathProgramCache]: Analyzing trace with hash 2028218688, now seen corresponding path program 1 times [2020-11-30 03:41:54,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:41:54,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [744085172] [2020-11-30 03:41:54,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2020-11-30 03:41:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:41:54,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-30 03:41:54,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:41:54,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:41:54,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:41:54,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:41:54,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [744085172] [2020-11-30 03:41:54,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:41:54,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-11-30 03:41:54,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49280826] [2020-11-30 03:41:54,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 03:41:54,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 03:41:54,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 03:41:54,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 03:41:54,566 INFO L87 Difference]: Start difference. First operand 182 states and 196 transitions. Second operand 3 states. [2020-11-30 03:41:54,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 03:41:54,612 INFO L93 Difference]: Finished difference Result 225 states and 238 transitions. [2020-11-30 03:41:54,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 03:41:54,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2020-11-30 03:41:54,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 03:41:54,615 INFO L225 Difference]: With dead ends: 225 [2020-11-30 03:41:54,615 INFO L226 Difference]: Without dead ends: 225 [2020-11-30 03:41:54,615 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 03:41:54,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-11-30 03:41:54,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 184. [2020-11-30 03:41:54,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-11-30 03:41:54,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 194 transitions. [2020-11-30 03:41:54,623 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 194 transitions. Word has length 32 [2020-11-30 03:41:54,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 03:41:54,623 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 194 transitions. [2020-11-30 03:41:54,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 03:41:54,624 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 194 transitions. [2020-11-30 03:41:54,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-11-30 03:41:54,626 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 03:41:54,626 INFO L422 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] [2020-11-30 03:41:54,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2020-11-30 03:41:54,827 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2020-11-30 03:41:54,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 03:41:54,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1282068940, now seen corresponding path program 1 times [2020-11-30 03:41:54,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 03:41:54,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [232359439] [2020-11-30 03:41:54,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2020-11-30 03:41:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:41:55,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 16 conjunts are in the unsatisfiable core [2020-11-30 03:41:55,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:41:55,024 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-11-30 03:41:55,024 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:41:55,026 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:41:55,027 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:41:55,027 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 03:41:55,073 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:41:55,073 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2020-11-30 03:41:55,074 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:41:55,103 INFO L625 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2020-11-30 03:41:55,103 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:41:55,103 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2020-11-30 03:41:55,124 INFO L384 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 [2020-11-30 03:41:55,124 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:41:55,138 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:41:55,138 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:41:55,139 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:33 [2020-11-30 03:41:55,208 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:41:55,208 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 57 [2020-11-30 03:41:55,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 03:41:55,210 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-11-30 03:41:55,257 INFO L625 ElimStorePlain]: treesize reduction 40, result has 52.4 percent of original size [2020-11-30 03:41:55,258 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:41:55,258 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2020-11-30 03:41:55,453 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:41:55,453 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 112 [2020-11-30 03:41:55,454 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:41:55,508 INFO L625 ElimStorePlain]: treesize reduction 40, result has 54.5 percent of original size [2020-11-30 03:41:55,509 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 03:41:55,509 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:48 [2020-11-30 03:41:55,685 INFO L350 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2020-11-30 03:41:55,685 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 81 [2020-11-30 03:41:55,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 03:41:55,687 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:41:55,710 INFO L625 ElimStorePlain]: treesize reduction 32, result has 54.3 percent of original size [2020-11-30 03:41:55,710 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:41:55,710 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:69, output treesize:38 [2020-11-30 03:41:55,781 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:41:55,782 INFO L384 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2020-11-30 03:41:55,782 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:41:55,798 INFO L625 ElimStorePlain]: treesize reduction 12, result has 58.6 percent of original size [2020-11-30 03:41:55,798 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:41:55,799 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:17 [2020-11-30 03:41:55,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:41:55,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:41:55,916 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:41:55,920 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:41:55,921 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:41:55,921 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:21 [2020-11-30 03:42:12,103 WARN L193 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 20 [2020-11-30 03:42:25,851 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32)) (v_ULTIMATE.start_main_~item~0.offset_94 (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32))) (= (bvadd (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6.base|) (bvadd |ULTIMATE.start_main_#t~mem6.offset| (_ bv4 32)) c_ULTIMATE.start_main_~item~0.base)))) (let ((.cse1 (select (select .cse0 c_ULTIMATE.start_main_~item~0.base) c_ULTIMATE.start_main_~item~0.offset))) (store .cse0 .cse1 (store (store (select .cse0 .cse1) v_ULTIMATE.start_main_~item~0.offset_94 (_ bv0 32)) (bvadd v_ULTIMATE.start_main_~item~0.offset_94 (_ bv8 32)) v_DerPreprocessor_23)))) c_ULTIMATE.start_main_~head~0.base) c_ULTIMATE.start_main_~head~0.offset)) (_ bv1 1)) (_ bv0 1))) is different from false [2020-11-30 03:42:56,328 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 33 [2020-11-30 03:42:56,348 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4562 treesize of output 4546 [2020-11-30 03:42:56,349 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:56,350 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,351 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:56,359 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,360 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,361 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,362 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,365 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,366 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,367 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:56,368 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,369 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,369 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,370 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,374 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,375 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,376 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,376 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:56,377 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,378 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,379 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,380 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,383 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:42:56,384 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:56,385 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,386 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,387 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:56,388 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,389 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,390 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,391 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,394 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,396 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,397 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:42:56,398 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:42:56,400 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:42:56,401 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,402 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,403 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,405 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,406 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,407 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,409 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:56,410 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,413 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,414 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:56,415 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,416 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,416 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,417 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,421 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:42:56,422 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,424 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,425 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:42:56,426 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:56,426 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,427 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,428 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,429 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,433 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:42:56,434 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:42:56,435 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,436 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,437 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,439 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:42:56,440 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 03:42:56,441 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:42:56,442 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:42:56,443 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,444 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,445 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,447 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,448 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,449 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,452 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,453 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,455 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,457 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,458 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,459 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:42:56,460 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:56,461 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,462 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,463 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,464 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,470 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,471 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:56,472 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,472 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,473 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,474 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,481 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:56,482 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,483 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:56,483 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,484 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,485 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,486 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,489 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,490 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,491 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:56,492 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,493 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,493 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,494 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,497 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,499 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,500 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,501 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:56,501 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,502 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,503 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,504 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,507 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:42:56,508 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:56,509 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,510 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,511 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:56,512 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,513 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,514 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,515 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,520 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,521 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,522 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:42:56,523 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:42:56,529 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:42:56,531 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,532 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,535 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,536 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,537 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,541 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:56,542 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,545 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,546 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:56,546 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,552 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,553 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,554 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,558 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:42:56,559 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,560 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,561 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:42:56,562 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:56,563 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,563 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,564 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,565 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,569 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:42:56,570 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:42:56,571 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,571 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,572 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,574 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:42:56,575 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 03:42:56,576 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:42:56,577 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:42:56,578 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,579 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,580 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,582 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,583 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,584 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,586 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,587 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,588 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,590 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,591 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,592 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:42:56,593 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:56,594 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,595 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,596 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,597 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,602 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,603 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:56,604 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,605 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,606 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,607 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:56,612 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:42:57,713 WARN L193 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 114 DAG size of output: 69 [2020-11-30 03:42:57,714 INFO L625 ElimStorePlain]: treesize reduction 4323, result has 4.9 percent of original size [2020-11-30 03:42:57,715 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:57,716 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:57,717 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:42:57,718 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:42:57,718 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:42:57,719 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:57,720 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:57,721 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:57,722 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:57,723 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:57,724 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:57,724 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:57,725 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:57,727 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:57,728 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:57,729 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:42:57,729 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:42:57,730 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:42:57,731 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:57,732 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:57,733 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:57,733 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:57,735 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:57,735 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:57,736 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:57,737 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:57,739 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:42:57,740 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:57,742 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:42:57,742 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:57,744 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:57,745 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:42:57,746 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:42:57,746 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:42:57,747 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:57,748 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:57,749 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:57,750 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:57,751 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:57,752 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:57,757 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:57,758 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:57,760 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:57,761 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:57,761 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:42:57,762 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:57,763 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:42:57,764 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:57,765 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:42:57,765 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:57,767 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:42:57,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [232359439] [2020-11-30 03:42:57,769 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Unsupported sort (_ BitVec 32) [2020-11-30 03:42:57,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1031782943] [2020-11-30 03:42:57,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 03:42:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:42:58,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 19 conjunts are in the unsatisfiable core [2020-11-30 03:42:58,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:42:58,070 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-11-30 03:42:58,070 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:42:58,075 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:42:58,076 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:42:58,076 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-11-30 03:42:58,190 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:42:58,190 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2020-11-30 03:42:58,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 03:42:58,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 03:42:58,194 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:42:58,232 INFO L625 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2020-11-30 03:42:58,233 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:42:58,233 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:26 [2020-11-30 03:42:58,303 INFO L384 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 [2020-11-30 03:42:58,303 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:42:58,324 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:42:58,325 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:42:58,325 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:36 [2020-11-30 03:42:58,538 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:42:58,538 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 57 [2020-11-30 03:42:58,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 03:42:58,540 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-11-30 03:42:58,616 INFO L625 ElimStorePlain]: treesize reduction 40, result has 54.0 percent of original size [2020-11-30 03:42:58,617 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:42:58,617 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:47 [2020-11-30 03:42:59,014 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:42:59,015 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 112 [2020-11-30 03:42:59,016 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:42:59,083 INFO L625 ElimStorePlain]: treesize reduction 40, result has 56.0 percent of original size [2020-11-30 03:42:59,083 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 03:42:59,084 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:51 [2020-11-30 03:42:59,279 INFO L350 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2020-11-30 03:42:59,279 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 81 [2020-11-30 03:42:59,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 03:42:59,280 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:42:59,313 INFO L625 ElimStorePlain]: treesize reduction 32, result has 56.2 percent of original size [2020-11-30 03:42:59,314 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:42:59,314 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:41 [2020-11-30 03:42:59,444 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:42:59,444 INFO L384 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2020-11-30 03:42:59,445 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:42:59,463 INFO L625 ElimStorePlain]: treesize reduction 12, result has 58.6 percent of original size [2020-11-30 03:42:59,464 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:42:59,464 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:17 [2020-11-30 03:42:59,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:42:59,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:42:59,488 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:42:59,494 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:42:59,495 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:42:59,495 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:21 [2020-11-30 03:43:13,712 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4562 treesize of output 4546 [2020-11-30 03:43:13,712 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:13,713 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:13,714 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,715 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,715 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,717 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,718 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,719 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:13,720 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,720 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,721 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,723 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,724 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:13,725 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,726 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,726 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,728 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:43:13,729 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:13,730 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,730 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,731 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,732 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,733 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:43:13,734 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,735 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,736 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,737 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:13,738 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:13,739 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:13,740 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,741 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,742 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,743 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,744 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,746 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:13,748 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,749 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,750 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,751 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:13,753 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,754 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,754 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,755 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:13,756 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,757 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:13,758 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,760 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,761 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,762 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,763 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,764 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,765 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:43:13,766 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,767 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,768 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,769 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:13,770 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:13,771 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:13,772 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,773 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,774 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,775 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,776 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,778 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:13,779 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,780 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,782 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,783 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:13,784 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,785 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,786 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,787 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:43:13,788 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,789 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,790 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,791 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:13,792 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:13,793 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:13,794 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,795 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,796 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,797 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,798 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,801 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:13,802 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,803 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,804 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,806 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,807 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:13,808 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,809 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,810 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,812 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,813 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:13,814 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,815 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,816 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,817 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,818 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,819 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,820 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:43:13,821 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,822 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,823 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,837 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:13,838 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:13,839 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:13,840 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,841 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,843 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,844 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,845 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,847 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:13,848 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,849 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,850 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,852 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:13,853 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,854 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,855 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,859 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:13,860 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:13,861 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,861 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,862 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,863 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,864 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,864 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:13,865 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,866 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,866 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,867 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,868 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:13,869 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,870 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,871 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,872 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:43:13,873 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:13,874 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,875 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,876 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,877 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,877 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:43:13,878 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,879 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,880 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,882 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:13,883 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:13,884 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:13,885 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,886 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,887 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,888 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,889 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,891 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:13,892 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,893 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,894 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,896 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:13,897 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,898 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,899 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,901 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:13,902 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,903 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:13,904 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,905 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,906 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,907 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,908 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,909 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,910 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:43:13,911 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,911 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,912 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,914 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:13,915 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:13,916 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:13,916 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,917 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,918 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,919 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,920 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,922 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:13,923 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,924 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,925 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,927 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:13,928 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,928 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,929 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,930 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:43:13,931 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,932 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,933 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,934 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:13,935 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:13,936 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:13,936 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,937 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,939 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,939 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,940 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,942 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:13,944 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,945 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,946 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,948 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,948 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:13,949 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,950 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,951 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,953 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,953 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:13,954 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,955 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,956 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,958 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,958 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,959 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,960 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:43:13,961 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,962 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,963 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,964 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:13,965 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:13,966 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:13,967 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,969 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,970 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,971 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,982 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:13,983 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,984 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,985 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,988 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:13,988 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,989 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,990 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:13,993 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:43:14,802 WARN L193 SmtUtils]: Spent 808.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 69 [2020-11-30 03:43:14,803 INFO L625 ElimStorePlain]: treesize reduction 4323, result has 4.9 percent of original size [2020-11-30 03:43:14,804 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:14,806 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:14,806 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:14,807 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:14,807 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:14,808 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:14,809 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:14,815 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Unsupported sort (_ BitVec 32) [2020-11-30 03:43:14,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250296302] [2020-11-30 03:43:14,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cc7d890-179a-4ea5-8a44-586cd74503a8/bin/utaipan/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 03:43:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 03:43:14,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 16 conjunts are in the unsatisfiable core [2020-11-30 03:43:14,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 03:43:14,880 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2020-11-30 03:43:14,880 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:43:14,883 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:43:14,883 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:43:14,883 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-11-30 03:43:14,912 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:43:14,912 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2020-11-30 03:43:14,913 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:43:14,940 INFO L625 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2020-11-30 03:43:14,941 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:43:14,941 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2020-11-30 03:43:14,957 INFO L384 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 [2020-11-30 03:43:14,957 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:43:14,972 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:43:14,972 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-30 03:43:14,972 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:33 [2020-11-30 03:43:15,002 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:43:15,002 INFO L384 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 57 [2020-11-30 03:43:15,003 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-30 03:43:15,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 03:43:15,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 03:43:15,005 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-11-30 03:43:15,088 INFO L625 ElimStorePlain]: treesize reduction 137, result has 24.3 percent of original size [2020-11-30 03:43:15,088 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:43:15,088 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2020-11-30 03:43:15,171 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:43:15,172 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 112 [2020-11-30 03:43:15,172 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:43:15,230 INFO L625 ElimStorePlain]: treesize reduction 40, result has 54.5 percent of original size [2020-11-30 03:43:15,230 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-30 03:43:15,230 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:48 [2020-11-30 03:43:15,334 INFO L350 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2020-11-30 03:43:15,334 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 81 [2020-11-30 03:43:15,335 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-11-30 03:43:15,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 03:43:15,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-30 03:43:15,337 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-11-30 03:43:15,379 INFO L625 ElimStorePlain]: treesize reduction 87, result has 30.4 percent of original size [2020-11-30 03:43:15,380 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:43:15,380 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:69, output treesize:38 [2020-11-30 03:43:15,417 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:43:15,417 INFO L384 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2020-11-30 03:43:15,417 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-30 03:43:15,431 INFO L625 ElimStorePlain]: treesize reduction 12, result has 58.6 percent of original size [2020-11-30 03:43:15,432 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:43:15,432 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:17 [2020-11-30 03:43:15,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 03:43:15,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 03:43:15,464 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:43:15,470 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-30 03:43:15,471 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:43:15,471 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:21 [2020-11-30 03:43:23,675 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4562 treesize of output 4546 [2020-11-30 03:43:23,676 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,677 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,677 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,678 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,678 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,679 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,679 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,681 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,681 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,682 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,683 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,683 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,684 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,684 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,687 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,688 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:23,689 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,690 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,691 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,692 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,693 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,694 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,695 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,697 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,698 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,700 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,701 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,702 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,703 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,704 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,706 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,707 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,708 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,710 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,711 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:23,712 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,712 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,713 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,715 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:23,716 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,717 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,718 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,720 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:23,721 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,722 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,723 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,726 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,728 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,729 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,730 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,731 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,732 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,741 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:23,742 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:23,743 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,745 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,746 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,747 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,748 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,749 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,750 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,752 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,754 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,755 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,756 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,757 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,758 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,759 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,761 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,762 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,763 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,765 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,766 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:23,767 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,768 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,769 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,771 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:23,772 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,773 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,774 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,776 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:23,777 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,778 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,779 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,782 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,784 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,785 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,786 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,787 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,788 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,791 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:43:23,792 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,793 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,795 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,796 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:23,797 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,798 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,798 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,800 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:23,802 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,802 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,803 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,805 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:23,806 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,807 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,808 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,812 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:23,813 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:23,814 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,815 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,816 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,817 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:23,818 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,819 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,820 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,822 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:23,823 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,824 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,825 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,827 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:23,828 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,829 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,830 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,834 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,835 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,836 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,837 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:23,838 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,839 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,840 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,842 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:23,843 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,844 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,845 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,847 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:23,848 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,849 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,850 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,853 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,854 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,855 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,856 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,857 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,858 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,859 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,862 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,863 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,864 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,865 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,866 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,867 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,868 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,870 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,871 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,872 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,873 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,874 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:23,875 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,875 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,876 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,878 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:23,879 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,880 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,881 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,882 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:23,883 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,884 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,885 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,888 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,889 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,890 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,891 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,892 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,893 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,897 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,898 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,899 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,900 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,901 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,907 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,912 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,913 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,914 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,915 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,916 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,916 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,917 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,920 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,920 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,921 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,923 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,923 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,924 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,925 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,927 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,928 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:23,929 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,930 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,931 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,932 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,933 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,934 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,935 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,937 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,938 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,939 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,940 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,941 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,942 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,943 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,945 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,946 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,947 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,948 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,949 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:23,950 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,951 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,952 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,954 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:23,955 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,956 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,957 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,959 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:23,960 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,960 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,961 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,964 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,966 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,967 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,968 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,969 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,972 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:23,973 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:23,974 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,975 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,976 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,977 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,978 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,979 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,980 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,982 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,983 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,985 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,986 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,987 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,987 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,988 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,991 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,992 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,993 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,994 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,995 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:23,996 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:23,997 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:23,998 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,000 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:24,001 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:24,002 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,003 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,005 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:24,006 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:24,007 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,008 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,011 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,013 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,014 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,015 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:24,016 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,017 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,020 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:43:24,021 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:24,022 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,023 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,024 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:24,025 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:24,026 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,027 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,028 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:24,029 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:24,030 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,031 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,033 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:24,034 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:24,035 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,036 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,039 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:24,040 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:24,041 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:24,042 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,043 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,044 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:24,045 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:24,046 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,047 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,049 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:24,050 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:24,051 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,052 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,054 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:24,055 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:24,056 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,057 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,060 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:24,061 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,062 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,063 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:24,064 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:24,065 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,074 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,076 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:24,077 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:24,078 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,079 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,081 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:24,082 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:24,083 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,084 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,087 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:24,088 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,089 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,090 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,091 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:24,092 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,093 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,095 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,096 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,098 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,099 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,100 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:24,100 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,101 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,104 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,105 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:24,106 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,107 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,108 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:24,109 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:24,110 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,110 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,112 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:24,113 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:24,114 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,115 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,117 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:24,118 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:24,119 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,120 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,123 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,124 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,126 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,126 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:24,127 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,128 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,132 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,133 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,134 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,135 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:24,136 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,136 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:24,141 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-30 03:43:25,136 WARN L193 SmtUtils]: Spent 993.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 69 [2020-11-30 03:43:25,136 INFO L625 ElimStorePlain]: treesize reduction 4323, result has 4.9 percent of original size [2020-11-30 03:43:25,137 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:25,138 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:25,139 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:43:25,139 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:25,140 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:43:25,141 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:25,141 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:25,142 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:25,143 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:25,143 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:25,144 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:25,145 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:25,145 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:25,146 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:25,147 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:25,147 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:25,148 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:25,149 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:25,149 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:25,150 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:25,151 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:25,151 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:43:25,152 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:25,157 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:25,157 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:25,158 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:25,160 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:25,160 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:43:25,161 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:25,162 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:43:25,162 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:25,163 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:25,164 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:25,165 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:25,166 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:25,167 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:25,168 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:25,169 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:25,171 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:25,172 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:25,173 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:25,174 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:25,174 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:25,175 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:25,177 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:25,177 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:25,178 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:43:25,179 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:25,180 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:25,181 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:25,182 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:25,184 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:25,185 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:25,186 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-11-30 03:43:25,187 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:25,188 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 03:43:25,188 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:25,189 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 03:43:25,189 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:25,190 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-11-30 03:43:25,192 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Unsupported sort (_ BitVec 32) [2020-11-30 03:43:25,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2020-11-30 03:43:25,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2020-11-30 03:43:25,192 ERROR L205 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2020-11-30 03:43:25,192 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 03:43:25,799 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,27 cvc4 --incremental --print-success --lang smt --rewrite-divk,26 mathsat -unsat_core_generation=3 [2020-11-30 03:43:25,819 WARN L238 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-11-30 03:43:25,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 03:43:25 BoogieIcfgContainer [2020-11-30 03:43:25,829 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 03:43:25,829 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 03:43:25,830 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 03:43:25,830 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 03:43:25,830 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:37:05" (3/4) ... [2020-11-30 03:43:25,840 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-30 03:43:25,840 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 03:43:25,841 INFO L168 Benchmark]: Toolchain (without parser) took 382523.66 ms. Allocated memory was 54.5 MB in the beginning and 100.7 MB in the end (delta: 46.1 MB). Free memory was 30.8 MB in the beginning and 57.0 MB in the end (delta: -26.2 MB). Peak memory consumption was 20.0 MB. Max. memory is 16.1 GB. [2020-11-30 03:43:25,842 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 54.5 MB. Free memory was 36.6 MB in the beginning and 36.5 MB in the end (delta: 37.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 03:43:25,842 INFO L168 Benchmark]: CACSL2BoogieTranslator took 779.38 ms. Allocated memory was 54.5 MB in the beginning and 69.2 MB in the end (delta: 14.7 MB). Free memory was 30.6 MB in the beginning and 51.5 MB in the end (delta: -21.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 16.1 GB. [2020-11-30 03:43:25,844 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.24 ms. Allocated memory is still 69.2 MB. Free memory was 51.5 MB in the beginning and 48.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 03:43:25,847 INFO L168 Benchmark]: Boogie Preprocessor took 65.05 ms. Allocated memory is still 69.2 MB. Free memory was 48.9 MB in the beginning and 46.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 03:43:25,848 INFO L168 Benchmark]: RCFGBuilder took 1580.02 ms. Allocated memory is still 69.2 MB. Free memory was 46.5 MB in the beginning and 47.4 MB in the end (delta: -862.9 kB). Peak memory consumption was 19.6 MB. Max. memory is 16.1 GB. [2020-11-30 03:43:25,848 INFO L168 Benchmark]: TraceAbstraction took 379984.18 ms. Allocated memory was 69.2 MB in the beginning and 100.7 MB in the end (delta: 31.5 MB). Free memory was 47.0 MB in the beginning and 57.0 MB in the end (delta: -9.9 MB). Peak memory consumption was 62.1 MB. Max. memory is 16.1 GB. [2020-11-30 03:43:25,849 INFO L168 Benchmark]: Witness Printer took 10.95 ms. Allocated memory is still 100.7 MB. Free memory is still 57.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 03:43:25,851 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.35 ms. Allocated memory is still 54.5 MB. Free memory was 36.6 MB in the beginning and 36.5 MB in the end (delta: 37.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 779.38 ms. Allocated memory was 54.5 MB in the beginning and 69.2 MB in the end (delta: 14.7 MB). Free memory was 30.6 MB in the beginning and 51.5 MB in the end (delta: -21.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 95.24 ms. Allocated memory is still 69.2 MB. Free memory was 51.5 MB in the beginning and 48.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 65.05 ms. Allocated memory is still 69.2 MB. Free memory was 48.9 MB in the beginning and 46.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1580.02 ms. Allocated memory is still 69.2 MB. Free memory was 46.5 MB in the beginning and 47.4 MB in the end (delta: -862.9 kB). Peak memory consumption was 19.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 379984.18 ms. Allocated memory was 69.2 MB in the beginning and 100.7 MB in the end (delta: 31.5 MB). Free memory was 47.0 MB in the beginning and 57.0 MB in the end (delta: -9.9 MB). Peak memory consumption was 62.1 MB. Max. memory is 16.1 GB. * Witness Printer took 10.95 ms. Allocated memory is still 100.7 MB. Free memory is still 57.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1055]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L997] SLL* head = malloc(sizeof(SLL)); [L998] head->next = ((void*)0) [L999] head->prev = ((void*)0) [L1000] head->data = 0 [L1001] SLL* item = head; [L1002] int status = 0; [L1004] COND TRUE __VERIFIER_nondet_int() [L1006] item->next = malloc(sizeof(SLL)) [L1007] EXPR item->next [L1007] item->next->prev = item [L1008] EXPR item->next [L1008] item = item->next [L1009] item->next = ((void*)0) [L1011] COND TRUE !status [L1013] item->data = 1 [L1014] status = 1 [L1027] COND FALSE !(!(head != ((void*)0))) [L1028] COND FALSE !(!(item != ((void*)0))) [L1004] COND FALSE !(__VERIFIER_nondet_int()) [L1031] COND FALSE !(!(head != ((void*)0))) [L1032] COND TRUE status == 1 [L1034] COND FALSE !(!(head != ((void*)0))) [L1035] EXPR head->next [L1035] COND FALSE !(!(head->next != ((void*)0))) [L1037] COND FALSE !(status == 2) [L1043] COND FALSE !(status == 3) [L1052] EXPR head->next [L1052] item = head->next [L1053] COND TRUE item && __VERIFIER_nondet_int() [L1055] !status || item->data > 0 [L1055] item->data - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 205 locations, 76 error locations. Started 1 CEGAR loops. VerificationResult: UNKNOWN, OverallTime: 379.8s, OverallIterations: 19, TraceHistogramMax: 2, AutomataDifference: 135.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2435 SDtfs, 4597 SDslu, 7307 SDs, 0 SdLazy, 4929 SolverSat, 221 SolverUnsat, 20 SolverUnknown, 0 SolverNotchecked, 80.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 900 GetRequests, 680 SyntacticMatches, 26 SemanticMatches, 194 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1481 ImplicationChecksByTransitivity, 185.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=205occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 749 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 145.4s InterpolantComputationTime, 442 NumberOfCodeBlocks, 442 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 836 ConstructedInterpolants, 120 QuantifiedInterpolants, 260276 SizeOfPredicates, 175 NumberOfNonLiveVariables, 1950 ConjunctsInSsa, 212 ConjunctsInUnsatCore, 48 InterpolantComputations, 30 PerfectInterpolantSequences, 8/26 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request...