./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/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 61cac7be0490384ca2e2fa5b07a6c43e88983407 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/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 61cac7be0490384ca2e2fa5b07a6c43e88983407 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 16:31:05,786 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:31:05,787 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:31:05,796 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:31:05,796 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:31:05,797 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:31:05,798 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:31:05,799 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:31:05,801 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:31:05,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:31:05,803 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:31:05,804 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:31:05,804 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:31:05,805 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:31:05,806 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:31:05,807 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:31:05,807 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:31:05,808 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:31:05,810 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:31:05,812 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:31:05,813 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:31:05,814 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:31:05,815 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:31:05,816 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:31:05,817 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:31:05,818 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:31:05,818 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:31:05,818 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:31:05,819 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:31:05,819 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:31:05,820 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:31:05,820 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:31:05,821 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:31:05,821 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:31:05,822 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:31:05,822 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:31:05,822 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:31:05,823 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:31:05,823 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:31:05,824 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:31:05,824 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:31:05,825 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 16:31:05,837 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:31:05,838 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:31:05,838 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 16:31:05,838 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 16:31:05,838 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 16:31:05,839 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 16:31:05,839 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 16:31:05,839 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 16:31:05,839 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 16:31:05,839 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 16:31:05,839 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 16:31:05,839 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 16:31:05,840 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 16:31:05,840 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 16:31:05,840 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 16:31:05,840 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:31:05,840 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:31:05,841 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:31:05,841 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:31:05,841 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 16:31:05,841 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:31:05,841 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:31:05,841 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:31:05,841 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 16:31:05,841 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 16:31:05,842 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 16:31:05,842 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:31:05,842 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 16:31:05,842 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:31:05,842 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:31:05,842 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:31:05,842 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:31:05,842 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:31:05,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:31:05,843 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:31:05,843 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:31:05,843 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 16:31:05,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:31:05,843 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:31:05,843 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 16:31:05,843 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/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 -> 61cac7be0490384ca2e2fa5b07a6c43e88983407 [2019-12-07 16:31:05,952 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:31:05,959 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:31:05,962 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:31:05,963 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:31:05,963 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:31:05,963 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/../../sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i [2019-12-07 16:31:06,000 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/data/dee76ac9e/4cee121d85e649fb998334e2e1d9c487/FLAGf51cfcdf6 [2019-12-07 16:31:06,361 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:31:06,361 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i [2019-12-07 16:31:06,370 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/data/dee76ac9e/4cee121d85e649fb998334e2e1d9c487/FLAGf51cfcdf6 [2019-12-07 16:31:06,757 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/data/dee76ac9e/4cee121d85e649fb998334e2e1d9c487 [2019-12-07 16:31:06,759 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:31:06,760 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:31:06,761 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:31:06,761 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:31:06,764 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:31:06,764 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:31:06" (1/1) ... [2019-12-07 16:31:06,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b06cb05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:06, skipping insertion in model container [2019-12-07 16:31:06,766 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:31:06" (1/1) ... [2019-12-07 16:31:06,771 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:31:06,795 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:31:07,009 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:31:07,014 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:31:07,046 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:31:07,080 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:31:07,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:07 WrapperNode [2019-12-07 16:31:07,080 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:31:07,081 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:31:07,081 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:31:07,081 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:31:07,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:07" (1/1) ... [2019-12-07 16:31:07,098 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:07" (1/1) ... [2019-12-07 16:31:07,113 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:31:07,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:31:07,113 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:31:07,113 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:31:07,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:07" (1/1) ... [2019-12-07 16:31:07,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:07" (1/1) ... [2019-12-07 16:31:07,121 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:07" (1/1) ... [2019-12-07 16:31:07,121 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:07" (1/1) ... [2019-12-07 16:31:07,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:07" (1/1) ... [2019-12-07 16:31:07,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:07" (1/1) ... [2019-12-07 16:31:07,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:07" (1/1) ... [2019-12-07 16:31:07,132 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:31:07,132 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:31:07,132 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:31:07,132 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:31:07,133 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/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 [2019-12-07 16:31:07,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 16:31:07,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 16:31:07,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 16:31:07,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 16:31:07,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:31:07,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:31:07,424 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:31:07,424 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-07 16:31:07,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:31:07 BoogieIcfgContainer [2019-12-07 16:31:07,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:31:07,425 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:31:07,425 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:31:07,427 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:31:07,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:31:06" (1/3) ... [2019-12-07 16:31:07,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ebb727b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:31:07, skipping insertion in model container [2019-12-07 16:31:07,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:07" (2/3) ... [2019-12-07 16:31:07,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ebb727b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:31:07, skipping insertion in model container [2019-12-07 16:31:07,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:31:07" (3/3) ... [2019-12-07 16:31:07,429 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_extends_pointer.i [2019-12-07 16:31:07,435 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:31:07,440 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2019-12-07 16:31:07,447 INFO L249 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2019-12-07 16:31:07,459 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:31:07,459 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 16:31:07,459 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:31:07,460 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:31:07,460 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:31:07,460 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:31:07,460 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:31:07,460 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:31:07,470 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2019-12-07 16:31:07,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-12-07 16:31:07,474 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:07,475 INFO L410 BasicCegarLoop]: trace histogram [1, 1] [2019-12-07 16:31:07,475 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:31:07,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:07,479 INFO L82 PathProgramCache]: Analyzing trace with hash 3755, now seen corresponding path program 1 times [2019-12-07 16:31:07,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:31:07,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183498527] [2019-12-07 16:31:07,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:31:07,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:07,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:07,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183498527] [2019-12-07 16:31:07,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:31:07,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 16:31:07,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374408872] [2019-12-07 16:31:07,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:31:07,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:31:07,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:31:07,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:31:07,593 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 3 states. [2019-12-07 16:31:07,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:07,660 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2019-12-07 16:31:07,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:31:07,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-12-07 16:31:07,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:07,670 INFO L225 Difference]: With dead ends: 54 [2019-12-07 16:31:07,670 INFO L226 Difference]: Without dead ends: 52 [2019-12-07 16:31:07,671 INFO L630 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 [2019-12-07 16:31:07,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-12-07 16:31:07,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2019-12-07 16:31:07,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-07 16:31:07,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2019-12-07 16:31:07,696 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 2 [2019-12-07 16:31:07,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:07,696 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2019-12-07 16:31:07,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:31:07,696 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2019-12-07 16:31:07,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-12-07 16:31:07,696 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:07,696 INFO L410 BasicCegarLoop]: trace histogram [1, 1] [2019-12-07 16:31:07,697 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:31:07,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:07,697 INFO L82 PathProgramCache]: Analyzing trace with hash 3756, now seen corresponding path program 1 times [2019-12-07 16:31:07,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:31:07,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932622727] [2019-12-07 16:31:07,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:31:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:07,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:07,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932622727] [2019-12-07 16:31:07,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:31:07,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 16:31:07,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052752558] [2019-12-07 16:31:07,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:31:07,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:31:07,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:31:07,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:31:07,730 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 3 states. [2019-12-07 16:31:07,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:07,775 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2019-12-07 16:31:07,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:31:07,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-12-07 16:31:07,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:07,776 INFO L225 Difference]: With dead ends: 48 [2019-12-07 16:31:07,776 INFO L226 Difference]: Without dead ends: 48 [2019-12-07 16:31:07,777 INFO L630 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 [2019-12-07 16:31:07,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-12-07 16:31:07,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2019-12-07 16:31:07,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 16:31:07,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-12-07 16:31:07,780 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 2 [2019-12-07 16:31:07,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:07,781 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-12-07 16:31:07,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:31:07,781 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-12-07 16:31:07,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 16:31:07,781 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:07,781 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:31:07,781 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:31:07,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:07,782 INFO L82 PathProgramCache]: Analyzing trace with hash -948535654, now seen corresponding path program 1 times [2019-12-07 16:31:07,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:31:07,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537496403] [2019-12-07 16:31:07,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:31:07,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:07,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:07,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537496403] [2019-12-07 16:31:07,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:31:07,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:31:07,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417474374] [2019-12-07 16:31:07,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:31:07,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:31:07,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:31:07,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:31:07,814 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 4 states. [2019-12-07 16:31:07,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:07,872 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2019-12-07 16:31:07,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:31:07,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 16:31:07,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:07,873 INFO L225 Difference]: With dead ends: 69 [2019-12-07 16:31:07,873 INFO L226 Difference]: Without dead ends: 69 [2019-12-07 16:31:07,874 INFO L630 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 [2019-12-07 16:31:07,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-07 16:31:07,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 43. [2019-12-07 16:31:07,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-12-07 16:31:07,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2019-12-07 16:31:07,877 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 8 [2019-12-07 16:31:07,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:07,878 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2019-12-07 16:31:07,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:31:07,878 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2019-12-07 16:31:07,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 16:31:07,878 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:07,878 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:31:07,878 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:31:07,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:07,879 INFO L82 PathProgramCache]: Analyzing trace with hash -948537019, now seen corresponding path program 1 times [2019-12-07 16:31:07,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:31:07,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025249490] [2019-12-07 16:31:07,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:31:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:07,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:07,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025249490] [2019-12-07 16:31:07,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:31:07,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:31:07,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552181] [2019-12-07 16:31:07,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:31:07,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:31:07,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:31:07,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:31:07,914 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2019-12-07 16:31:07,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:07,970 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2019-12-07 16:31:07,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:31:07,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 16:31:07,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:07,971 INFO L225 Difference]: With dead ends: 48 [2019-12-07 16:31:07,971 INFO L226 Difference]: Without dead ends: 48 [2019-12-07 16:31:07,972 INFO L630 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 [2019-12-07 16:31:07,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-12-07 16:31:07,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2019-12-07 16:31:07,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-07 16:31:07,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2019-12-07 16:31:07,975 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 8 [2019-12-07 16:31:07,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:07,975 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2019-12-07 16:31:07,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:31:07,975 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2019-12-07 16:31:07,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 16:31:07,976 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:07,976 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:31:07,976 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:31:07,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:07,976 INFO L82 PathProgramCache]: Analyzing trace with hash -948537018, now seen corresponding path program 1 times [2019-12-07 16:31:07,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:31:07,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311199785] [2019-12-07 16:31:07,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:31:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:08,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:08,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311199785] [2019-12-07 16:31:08,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:31:08,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:31:08,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379920755] [2019-12-07 16:31:08,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:31:08,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:31:08,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:31:08,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:31:08,023 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 5 states. [2019-12-07 16:31:08,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:08,094 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2019-12-07 16:31:08,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:31:08,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-12-07 16:31:08,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:08,095 INFO L225 Difference]: With dead ends: 74 [2019-12-07 16:31:08,095 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 16:31:08,095 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:31:08,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 16:31:08,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 59. [2019-12-07 16:31:08,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-12-07 16:31:08,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2019-12-07 16:31:08,100 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 8 [2019-12-07 16:31:08,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:08,100 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2019-12-07 16:31:08,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:31:08,100 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2019-12-07 16:31:08,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 16:31:08,100 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:08,100 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:31:08,101 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:31:08,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:08,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1010019572, now seen corresponding path program 1 times [2019-12-07 16:31:08,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:31:08,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034615384] [2019-12-07 16:31:08,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:31:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:08,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:08,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034615384] [2019-12-07 16:31:08,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:31:08,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:31:08,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735454147] [2019-12-07 16:31:08,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:31:08,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:31:08,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:31:08,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:31:08,153 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand 4 states. [2019-12-07 16:31:08,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:08,182 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2019-12-07 16:31:08,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:31:08,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 16:31:08,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:08,182 INFO L225 Difference]: With dead ends: 58 [2019-12-07 16:31:08,183 INFO L226 Difference]: Without dead ends: 58 [2019-12-07 16:31:08,183 INFO L630 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 [2019-12-07 16:31:08,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-12-07 16:31:08,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-12-07 16:31:08,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-07 16:31:08,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2019-12-07 16:31:08,188 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 10 [2019-12-07 16:31:08,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:08,188 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2019-12-07 16:31:08,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:31:08,188 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2019-12-07 16:31:08,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 16:31:08,189 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:08,189 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:31:08,189 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:31:08,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:08,190 INFO L82 PathProgramCache]: Analyzing trace with hash -879671076, now seen corresponding path program 1 times [2019-12-07 16:31:08,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:31:08,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002604219] [2019-12-07 16:31:08,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:31:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:08,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:08,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002604219] [2019-12-07 16:31:08,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:31:08,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:31:08,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480918164] [2019-12-07 16:31:08,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:31:08,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:31:08,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:31:08,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:31:08,229 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand 4 states. [2019-12-07 16:31:08,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:08,277 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2019-12-07 16:31:08,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:31:08,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 16:31:08,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:08,278 INFO L225 Difference]: With dead ends: 74 [2019-12-07 16:31:08,278 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 16:31:08,278 INFO L630 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 [2019-12-07 16:31:08,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 16:31:08,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 67. [2019-12-07 16:31:08,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-12-07 16:31:08,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2019-12-07 16:31:08,283 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 12 [2019-12-07 16:31:08,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:08,283 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2019-12-07 16:31:08,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:31:08,283 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2019-12-07 16:31:08,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 16:31:08,283 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:08,284 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:31:08,284 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:31:08,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:08,284 INFO L82 PathProgramCache]: Analyzing trace with hash -879682061, now seen corresponding path program 1 times [2019-12-07 16:31:08,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:31:08,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662299820] [2019-12-07 16:31:08,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:31:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:08,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:08,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662299820] [2019-12-07 16:31:08,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:31:08,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 16:31:08,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828457218] [2019-12-07 16:31:08,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:31:08,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:31:08,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:31:08,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:31:08,368 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand 7 states. [2019-12-07 16:31:08,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:08,492 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2019-12-07 16:31:08,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:31:08,493 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-12-07 16:31:08,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:08,494 INFO L225 Difference]: With dead ends: 71 [2019-12-07 16:31:08,494 INFO L226 Difference]: Without dead ends: 71 [2019-12-07 16:31:08,495 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:31:08,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-12-07 16:31:08,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 62. [2019-12-07 16:31:08,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 16:31:08,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2019-12-07 16:31:08,499 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 77 transitions. Word has length 12 [2019-12-07 16:31:08,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:08,499 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 77 transitions. [2019-12-07 16:31:08,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:31:08,499 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2019-12-07 16:31:08,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 16:31:08,500 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:08,500 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:31:08,500 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:31:08,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:08,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1609525771, now seen corresponding path program 1 times [2019-12-07 16:31:08,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:31:08,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961100591] [2019-12-07 16:31:08,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:31:08,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:08,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:08,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961100591] [2019-12-07 16:31:08,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085358096] [2019-12-07 16:31:08,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/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 [2019-12-07 16:31:08,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:08,586 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 16:31:08,589 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:31:08,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:31:08,632 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 21 treesize of output 24 [2019-12-07 16:31:08,633 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:08,645 INFO L614 ElimStorePlain]: treesize reduction 4, result has 84.0 percent of original size [2019-12-07 16:31:08,645 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:08,645 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:21 [2019-12-07 16:31:08,685 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:08,685 INFO L377 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 17 treesize of output 39 [2019-12-07 16:31:08,686 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:08,708 INFO L614 ElimStorePlain]: treesize reduction 14, result has 64.1 percent of original size [2019-12-07 16:31:08,709 INFO L534 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. [2019-12-07 16:31:08,709 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2019-12-07 16:31:08,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:08,729 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:31:08,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:08,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1272349904] [2019-12-07 16:31:08,751 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 16:31:08,751 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:31:08,754 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 16:31:08,758 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 16:31:08,759 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 16:31:09,097 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 16:31:09,282 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 65 [2019-12-07 16:31:09,975 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 79 [2019-12-07 16:31:10,315 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 66 [2019-12-07 16:31:10,620 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 63 [2019-12-07 16:31:10,622 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 16:31:10,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:31:10,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2019-12-07 16:31:10,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496939670] [2019-12-07 16:31:10,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 16:31:10,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:31:10,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 16:31:10,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-12-07 16:31:10,623 INFO L87 Difference]: Start difference. First operand 62 states and 77 transitions. Second operand 8 states. [2019-12-07 16:31:10,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:10,904 INFO L93 Difference]: Finished difference Result 163 states and 188 transitions. [2019-12-07 16:31:10,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 16:31:10,905 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-12-07 16:31:10,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:10,906 INFO L225 Difference]: With dead ends: 163 [2019-12-07 16:31:10,906 INFO L226 Difference]: Without dead ends: 161 [2019-12-07 16:31:10,906 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2019-12-07 16:31:10,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-12-07 16:31:10,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 100. [2019-12-07 16:31:10,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-12-07 16:31:10,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 137 transitions. [2019-12-07 16:31:10,912 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 137 transitions. Word has length 15 [2019-12-07 16:31:10,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:10,912 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 137 transitions. [2019-12-07 16:31:10,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 16:31:10,912 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 137 transitions. [2019-12-07 16:31:10,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 16:31:10,913 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:10,913 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:31:11,113 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:31:11,115 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:31:11,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:11,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1609524406, now seen corresponding path program 1 times [2019-12-07 16:31:11,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:31:11,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079405746] [2019-12-07 16:31:11,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:31:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:11,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:11,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079405746] [2019-12-07 16:31:11,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581585214] [2019-12-07 16:31:11,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/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 [2019-12-07 16:31:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:11,186 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 16:31:11,187 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:31:11,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:11,499 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:31:11,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:11,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [689319946] [2019-12-07 16:31:11,789 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-12-07 16:31:11,789 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:31:11,789 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 16:31:11,789 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 16:31:11,789 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 16:31:11,968 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 16:31:12,465 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-12-07 16:31:12,943 WARN L192 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 81 [2019-12-07 16:31:13,325 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 72 [2019-12-07 16:31:13,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:31:13,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5, 8, 8] total 25 [2019-12-07 16:31:13,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366269571] [2019-12-07 16:31:13,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 16:31:13,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:31:13,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 16:31:13,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2019-12-07 16:31:13,790 INFO L87 Difference]: Start difference. First operand 100 states and 137 transitions. Second operand 10 states. [2019-12-07 16:31:14,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:14,380 INFO L93 Difference]: Finished difference Result 113 states and 150 transitions. [2019-12-07 16:31:14,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 16:31:14,381 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-12-07 16:31:14,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:14,381 INFO L225 Difference]: With dead ends: 113 [2019-12-07 16:31:14,382 INFO L226 Difference]: Without dead ends: 100 [2019-12-07 16:31:14,382 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 17 SyntacticMatches, 9 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2019-12-07 16:31:14,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-12-07 16:31:14,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-12-07 16:31:14,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-12-07 16:31:14,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 136 transitions. [2019-12-07 16:31:14,387 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 136 transitions. Word has length 15 [2019-12-07 16:31:14,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:14,387 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 136 transitions. [2019-12-07 16:31:14,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 16:31:14,387 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 136 transitions. [2019-12-07 16:31:14,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 16:31:14,388 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:14,388 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:31:14,589 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:31:14,590 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:31:14,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:14,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1901587046, now seen corresponding path program 1 times [2019-12-07 16:31:14,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:31:14,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407176455] [2019-12-07 16:31:14,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:31:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:14,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:14,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407176455] [2019-12-07 16:31:14,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:31:14,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:31:14,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774008619] [2019-12-07 16:31:14,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:31:14,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:31:14,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:31:14,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:31:14,647 INFO L87 Difference]: Start difference. First operand 100 states and 136 transitions. Second operand 5 states. [2019-12-07 16:31:14,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:14,696 INFO L93 Difference]: Finished difference Result 110 states and 135 transitions. [2019-12-07 16:31:14,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:31:14,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-12-07 16:31:14,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:14,697 INFO L225 Difference]: With dead ends: 110 [2019-12-07 16:31:14,697 INFO L226 Difference]: Without dead ends: 110 [2019-12-07 16:31:14,697 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:31:14,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-12-07 16:31:14,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 95. [2019-12-07 16:31:14,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-12-07 16:31:14,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 123 transitions. [2019-12-07 16:31:14,701 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 123 transitions. Word has length 15 [2019-12-07 16:31:14,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:14,701 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 123 transitions. [2019-12-07 16:31:14,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:31:14,701 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2019-12-07 16:31:14,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 16:31:14,701 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:14,702 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:31:14,702 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:31:14,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:14,702 INFO L82 PathProgramCache]: Analyzing trace with hash -686489837, now seen corresponding path program 1 times [2019-12-07 16:31:14,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:31:14,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679319194] [2019-12-07 16:31:14,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:31:14,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:14,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:14,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679319194] [2019-12-07 16:31:14,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:31:14,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 16:31:14,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171713405] [2019-12-07 16:31:14,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 16:31:14,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:31:14,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 16:31:14,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:31:14,772 INFO L87 Difference]: Start difference. First operand 95 states and 123 transitions. Second operand 8 states. [2019-12-07 16:31:14,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:14,877 INFO L93 Difference]: Finished difference Result 123 states and 151 transitions. [2019-12-07 16:31:14,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 16:31:14,877 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-12-07 16:31:14,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:14,878 INFO L225 Difference]: With dead ends: 123 [2019-12-07 16:31:14,878 INFO L226 Difference]: Without dead ends: 123 [2019-12-07 16:31:14,878 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:31:14,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-12-07 16:31:14,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 95. [2019-12-07 16:31:14,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-12-07 16:31:14,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 122 transitions. [2019-12-07 16:31:14,881 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 122 transitions. Word has length 19 [2019-12-07 16:31:14,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:14,881 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 122 transitions. [2019-12-07 16:31:14,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 16:31:14,881 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 122 transitions. [2019-12-07 16:31:14,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 16:31:14,882 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:14,882 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:31:14,882 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:31:14,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:14,882 INFO L82 PathProgramCache]: Analyzing trace with hash 193651633, now seen corresponding path program 1 times [2019-12-07 16:31:14,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:31:14,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079012205] [2019-12-07 16:31:14,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:31:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:14,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:14,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079012205] [2019-12-07 16:31:14,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:31:14,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 16:31:14,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218932278] [2019-12-07 16:31:14,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 16:31:14,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:31:14,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 16:31:14,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:31:14,971 INFO L87 Difference]: Start difference. First operand 95 states and 122 transitions. Second operand 8 states. [2019-12-07 16:31:15,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:15,103 INFO L93 Difference]: Finished difference Result 122 states and 150 transitions. [2019-12-07 16:31:15,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 16:31:15,104 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-12-07 16:31:15,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:15,104 INFO L225 Difference]: With dead ends: 122 [2019-12-07 16:31:15,104 INFO L226 Difference]: Without dead ends: 122 [2019-12-07 16:31:15,105 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:31:15,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-12-07 16:31:15,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 95. [2019-12-07 16:31:15,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-12-07 16:31:15,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 121 transitions. [2019-12-07 16:31:15,107 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 121 transitions. Word has length 20 [2019-12-07 16:31:15,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:15,107 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 121 transitions. [2019-12-07 16:31:15,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 16:31:15,107 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2019-12-07 16:31:15,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 16:31:15,108 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:15,108 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:31:15,108 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:31:15,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:15,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1708233429, now seen corresponding path program 1 times [2019-12-07 16:31:15,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:31:15,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535737108] [2019-12-07 16:31:15,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:31:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:15,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:15,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535737108] [2019-12-07 16:31:15,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:31:15,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 16:31:15,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91281715] [2019-12-07 16:31:15,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 16:31:15,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:31:15,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 16:31:15,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:31:15,183 INFO L87 Difference]: Start difference. First operand 95 states and 121 transitions. Second operand 8 states. [2019-12-07 16:31:15,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:15,328 INFO L93 Difference]: Finished difference Result 114 states and 141 transitions. [2019-12-07 16:31:15,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 16:31:15,329 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-12-07 16:31:15,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:15,329 INFO L225 Difference]: With dead ends: 114 [2019-12-07 16:31:15,330 INFO L226 Difference]: Without dead ends: 114 [2019-12-07 16:31:15,330 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-12-07 16:31:15,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-12-07 16:31:15,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 95. [2019-12-07 16:31:15,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-12-07 16:31:15,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 120 transitions. [2019-12-07 16:31:15,332 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 120 transitions. Word has length 21 [2019-12-07 16:31:15,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:15,332 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 120 transitions. [2019-12-07 16:31:15,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 16:31:15,333 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 120 transitions. [2019-12-07 16:31:15,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 16:31:15,333 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:15,333 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:31:15,334 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:31:15,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:15,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1742892950, now seen corresponding path program 1 times [2019-12-07 16:31:15,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:31:15,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126131530] [2019-12-07 16:31:15,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:31:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:15,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:15,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126131530] [2019-12-07 16:31:15,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960970756] [2019-12-07 16:31:15,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/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 [2019-12-07 16:31:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:15,451 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-07 16:31:15,452 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:31:15,925 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:15,926 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:31:16,839 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@51a2482e [2019-12-07 16:31:16,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [873379885] [2019-12-07 16:31:16,840 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-12-07 16:31:16,840 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:31:16,840 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 16:31:16,840 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 16:31:16,840 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 16:31:16,852 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@51a2482e at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker.assertLhs(IncrementalPlicationChecker.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ArrayIndexEqualityManager.(ArrayIndexEqualityManager.java:91) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:555) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:428) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:234) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.quantifier(PartialQuantifierElimination.java:146) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:279) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 16:31:16,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:31:16,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-12-07 16:31:16,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004072737] [2019-12-07 16:31:16,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 16:31:16,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:31:16,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 16:31:16,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=619, Unknown=0, NotChecked=0, Total=702 [2019-12-07 16:31:16,855 INFO L87 Difference]: Start difference. First operand 95 states and 120 transitions. Second operand 10 states. [2019-12-07 16:31:16,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 16:31:17,056 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:31:17,056 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@51a2482e at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:127) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:60) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 16:31:17,063 INFO L168 Benchmark]: Toolchain (without parser) took 10301.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.6 MB). Free memory was 935.4 MB in the beginning and 1.0 GB in the end (delta: -70.6 MB). Peak memory consumption was 126.0 MB. Max. memory is 11.5 GB. [2019-12-07 16:31:17,063 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:31:17,064 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 935.4 MB in the beginning and 1.1 GB in the end (delta: -157.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-12-07 16:31:17,065 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.23 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:31:17,065 INFO L168 Benchmark]: Boogie Preprocessor took 18.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:31:17,066 INFO L168 Benchmark]: RCFGBuilder took 292.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. [2019-12-07 16:31:17,068 INFO L168 Benchmark]: TraceAbstraction took 9635.06 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 86.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.1 MB). Peak memory consumption was 135.6 MB. Max. memory is 11.5 GB. [2019-12-07 16:31:17,074 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 319.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 935.4 MB in the beginning and 1.1 GB in the end (delta: -157.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.23 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 292.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9635.06 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 86.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.1 MB). Peak memory consumption was 135.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@51a2482e de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@51a2482e: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 16:31:18,464 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:31:18,466 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:31:18,473 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:31:18,474 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:31:18,474 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:31:18,475 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:31:18,477 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:31:18,478 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:31:18,479 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:31:18,479 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:31:18,480 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:31:18,480 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:31:18,481 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:31:18,482 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:31:18,482 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:31:18,483 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:31:18,483 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:31:18,485 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:31:18,486 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:31:18,488 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:31:18,488 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:31:18,489 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:31:18,490 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:31:18,492 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:31:18,492 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:31:18,492 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:31:18,493 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:31:18,493 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:31:18,494 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:31:18,494 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:31:18,494 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:31:18,495 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:31:18,495 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:31:18,496 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:31:18,496 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:31:18,496 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:31:18,497 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:31:18,497 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:31:18,497 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:31:18,498 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:31:18,498 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-12-07 16:31:18,508 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:31:18,508 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:31:18,509 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 16:31:18,509 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 16:31:18,509 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 16:31:18,509 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 16:31:18,509 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 16:31:18,509 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 16:31:18,510 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 16:31:18,510 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:31:18,510 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:31:18,510 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:31:18,510 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:31:18,511 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 16:31:18,511 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:31:18,511 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:31:18,511 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:31:18,511 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 16:31:18,511 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 16:31:18,511 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 16:31:18,511 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:31:18,512 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 16:31:18,512 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 16:31:18,512 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 16:31:18,512 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:31:18,512 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:31:18,512 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:31:18,512 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:31:18,512 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:31:18,513 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:31:18,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:31:18,513 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:31:18,513 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:31:18,513 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 16:31:18,513 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 16:31:18,513 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:31:18,513 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 16:31:18,514 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/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 -> 61cac7be0490384ca2e2fa5b07a6c43e88983407 [2019-12-07 16:31:18,675 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:31:18,682 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:31:18,685 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:31:18,686 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:31:18,686 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:31:18,686 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/../../sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i [2019-12-07 16:31:18,726 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/data/b9b83f576/77bf4ec599b543559691abc24c3aeef9/FLAG3405ede19 [2019-12-07 16:31:19,182 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:31:19,183 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i [2019-12-07 16:31:19,192 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/data/b9b83f576/77bf4ec599b543559691abc24c3aeef9/FLAG3405ede19 [2019-12-07 16:31:19,540 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/data/b9b83f576/77bf4ec599b543559691abc24c3aeef9 [2019-12-07 16:31:19,542 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:31:19,543 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:31:19,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:31:19,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:31:19,546 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:31:19,546 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:31:19" (1/1) ... [2019-12-07 16:31:19,548 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69f144dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:19, skipping insertion in model container [2019-12-07 16:31:19,548 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:31:19" (1/1) ... [2019-12-07 16:31:19,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:31:19,576 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:31:19,781 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:31:19,787 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:31:19,816 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:31:19,847 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:31:19,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:19 WrapperNode [2019-12-07 16:31:19,848 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:31:19,848 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:31:19,849 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:31:19,849 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:31:19,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:19" (1/1) ... [2019-12-07 16:31:19,865 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:19" (1/1) ... [2019-12-07 16:31:19,879 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:31:19,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:31:19,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:31:19,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:31:19,885 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:19" (1/1) ... [2019-12-07 16:31:19,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:19" (1/1) ... [2019-12-07 16:31:19,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:19" (1/1) ... [2019-12-07 16:31:19,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:19" (1/1) ... [2019-12-07 16:31:19,894 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:19" (1/1) ... [2019-12-07 16:31:19,897 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:19" (1/1) ... [2019-12-07 16:31:19,899 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:19" (1/1) ... [2019-12-07 16:31:19,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:31:19,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:31:19,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:31:19,901 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:31:19,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/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 [2019-12-07 16:31:19,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 16:31:19,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 16:31:19,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 16:31:19,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 16:31:19,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:31:19,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:31:20,210 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:31:20,210 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-07 16:31:20,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:31:20 BoogieIcfgContainer [2019-12-07 16:31:20,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:31:20,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:31:20,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:31:20,215 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:31:20,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:31:19" (1/3) ... [2019-12-07 16:31:20,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2895ef14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:31:20, skipping insertion in model container [2019-12-07 16:31:20,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:19" (2/3) ... [2019-12-07 16:31:20,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2895ef14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:31:20, skipping insertion in model container [2019-12-07 16:31:20,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:31:20" (3/3) ... [2019-12-07 16:31:20,218 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_extends_pointer.i [2019-12-07 16:31:20,227 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:31:20,233 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2019-12-07 16:31:20,243 INFO L249 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2019-12-07 16:31:20,257 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:31:20,257 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 16:31:20,257 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:31:20,257 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:31:20,257 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:31:20,257 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:31:20,257 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:31:20,257 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:31:20,269 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2019-12-07 16:31:20,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 16:31:20,273 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:20,274 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 16:31:20,274 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:31:20,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:20,279 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2019-12-07 16:31:20,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:31:20,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965877361] [2019-12-07 16:31:20,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/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 [2019-12-07 16:31:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:20,330 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 16:31:20,334 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:31:20,374 INFO L377 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 [2019-12-07 16:31:20,375 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:20,381 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:20,382 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:20,382 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 16:31:20,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:20,389 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:31:20,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:20,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965877361] [2019-12-07 16:31:20,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:31:20,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 16:31:20,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609289059] [2019-12-07 16:31:20,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:31:20,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:31:20,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:31:20,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:31:20,408 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 3 states. [2019-12-07 16:31:20,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:20,518 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2019-12-07 16:31:20,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:31:20,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 16:31:20,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:20,525 INFO L225 Difference]: With dead ends: 60 [2019-12-07 16:31:20,526 INFO L226 Difference]: Without dead ends: 56 [2019-12-07 16:31:20,527 INFO L630 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 [2019-12-07 16:31:20,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-07 16:31:20,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-12-07 16:31:20,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-07 16:31:20,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2019-12-07 16:31:20,549 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 3 [2019-12-07 16:31:20,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:20,549 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2019-12-07 16:31:20,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:31:20,550 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2019-12-07 16:31:20,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 16:31:20,550 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:20,550 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 16:31:20,750 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 16:31:20,751 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:31:20,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:20,751 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-12-07 16:31:20,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:31:20,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [125150492] [2019-12-07 16:31:20,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/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 [2019-12-07 16:31:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:20,780 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 16:31:20,781 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:31:20,790 INFO L377 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 [2019-12-07 16:31:20,790 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:20,796 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:20,796 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:20,796 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 16:31:20,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:20,809 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:31:20,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:20,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [125150492] [2019-12-07 16:31:20,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:31:20,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 16:31:20,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022374107] [2019-12-07 16:31:20,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:31:20,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:31:20,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:31:20,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:31:20,847 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 4 states. [2019-12-07 16:31:21,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:21,018 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2019-12-07 16:31:21,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:31:21,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-12-07 16:31:21,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:21,020 INFO L225 Difference]: With dead ends: 51 [2019-12-07 16:31:21,020 INFO L226 Difference]: Without dead ends: 51 [2019-12-07 16:31:21,020 INFO L630 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 [2019-12-07 16:31:21,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-12-07 16:31:21,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2019-12-07 16:31:21,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-07 16:31:21,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2019-12-07 16:31:21,024 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 3 [2019-12-07 16:31:21,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:21,025 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2019-12-07 16:31:21,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:31:21,025 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2019-12-07 16:31:21,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 16:31:21,025 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:21,025 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:31:21,226 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 16:31:21,227 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:31:21,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:21,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1837114892, now seen corresponding path program 1 times [2019-12-07 16:31:21,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:31:21,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092134628] [2019-12-07 16:31:21,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/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 [2019-12-07 16:31:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:21,306 INFO L264 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 16:31:21,307 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:31:21,311 INFO L377 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 [2019-12-07 16:31:21,311 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:21,313 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:21,313 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:21,313 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 16:31:21,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:21,324 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:31:21,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:21,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092134628] [2019-12-07 16:31:21,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:31:21,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 16:31:21,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293191506] [2019-12-07 16:31:21,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:31:21,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:31:21,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:31:21,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:31:21,329 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 4 states. [2019-12-07 16:31:21,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:21,466 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-12-07 16:31:21,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:31:21,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 16:31:21,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:21,468 INFO L225 Difference]: With dead ends: 55 [2019-12-07 16:31:21,468 INFO L226 Difference]: Without dead ends: 55 [2019-12-07 16:31:21,469 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:31:21,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-07 16:31:21,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2019-12-07 16:31:21,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 16:31:21,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2019-12-07 16:31:21,475 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 9 [2019-12-07 16:31:21,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:21,475 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2019-12-07 16:31:21,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:31:21,475 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2019-12-07 16:31:21,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 16:31:21,476 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:21,476 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:31:21,677 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 16:31:21,678 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:31:21,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:21,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1837114893, now seen corresponding path program 1 times [2019-12-07 16:31:21,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:31:21,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1882571832] [2019-12-07 16:31:21,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/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 [2019-12-07 16:31:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:21,751 INFO L264 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 16:31:21,752 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:31:21,757 INFO L377 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 [2019-12-07 16:31:21,757 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:21,762 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:21,762 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:21,762 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 16:31:21,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:21,780 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:31:21,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:21,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1882571832] [2019-12-07 16:31:21,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:31:21,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 16:31:21,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466633297] [2019-12-07 16:31:21,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:31:21,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:31:21,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:31:21,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:31:21,846 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 6 states. [2019-12-07 16:31:22,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:22,164 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2019-12-07 16:31:22,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:31:22,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-12-07 16:31:22,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:22,166 INFO L225 Difference]: With dead ends: 82 [2019-12-07 16:31:22,166 INFO L226 Difference]: Without dead ends: 82 [2019-12-07 16:31:22,166 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:31:22,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-12-07 16:31:22,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 63. [2019-12-07 16:31:22,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 16:31:22,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2019-12-07 16:31:22,171 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 9 [2019-12-07 16:31:22,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:22,171 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2019-12-07 16:31:22,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:31:22,172 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2019-12-07 16:31:22,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 16:31:22,172 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:22,172 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:31:22,372 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 16:31:22,374 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:31:22,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:22,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1115985897, now seen corresponding path program 1 times [2019-12-07 16:31:22,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:31:22,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470993467] [2019-12-07 16:31:22,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/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 [2019-12-07 16:31:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:22,466 INFO L264 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 16:31:22,467 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:31:22,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:22,476 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:31:22,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:22,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470993467] [2019-12-07 16:31:22,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:31:22,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 16:31:22,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851810251] [2019-12-07 16:31:22,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:31:22,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:31:22,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:31:22,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:31:22,480 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand 4 states. [2019-12-07 16:31:22,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:22,604 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2019-12-07 16:31:22,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:31:22,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 16:31:22,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:22,605 INFO L225 Difference]: With dead ends: 86 [2019-12-07 16:31:22,605 INFO L226 Difference]: Without dead ends: 86 [2019-12-07 16:31:22,606 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:31:22,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-12-07 16:31:22,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 63. [2019-12-07 16:31:22,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 16:31:22,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2019-12-07 16:31:22,610 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 10 [2019-12-07 16:31:22,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:22,610 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2019-12-07 16:31:22,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:31:22,610 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2019-12-07 16:31:22,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 16:31:22,611 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:22,611 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:31:22,811 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 16:31:22,812 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:31:22,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:22,813 INFO L82 PathProgramCache]: Analyzing trace with hash 236809714, now seen corresponding path program 1 times [2019-12-07 16:31:22,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:31:22,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [449726392] [2019-12-07 16:31:22,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/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 [2019-12-07 16:31:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:22,910 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 16:31:22,911 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:31:22,918 INFO L377 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 [2019-12-07 16:31:22,918 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:22,925 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:22,927 INFO L377 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 [2019-12-07 16:31:22,928 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:22,933 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:22,934 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:22,934 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 16:31:22,955 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:22,955 INFO L377 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 [2019-12-07 16:31:22,957 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:22,966 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:22,970 INFO L377 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 14 treesize of output 16 [2019-12-07 16:31:22,970 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:22,983 INFO L614 ElimStorePlain]: treesize reduction 4, result has 77.8 percent of original size [2019-12-07 16:31:22,984 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:31:22,984 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:14 [2019-12-07 16:31:23,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:23,005 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:31:23,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:31:23,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:23,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [449726392] [2019-12-07 16:31:23,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:31:23,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 16:31:23,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957070915] [2019-12-07 16:31:23,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:31:23,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:31:23,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:31:23,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:31:23,165 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand 6 states. [2019-12-07 16:31:23,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:23,560 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2019-12-07 16:31:23,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:31:23,561 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-12-07 16:31:23,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:23,562 INFO L225 Difference]: With dead ends: 63 [2019-12-07 16:31:23,562 INFO L226 Difference]: Without dead ends: 63 [2019-12-07 16:31:23,562 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:31:23,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-12-07 16:31:23,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2019-12-07 16:31:23,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 16:31:23,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2019-12-07 16:31:23,567 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 11 [2019-12-07 16:31:23,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:23,568 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2019-12-07 16:31:23,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:31:23,568 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2019-12-07 16:31:23,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 16:31:23,569 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:23,569 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:31:23,769 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 16:31:23,771 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:31:23,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:23,772 INFO L82 PathProgramCache]: Analyzing trace with hash -259096067, now seen corresponding path program 1 times [2019-12-07 16:31:23,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:31:23,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074083092] [2019-12-07 16:31:23,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/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 [2019-12-07 16:31:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:23,854 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 16:31:23,855 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:31:23,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:23,881 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:31:23,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:23,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2074083092] [2019-12-07 16:31:23,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:31:23,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 6 [2019-12-07 16:31:23,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301994519] [2019-12-07 16:31:23,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:31:23,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:31:23,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:31:23,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:31:23,903 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand 7 states. [2019-12-07 16:31:24,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:24,081 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2019-12-07 16:31:24,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 16:31:24,082 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-12-07 16:31:24,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:24,082 INFO L225 Difference]: With dead ends: 82 [2019-12-07 16:31:24,082 INFO L226 Difference]: Without dead ends: 82 [2019-12-07 16:31:24,083 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:31:24,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-12-07 16:31:24,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2019-12-07 16:31:24,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-07 16:31:24,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2019-12-07 16:31:24,087 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 14 [2019-12-07 16:31:24,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:24,087 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2019-12-07 16:31:24,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:31:24,087 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2019-12-07 16:31:24,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 16:31:24,088 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:24,088 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:31:24,288 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 16:31:24,290 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:31:24,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:24,291 INFO L82 PathProgramCache]: Analyzing trace with hash -259107052, now seen corresponding path program 1 times [2019-12-07 16:31:24,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:31:24,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [967818792] [2019-12-07 16:31:24,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/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 [2019-12-07 16:31:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:24,343 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 16:31:24,345 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:31:24,354 INFO L377 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 13 treesize of output 9 [2019-12-07 16:31:24,354 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:24,366 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:24,369 INFO L377 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 15 treesize of output 11 [2019-12-07 16:31:24,369 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:24,378 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:24,378 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:24,378 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2019-12-07 16:31:24,417 INFO L377 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 7 [2019-12-07 16:31:24,417 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:24,428 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:24,431 INFO L377 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 21 treesize of output 9 [2019-12-07 16:31:24,431 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:24,438 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:24,438 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:24,438 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:12 [2019-12-07 16:31:24,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:24,457 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:31:24,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:24,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [967818792] [2019-12-07 16:31:24,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:31:24,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 9 [2019-12-07 16:31:24,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447761924] [2019-12-07 16:31:24,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 16:31:24,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:31:24,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 16:31:24,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:31:24,564 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand 9 states. [2019-12-07 16:31:24,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:24,996 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2019-12-07 16:31:24,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:31:24,997 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2019-12-07 16:31:24,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:24,998 INFO L225 Difference]: With dead ends: 75 [2019-12-07 16:31:24,998 INFO L226 Difference]: Without dead ends: 75 [2019-12-07 16:31:24,999 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:31:25,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-07 16:31:25,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2019-12-07 16:31:25,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-07 16:31:25,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2019-12-07 16:31:25,003 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 14 [2019-12-07 16:31:25,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:25,003 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2019-12-07 16:31:25,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 16:31:25,003 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2019-12-07 16:31:25,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 16:31:25,004 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:25,004 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:31:25,204 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 16:31:25,206 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:31:25,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:25,206 INFO L82 PathProgramCache]: Analyzing trace with hash -991464834, now seen corresponding path program 1 times [2019-12-07 16:31:25,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:31:25,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1863814170] [2019-12-07 16:31:25,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/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 [2019-12-07 16:31:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:25,312 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 16:31:25,313 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:31:25,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:25,343 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:31:25,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:31:25,431 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 12 [2019-12-07 16:31:25,431 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:31:25,443 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 [2019-12-07 16:31:25,443 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:31:25,483 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:25,484 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 16:31:25,484 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:25 [2019-12-07 16:31:25,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:25,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1863814170] [2019-12-07 16:31:25,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:31:25,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 16:31:25,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750226953] [2019-12-07 16:31:25,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 16:31:25,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:31:25,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 16:31:25,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:31:25,577 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. Second operand 8 states. [2019-12-07 16:31:25,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:25,922 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2019-12-07 16:31:25,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:31:25,923 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-12-07 16:31:25,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:25,923 INFO L225 Difference]: With dead ends: 74 [2019-12-07 16:31:25,923 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 16:31:25,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:31:25,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 16:31:25,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2019-12-07 16:31:25,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 16:31:25,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2019-12-07 16:31:25,926 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 15 [2019-12-07 16:31:25,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:25,926 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2019-12-07 16:31:25,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 16:31:25,927 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2019-12-07 16:31:25,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 16:31:25,927 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:25,927 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:31:26,127 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 16:31:26,129 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:31:26,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:26,130 INFO L82 PathProgramCache]: Analyzing trace with hash -674593741, now seen corresponding path program 1 times [2019-12-07 16:31:26,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:31:26,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [600005443] [2019-12-07 16:31:26,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/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 [2019-12-07 16:31:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:26,254 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 16:31:26,255 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:31:26,260 INFO L377 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 [2019-12-07 16:31:26,261 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:26,267 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:26,269 INFO L377 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 [2019-12-07 16:31:26,269 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:26,274 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:26,274 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:26,275 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2019-12-07 16:31:26,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:31:26,287 INFO L377 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 [2019-12-07 16:31:26,287 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:26,299 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:26,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:31:26,303 INFO L377 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 [2019-12-07 16:31:26,304 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:26,313 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:26,314 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:26,314 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2019-12-07 16:31:26,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:31:26,336 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:31:26,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:31:26,338 INFO L377 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 30 treesize of output 32 [2019-12-07 16:31:26,339 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:26,363 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:26,369 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:31:26,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:31:26,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:31:26,372 INFO L377 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 32 treesize of output 34 [2019-12-07 16:31:26,373 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:26,392 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:26,392 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:26,392 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:53 [2019-12-07 16:31:26,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:31:26,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:31:26,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:31:26,470 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2019-12-07 16:31:26,470 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:26,490 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:26,493 INFO L343 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2019-12-07 16:31:26,493 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 35 treesize of output 15 [2019-12-07 16:31:26,493 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:26,496 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:26,496 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:26,496 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:67, output treesize:7 [2019-12-07 16:31:26,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:26,524 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:31:26,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:26,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [600005443] [2019-12-07 16:31:26,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1376501862] [2019-12-07 16:31:26,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 16:31:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:26,634 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 16:31:26,635 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:31:26,654 INFO L377 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 [2019-12-07 16:31:26,654 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:26,660 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:26,662 INFO L377 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 [2019-12-07 16:31:26,662 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:26,667 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:26,667 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:26,667 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-12-07 16:31:26,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:31:26,696 INFO L377 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 [2019-12-07 16:31:26,696 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:26,709 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:26,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:31:26,713 INFO L377 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 [2019-12-07 16:31:26,713 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:26,722 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:26,723 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:26,723 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2019-12-07 16:31:26,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:31:26,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:31:26,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:31:26,773 INFO L377 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 32 treesize of output 34 [2019-12-07 16:31:26,773 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:26,796 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:26,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:31:26,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:31:26,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:31:26,805 INFO L377 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 30 treesize of output 32 [2019-12-07 16:31:26,806 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:26,822 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:26,822 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:26,822 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:64, output treesize:56 [2019-12-07 16:31:26,928 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 16:31:26,929 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:26,937 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:26,939 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:26,940 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 16:31:26,940 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:26,943 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:26,943 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:26,943 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2019-12-07 16:31:26,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:26,945 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:31:26,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:26,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954585583] [2019-12-07 16:31:26,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:31:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:27,034 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 16:31:27,035 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:31:27,039 INFO L377 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 [2019-12-07 16:31:27,039 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:27,044 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:27,046 INFO L377 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 [2019-12-07 16:31:27,046 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:27,050 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:27,050 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:27,051 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2019-12-07 16:31:27,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:31:27,056 INFO L377 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 [2019-12-07 16:31:27,057 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:27,067 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:27,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:31:27,072 INFO L377 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 [2019-12-07 16:31:27,072 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:27,080 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:27,081 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:27,081 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2019-12-07 16:31:27,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:31:27,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:31:27,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:31:27,090 INFO L377 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 32 treesize of output 34 [2019-12-07 16:31:27,090 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:27,111 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:27,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:31:27,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:31:27,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:31:27,118 INFO L377 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 30 treesize of output 32 [2019-12-07 16:31:27,119 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:27,136 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:27,136 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:27,136 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:53 [2019-12-07 16:31:27,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:31:27,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:31:27,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:31:27,147 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2019-12-07 16:31:27,148 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:27,168 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:27,171 INFO L343 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2019-12-07 16:31:27,171 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 35 treesize of output 15 [2019-12-07 16:31:27,172 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:27,175 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:27,176 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:27,176 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:67, output treesize:7 [2019-12-07 16:31:27,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:27,178 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:31:27,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:27,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 16:31:27,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 9, 6, 8, 6] total 14 [2019-12-07 16:31:27,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918691988] [2019-12-07 16:31:27,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 16:31:27,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:31:27,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 16:31:27,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-07 16:31:27,192 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 14 states. [2019-12-07 16:31:27,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:27,645 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2019-12-07 16:31:27,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 16:31:27,646 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2019-12-07 16:31:27,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:27,646 INFO L225 Difference]: With dead ends: 75 [2019-12-07 16:31:27,646 INFO L226 Difference]: Without dead ends: 75 [2019-12-07 16:31:27,647 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 79 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-12-07 16:31:27,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-07 16:31:27,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2019-12-07 16:31:27,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-07 16:31:27,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2019-12-07 16:31:27,649 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 17 [2019-12-07 16:31:27,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:27,649 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2019-12-07 16:31:27,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 16:31:27,649 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2019-12-07 16:31:27,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 16:31:27,650 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:27,650 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:31:28,251 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 mathsat -unsat_core_generation=3 [2019-12-07 16:31:28,253 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:31:28,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:28,254 INFO L82 PathProgramCache]: Analyzing trace with hash 562429602, now seen corresponding path program 1 times [2019-12-07 16:31:28,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:31:28,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [908915599] [2019-12-07 16:31:28,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/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 [2019-12-07 16:31:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:28,305 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 16:31:28,306 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:31:28,308 INFO L377 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 [2019-12-07 16:31:28,308 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:28,310 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:28,310 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:28,310 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 16:31:28,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:28,352 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:31:28,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:28,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [908915599] [2019-12-07 16:31:28,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1236201676] [2019-12-07 16:31:28,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 16:31:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:28,459 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 16:31:28,460 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:31:30,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:30,509 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:31:30,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:30,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254103902] [2019-12-07 16:31:30,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:31:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:30,547 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 16:31:30,548 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:31:30,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:30,553 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:31:30,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:30,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 16:31:30,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 4] total 11 [2019-12-07 16:31:30,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624226916] [2019-12-07 16:31:30,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 16:31:30,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:31:30,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 16:31:30,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=100, Unknown=1, NotChecked=0, Total=132 [2019-12-07 16:31:30,558 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand 12 states. [2019-12-07 16:31:30,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:30,945 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2019-12-07 16:31:30,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:31:30,946 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-12-07 16:31:30,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:30,946 INFO L225 Difference]: With dead ends: 73 [2019-12-07 16:31:30,946 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 16:31:30,947 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=63, Invalid=176, Unknown=1, NotChecked=0, Total=240 [2019-12-07 16:31:30,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 16:31:30,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-12-07 16:31:30,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 16:31:30,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2019-12-07 16:31:30,950 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 18 [2019-12-07 16:31:30,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:30,950 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2019-12-07 16:31:30,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 16:31:30,950 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2019-12-07 16:31:30,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 16:31:30,951 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:30,951 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:31:31,552 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,14 mathsat -unsat_core_generation=3,15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 16:31:31,553 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:31:31,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:31,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1834342077, now seen corresponding path program 1 times [2019-12-07 16:31:31,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:31:31,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131717397] [2019-12-07 16:31:31,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-12-07 16:31:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:31,652 INFO L264 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 16:31:31,653 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:31:31,663 INFO L377 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 13 treesize of output 9 [2019-12-07 16:31:31,663 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:31,667 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:31,667 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:31,667 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-12-07 16:31:31,688 INFO L377 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 [2019-12-07 16:31:31,688 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:31,689 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:31,689 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:31,690 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-12-07 16:31:31,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:31,696 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:31:31,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:31,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131717397] [2019-12-07 16:31:31,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:31:31,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 9 [2019-12-07 16:31:31,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214615364] [2019-12-07 16:31:31,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 16:31:31,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:31:31,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 16:31:31,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:31:31,731 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 10 states. [2019-12-07 16:31:32,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:32,076 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2019-12-07 16:31:32,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 16:31:32,077 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-12-07 16:31:32,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:32,077 INFO L225 Difference]: With dead ends: 120 [2019-12-07 16:31:32,077 INFO L226 Difference]: Without dead ends: 120 [2019-12-07 16:31:32,078 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-12-07 16:31:32,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-12-07 16:31:32,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 62. [2019-12-07 16:31:32,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 16:31:32,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2019-12-07 16:31:32,080 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 20 [2019-12-07 16:31:32,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:32,081 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2019-12-07 16:31:32,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 16:31:32,081 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2019-12-07 16:31:32,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 16:31:32,081 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:32,081 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:31:32,282 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 16:31:32,283 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:31:32,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:32,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1030029441, now seen corresponding path program 1 times [2019-12-07 16:31:32,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:31:32,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942475608] [2019-12-07 16:31:32,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 16:31:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:32,360 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 16:31:32,362 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:31:32,407 INFO L377 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 13 treesize of output 9 [2019-12-07 16:31:32,407 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:32,420 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:32,421 INFO L534 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. [2019-12-07 16:31:32,421 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2019-12-07 16:31:32,475 INFO L377 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 [2019-12-07 16:31:32,475 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:32,485 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:32,486 INFO L534 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. [2019-12-07 16:31:32,486 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:11 [2019-12-07 16:31:32,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:32,513 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:31:32,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:32,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942475608] [2019-12-07 16:31:32,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:31:32,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 5] imperfect sequences [] total 12 [2019-12-07 16:31:32,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505297325] [2019-12-07 16:31:32,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 16:31:32,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:31:32,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 16:31:32,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-07 16:31:32,583 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand 13 states. [2019-12-07 16:31:33,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:33,554 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2019-12-07 16:31:33,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 16:31:33,555 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2019-12-07 16:31:33,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:33,556 INFO L225 Difference]: With dead ends: 119 [2019-12-07 16:31:33,556 INFO L226 Difference]: Without dead ends: 119 [2019-12-07 16:31:33,556 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2019-12-07 16:31:33,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-12-07 16:31:33,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 62. [2019-12-07 16:31:33,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 16:31:33,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2019-12-07 16:31:33,559 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 21 [2019-12-07 16:31:33,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:33,559 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2019-12-07 16:31:33,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 16:31:33,559 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2019-12-07 16:31:33,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 16:31:33,560 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:33,560 INFO L410 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] [2019-12-07 16:31:33,760 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 16:31:33,760 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:31:33,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:33,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1866141499, now seen corresponding path program 1 times [2019-12-07 16:31:33,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:31:33,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895220456] [2019-12-07 16:31:33,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/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 [2019-12-07 16:31:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:33,814 INFO L264 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 16:31:33,815 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:31:33,821 INFO L377 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 [2019-12-07 16:31:33,821 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:33,826 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:33,826 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:33,826 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 16:31:33,834 INFO L377 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 13 treesize of output 9 [2019-12-07 16:31:33,834 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:33,841 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:33,842 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:33,842 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-12-07 16:31:33,863 INFO L377 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 [2019-12-07 16:31:33,863 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:33,864 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:33,865 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:33,865 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2019-12-07 16:31:33,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:33,872 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:31:33,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:33,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895220456] [2019-12-07 16:31:33,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:31:33,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 9 [2019-12-07 16:31:33,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899768404] [2019-12-07 16:31:33,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 16:31:33,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:31:33,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 16:31:33,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:31:33,916 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 10 states. [2019-12-07 16:31:34,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:34,278 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2019-12-07 16:31:34,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 16:31:34,279 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-12-07 16:31:34,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:34,279 INFO L225 Difference]: With dead ends: 77 [2019-12-07 16:31:34,279 INFO L226 Difference]: Without dead ends: 77 [2019-12-07 16:31:34,280 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-12-07 16:31:34,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-12-07 16:31:34,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 62. [2019-12-07 16:31:34,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 16:31:34,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2019-12-07 16:31:34,281 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 22 [2019-12-07 16:31:34,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:34,281 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2019-12-07 16:31:34,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 16:31:34,281 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2019-12-07 16:31:34,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 16:31:34,282 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:34,282 INFO L410 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] [2019-12-07 16:31:34,482 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 16:31:34,483 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:31:34,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:34,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1388388284, now seen corresponding path program 1 times [2019-12-07 16:31:34,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:31:34,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125062204] [2019-12-07 16:31:34,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-12-07 16:31:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:34,552 INFO L264 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 16:31:34,553 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:31:34,555 INFO L377 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 [2019-12-07 16:31:34,556 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:34,557 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:34,557 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:34,557 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 16:31:34,579 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:34,579 INFO L377 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 [2019-12-07 16:31:34,580 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:34,593 INFO L614 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-12-07 16:31:34,593 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:34,593 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-12-07 16:31:34,605 INFO L377 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 [2019-12-07 16:31:34,605 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:34,612 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:34,613 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:34,613 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-12-07 16:31:34,649 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:34,650 INFO L377 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 50 treesize of output 64 [2019-12-07 16:31:34,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:31:34,651 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:34,661 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:34,661 INFO L534 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. [2019-12-07 16:31:34,661 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:40 [2019-12-07 16:31:50,928 WARN L192 SmtUtils]: Spent 16.24 s on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2019-12-07 16:31:50,928 INFO L343 Elim1Store]: treesize reduction 20, result has 76.5 percent of original size [2019-12-07 16:31:50,929 INFO L377 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 46 treesize of output 91 [2019-12-07 16:31:50,929 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:50,971 INFO L614 ElimStorePlain]: treesize reduction 46, result has 51.6 percent of original size [2019-12-07 16:31:50,971 INFO L534 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. [2019-12-07 16:31:50,971 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:49 [2019-12-07 16:31:51,149 INFO L343 Elim1Store]: treesize reduction 10, result has 75.6 percent of original size [2019-12-07 16:31:51,149 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 52 [2019-12-07 16:31:51,150 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:51,155 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:51,155 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:51,155 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:17 [2019-12-07 16:31:51,179 INFO L377 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 0 case distinctions, treesize of input 21 treesize of output 21 [2019-12-07 16:31:51,180 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:51,188 INFO L614 ElimStorePlain]: treesize reduction 4, result has 76.5 percent of original size [2019-12-07 16:31:51,188 INFO L534 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. [2019-12-07 16:31:51,189 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:13 [2019-12-07 16:31:51,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:51,214 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:31:51,354 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 16:31:51,369 INFO L614 ElimStorePlain]: treesize reduction 12, result has 58.6 percent of original size [2019-12-07 16:31:51,369 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:51,370 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:17 [2019-12-07 16:31:51,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:51,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125062204] [2019-12-07 16:31:51,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [5499773] [2019-12-07 16:31:51,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 16:31:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:51,541 INFO L264 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 16:31:51,542 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:31:51,544 INFO L377 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 [2019-12-07 16:31:51,545 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:51,546 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:51,546 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:51,546 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 16:31:51,553 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:51,553 INFO L377 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 [2019-12-07 16:31:51,553 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:51,557 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:51,557 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:51,557 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2019-12-07 16:31:51,581 INFO L377 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 [2019-12-07 16:31:51,581 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:51,586 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:51,587 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:51,587 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-12-07 16:31:51,639 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:51,639 INFO L377 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 [2019-12-07 16:31:51,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:31:51,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:31:51,640 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 16:31:51,676 INFO L614 ElimStorePlain]: treesize reduction 41, result has 46.8 percent of original size [2019-12-07 16:31:51,676 INFO L534 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. [2019-12-07 16:31:51,677 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:36 [2019-12-07 16:31:51,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:31:51,773 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:51,774 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 91 [2019-12-07 16:31:51,774 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:51,818 INFO L614 ElimStorePlain]: treesize reduction 46, result has 49.5 percent of original size [2019-12-07 16:31:51,818 INFO L534 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. [2019-12-07 16:31:51,818 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-12-07 16:31:52,024 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:52,024 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 52 [2019-12-07 16:31:52,025 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:52,028 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:52,028 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:52,029 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:10 [2019-12-07 16:31:52,054 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:52,055 INFO L377 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 16 treesize of output 32 [2019-12-07 16:31:52,055 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:52,070 INFO L614 ElimStorePlain]: treesize reduction 18, result has 37.9 percent of original size [2019-12-07 16:31:52,071 INFO L534 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. [2019-12-07 16:31:52,071 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2019-12-07 16:31:52,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:52,074 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:31:52,104 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:52,104 INFO L377 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 45 treesize of output 49 [2019-12-07 16:31:52,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:31:52,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:31:52,106 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 16:31:52,115 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:52,115 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 16:31:52,116 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:36 [2019-12-07 16:31:52,198 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 16:31:52,199 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:52,202 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:52,203 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-07 16:31:52,216 INFO L614 ElimStorePlain]: treesize reduction 22, result has 15.4 percent of original size [2019-12-07 16:31:52,216 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:52,216 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:68, output treesize:4 [2019-12-07 16:31:52,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:52,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368859213] [2019-12-07 16:31:52,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:31:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:52,292 INFO L264 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 16:31:52,293 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:31:52,299 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:52,300 INFO L377 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 [2019-12-07 16:31:52,300 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:52,302 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:52,302 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:52,302 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:4 [2019-12-07 16:31:52,306 INFO L377 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 [2019-12-07 16:31:52,306 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:31:52,311 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:52,311 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:31:52,312 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-12-07 16:31:52,375 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:31:52,375 INFO L377 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 [2019-12-07 16:31:52,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:31:52,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:31:52,377 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 16:31:52,406 INFO L614 ElimStorePlain]: treesize reduction 40, result has 45.2 percent of original size [2019-12-07 16:31:52,407 INFO L534 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. [2019-12-07 16:31:52,407 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:33 [2019-12-07 16:32:08,742 WARN L192 SmtUtils]: Spent 16.29 s on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2019-12-07 16:32:08,742 INFO L343 Elim1Store]: treesize reduction 20, result has 76.5 percent of original size [2019-12-07 16:32:08,743 INFO L377 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 46 treesize of output 91 [2019-12-07 16:32:08,743 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:32:08,783 INFO L614 ElimStorePlain]: treesize reduction 46, result has 47.7 percent of original size [2019-12-07 16:32:08,783 INFO L534 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. [2019-12-07 16:32:08,783 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:42 [2019-12-07 16:32:09,031 INFO L343 Elim1Store]: treesize reduction 10, result has 75.6 percent of original size [2019-12-07 16:32:09,032 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 52 [2019-12-07 16:32:09,032 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:32:09,036 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:32:09,036 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:32:09,036 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:10 [2019-12-07 16:32:09,061 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:32:09,061 INFO L377 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 16 treesize of output 32 [2019-12-07 16:32:09,062 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:32:09,076 INFO L614 ElimStorePlain]: treesize reduction 18, result has 37.9 percent of original size [2019-12-07 16:32:09,076 INFO L534 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. [2019-12-07 16:32:09,076 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2019-12-07 16:32:09,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:32:09,078 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:32:09,122 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:32:09,122 INFO L377 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 45 treesize of output 49 [2019-12-07 16:32:09,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:32:09,123 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 16:32:09,130 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:32:09,131 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 16:32:09,131 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:36 [2019-12-07 16:32:09,193 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 10 [2019-12-07 16:32:09,193 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:32:09,194 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:32:09,194 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:32:09,194 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:1 [2019-12-07 16:32:09,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:32:09,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 16:32:09,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12, 10, 12, 10] total 31 [2019-12-07 16:32:09,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434498610] [2019-12-07 16:32:09,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-07 16:32:09,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:32:09,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-07 16:32:09,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=854, Unknown=0, NotChecked=0, Total=992 [2019-12-07 16:32:09,196 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand 32 states. [2019-12-07 16:32:28,830 WARN L192 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2019-12-07 16:32:34,950 WARN L192 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2019-12-07 16:32:57,703 WARN L192 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2019-12-07 16:32:59,785 WARN L192 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2019-12-07 16:33:00,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:33:00,123 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2019-12-07 16:33:00,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 16:33:00,124 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 23 [2019-12-07 16:33:00,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:33:00,124 INFO L225 Difference]: With dead ends: 101 [2019-12-07 16:33:00,124 INFO L226 Difference]: Without dead ends: 101 [2019-12-07 16:33:00,126 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 94 SyntacticMatches, 10 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1028 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=630, Invalid=2562, Unknown=0, NotChecked=0, Total=3192 [2019-12-07 16:33:00,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-12-07 16:33:00,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 67. [2019-12-07 16:33:00,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-12-07 16:33:00,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2019-12-07 16:33:00,128 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 23 [2019-12-07 16:33:00,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:33:00,129 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2019-12-07 16:33:00,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-07 16:33:00,129 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2019-12-07 16:33:00,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 16:33:00,130 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:33:00,130 INFO L410 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] [2019-12-07 16:33:00,731 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3,22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 16:33:00,732 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:33:00,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:33:00,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1388388283, now seen corresponding path program 1 times [2019-12-07 16:33:00,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:33:00,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1706541150] [2019-12-07 16:33:00,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-12-07 16:33:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:33:00,810 INFO L264 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 16:33:00,811 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:33:00,815 INFO L377 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 [2019-12-07 16:33:00,815 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:00,821 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:00,823 INFO L377 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 [2019-12-07 16:33:00,823 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:00,828 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:00,829 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:33:00,829 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 16:33:00,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:33:00,847 INFO L377 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 12 treesize of output 14 [2019-12-07 16:33:00,847 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:00,856 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:00,863 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:00,863 INFO L377 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 [2019-12-07 16:33:00,863 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:00,871 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:00,871 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:33:00,872 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-12-07 16:33:00,890 INFO L377 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 [2019-12-07 16:33:00,891 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:00,907 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:00,910 INFO L377 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 [2019-12-07 16:33:00,910 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:00,924 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:00,924 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:33:00,924 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2019-12-07 16:33:00,952 INFO L377 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 27 treesize of output 22 [2019-12-07 16:33:00,953 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:00,971 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:00,974 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 34 [2019-12-07 16:33:00,974 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:00,989 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:00,989 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:33:00,989 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:59 [2019-12-07 16:33:01,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:33:01,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:33:01,027 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:01,027 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 48 [2019-12-07 16:33:01,028 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:01,053 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:01,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:33:01,058 INFO L377 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 36 [2019-12-07 16:33:01,059 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:01,079 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:01,080 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:33:01,080 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:79 [2019-12-07 16:33:01,180 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:01,181 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 29 [2019-12-07 16:33:01,181 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:01,197 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:01,199 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 16:33:01,199 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:01,207 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:01,207 INFO L534 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. [2019-12-07 16:33:01,207 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:20 [2019-12-07 16:33:01,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:33:01,271 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:33:01,777 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:01,891 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-12-07 16:33:01,891 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:01,899 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:02,999 WARN L192 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2019-12-07 16:33:02,999 INFO L614 ElimStorePlain]: treesize reduction 59, result has 54.3 percent of original size [2019-12-07 16:33:03,008 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:03,115 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-12-07 16:33:03,115 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:03,116 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 16:33:03,116 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:133, output treesize:69 [2019-12-07 16:33:03,356 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-12-07 16:33:03,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:33:03,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:33:03,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:33:03,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:33:03,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:33:03,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:33:03,683 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2019-12-07 16:33:03,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:33:03,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1706541150] [2019-12-07 16:33:03,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [269154460] [2019-12-07 16:33:03,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 16:33:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:33:04,037 INFO L264 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 16:33:04,038 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:33:04,041 INFO L377 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 [2019-12-07 16:33:04,042 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:04,049 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:04,051 INFO L377 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 [2019-12-07 16:33:04,051 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:04,058 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:04,058 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:33:04,059 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 16:33:04,067 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:04,068 INFO L377 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 [2019-12-07 16:33:04,068 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:04,077 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:04,079 INFO L377 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 12 treesize of output 14 [2019-12-07 16:33:04,080 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:04,088 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:04,088 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:33:04,088 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-12-07 16:33:04,093 INFO L377 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 [2019-12-07 16:33:04,093 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:04,109 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:04,112 INFO L377 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 [2019-12-07 16:33:04,112 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:04,125 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:04,125 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:33:04,126 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2019-12-07 16:33:04,132 INFO L377 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 27 treesize of output 22 [2019-12-07 16:33:04,132 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:04,149 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:04,151 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 36 [2019-12-07 16:33:04,152 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:04,166 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:04,166 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:33:04,166 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:57 [2019-12-07 16:33:04,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:33:04,187 INFO L377 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 36 [2019-12-07 16:33:04,188 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:04,221 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:04,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:33:04,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:33:04,226 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:04,226 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 48 [2019-12-07 16:33:04,227 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:04,254 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:04,254 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:33:04,254 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:77 [2019-12-07 16:33:04,282 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:04,283 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 29 [2019-12-07 16:33:04,283 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:04,296 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:04,299 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 16:33:04,299 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:04,308 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:04,308 INFO L534 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. [2019-12-07 16:33:04,309 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:20 [2019-12-07 16:33:04,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:33:04,342 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:33:04,405 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:06,846 WARN L192 SmtUtils]: Spent 2.44 s on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-12-07 16:33:06,847 INFO L614 ElimStorePlain]: treesize reduction 59, result has 63.6 percent of original size [2019-12-07 16:33:06,857 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:06,942 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:06,950 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:07,082 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-12-07 16:33:07,082 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:07,082 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 16:33:07,082 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:133, output treesize:69 [2019-12-07 16:33:07,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:33:07,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:33:07,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:33:07,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:33:07,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:33:07,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:33:07,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987899967] [2019-12-07 16:33:07,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:33:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:33:07,437 INFO L264 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 16:33:07,438 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:33:07,441 INFO L377 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 [2019-12-07 16:33:07,441 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:07,445 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:07,445 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:33:07,445 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 16:33:07,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:33:07,499 INFO L377 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 12 treesize of output 14 [2019-12-07 16:33:07,500 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:07,508 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:07,514 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:07,514 INFO L377 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 [2019-12-07 16:33:07,514 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:07,521 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:07,521 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:33:07,521 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-12-07 16:33:07,564 INFO L377 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 [2019-12-07 16:33:07,564 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:07,579 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:07,582 INFO L377 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 [2019-12-07 16:33:07,582 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:07,594 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:07,594 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:33:07,594 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2019-12-07 16:33:07,666 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:07,666 INFO L377 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 56 treesize of output 62 [2019-12-07 16:33:07,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:33:07,667 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:07,683 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:07,685 INFO L377 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 27 treesize of output 22 [2019-12-07 16:33:07,686 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:07,698 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:07,698 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:33:07,698 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:54 [2019-12-07 16:33:07,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:33:07,778 INFO L377 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 36 [2019-12-07 16:33:07,778 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:07,807 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:07,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:33:07,841 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:07,841 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 86 [2019-12-07 16:33:07,841 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:07,899 INFO L614 ElimStorePlain]: treesize reduction 40, result has 65.5 percent of original size [2019-12-07 16:33:07,899 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:33:07,900 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:82, output treesize:76 [2019-12-07 16:33:08,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:33:08,163 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:08,163 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 57 [2019-12-07 16:33:08,164 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:08,187 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:08,190 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-12-07 16:33:08,190 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 15 [2019-12-07 16:33:08,191 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:08,197 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:08,197 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:33:08,198 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:90, output treesize:22 [2019-12-07 16:33:08,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:33:08,250 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:33:08,335 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:08,458 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-12-07 16:33:08,458 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:08,463 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:08,973 WARN L192 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-12-07 16:33:08,973 INFO L614 ElimStorePlain]: treesize reduction 59, result has 54.3 percent of original size [2019-12-07 16:33:08,980 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:09,098 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-12-07 16:33:09,099 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:09,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:33:09,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:33:09,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:33:09,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:33:09,103 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-12-07 16:33:09,103 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:133, output treesize:58 [2019-12-07 16:33:09,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:33:09,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:33:09,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:33:09,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:33:09,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:33:09,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:33:09,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:33:09,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:33:09,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:33:09,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:33:09,728 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2019-12-07 16:33:09,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 16:33:09,972 INFO L377 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 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 16:33:09,972 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:09,989 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 9 [2019-12-07 16:33:09,989 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:10,001 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 9 [2019-12-07 16:33:10,001 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:10,015 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:10,016 INFO L377 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 [2019-12-07 16:33:10,016 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:10,038 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:10,038 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 16:33:10,039 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:83, output treesize:20 [2019-12-07 16:33:10,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:33:10,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 16:33:10,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10, 9, 11, 10] total 28 [2019-12-07 16:33:10,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131543695] [2019-12-07 16:33:10,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 16:33:10,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:33:10,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 16:33:10,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=666, Unknown=0, NotChecked=0, Total=812 [2019-12-07 16:33:10,199 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand 29 states. [2019-12-07 16:33:11,101 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-12-07 16:33:11,720 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-12-07 16:33:11,890 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-12-07 16:33:12,037 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-12-07 16:33:12,471 WARN L192 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-12-07 16:33:13,185 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-12-07 16:33:13,373 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-12-07 16:33:14,242 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 33 [2019-12-07 16:33:16,991 WARN L192 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2019-12-07 16:33:17,536 WARN L192 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 21 [2019-12-07 16:33:18,452 WARN L192 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 32 [2019-12-07 16:33:18,781 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 26 [2019-12-07 16:33:19,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:33:19,818 INFO L93 Difference]: Finished difference Result 137 states and 150 transitions. [2019-12-07 16:33:19,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 16:33:19,819 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 23 [2019-12-07 16:33:19,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:33:19,820 INFO L225 Difference]: With dead ends: 137 [2019-12-07 16:33:19,820 INFO L226 Difference]: Without dead ends: 137 [2019-12-07 16:33:19,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 95 SyntacticMatches, 10 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=785, Invalid=2077, Unknown=0, NotChecked=0, Total=2862 [2019-12-07 16:33:19,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-12-07 16:33:19,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 84. [2019-12-07 16:33:19,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-07 16:33:19,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 101 transitions. [2019-12-07 16:33:19,823 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 101 transitions. Word has length 23 [2019-12-07 16:33:19,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:33:19,823 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 101 transitions. [2019-12-07 16:33:19,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 16:33:19,823 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2019-12-07 16:33:19,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 16:33:19,824 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:33:19,824 INFO L410 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] [2019-12-07 16:33:20,425 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3,24 cvc4 --incremental --print-success --lang smt --rewrite-divk,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:33:20,426 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:33:20,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:33:20,426 INFO L82 PathProgramCache]: Analyzing trace with hash -90364751, now seen corresponding path program 1 times [2019-12-07 16:33:20,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:33:20,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1534322752] [2019-12-07 16:33:20,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/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 [2019-12-07 16:33:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:33:20,504 INFO L264 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 16:33:20,505 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:33:20,508 INFO L377 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 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 16:33:20,508 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:20,511 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:20,512 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:33:20,512 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2019-12-07 16:33:20,527 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:20,527 INFO L377 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 [2019-12-07 16:33:20,527 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:20,531 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:20,531 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:33:20,531 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:9 [2019-12-07 16:33:20,540 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2019-12-07 16:33:20,540 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:20,547 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:20,547 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:33:20,547 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-12-07 16:33:20,583 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:20,584 INFO L377 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 [2019-12-07 16:33:20,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:33:20,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:33:20,584 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 16:33:20,613 INFO L614 ElimStorePlain]: treesize reduction 37, result has 44.8 percent of original size [2019-12-07 16:33:20,613 INFO L534 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. [2019-12-07 16:33:20,613 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2019-12-07 16:33:36,867 WARN L192 SmtUtils]: Spent 16.23 s on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2019-12-07 16:33:36,867 INFO L343 Elim1Store]: treesize reduction 20, result has 76.5 percent of original size [2019-12-07 16:33:36,867 INFO L377 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 43 treesize of output 88 [2019-12-07 16:33:36,868 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:36,910 INFO L614 ElimStorePlain]: treesize reduction 46, result has 45.9 percent of original size [2019-12-07 16:33:36,911 INFO L534 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. [2019-12-07 16:33:36,911 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2019-12-07 16:33:37,044 INFO L343 Elim1Store]: treesize reduction 10, result has 75.6 percent of original size [2019-12-07 16:33:37,044 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2019-12-07 16:33:37,044 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:37,048 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:37,048 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:33:37,048 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:4 [2019-12-07 16:33:37,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:33:37,076 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:33:37,153 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 16:33:37,171 INFO L614 ElimStorePlain]: treesize reduction 26, result has 13.3 percent of original size [2019-12-07 16:33:37,172 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:33:37,172 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:4 [2019-12-07 16:33:37,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:33:37,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1534322752] [2019-12-07 16:33:37,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1768003072] [2019-12-07 16:33:37,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/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 [2019-12-07 16:33:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:33:37,343 INFO L264 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 16:33:37,344 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:33:37,347 INFO L377 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 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 16:33:37,347 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:37,350 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:37,350 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:33:37,350 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2019-12-07 16:33:37,356 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:37,356 INFO L377 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 [2019-12-07 16:33:37,356 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:37,361 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:37,361 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:33:37,361 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:12 [2019-12-07 16:33:37,386 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2019-12-07 16:33:37,386 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:37,393 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:37,393 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:33:37,393 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-12-07 16:33:37,447 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:37,448 INFO L377 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 [2019-12-07 16:33:37,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:33:37,448 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:37,458 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:37,458 INFO L534 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. [2019-12-07 16:33:37,458 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2019-12-07 16:33:37,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:33:37,547 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:37,547 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 88 [2019-12-07 16:33:37,548 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:37,584 INFO L614 ElimStorePlain]: treesize reduction 46, result has 47.7 percent of original size [2019-12-07 16:33:37,585 INFO L534 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. [2019-12-07 16:33:37,585 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:42 [2019-12-07 16:33:37,728 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:37,728 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 49 [2019-12-07 16:33:37,729 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:37,732 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:37,732 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:33:37,732 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:4 [2019-12-07 16:33:37,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:33:37,734 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:33:37,749 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 16:33:37,768 INFO L614 ElimStorePlain]: treesize reduction 26, result has 13.3 percent of original size [2019-12-07 16:33:37,768 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:33:37,768 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:4 [2019-12-07 16:33:37,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:33:37,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349424569] [2019-12-07 16:33:37,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/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 [2019-12-07 16:33:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:33:37,826 INFO L264 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 16:33:37,827 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:33:37,855 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:37,855 INFO L377 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 [2019-12-07 16:33:37,855 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:37,859 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:37,859 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:33:37,859 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:9 [2019-12-07 16:33:37,862 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2019-12-07 16:33:37,862 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:37,868 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:37,868 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:33:37,868 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-12-07 16:33:37,893 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:37,893 INFO L377 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 [2019-12-07 16:33:37,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:33:37,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:33:37,894 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 16:33:37,922 INFO L614 ElimStorePlain]: treesize reduction 37, result has 44.8 percent of original size [2019-12-07 16:33:37,922 INFO L534 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. [2019-12-07 16:33:37,922 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2019-12-07 16:33:54,262 WARN L192 SmtUtils]: Spent 16.34 s on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2019-12-07 16:33:54,262 INFO L343 Elim1Store]: treesize reduction 20, result has 76.5 percent of original size [2019-12-07 16:33:54,262 INFO L377 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 43 treesize of output 88 [2019-12-07 16:33:54,263 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:54,300 INFO L614 ElimStorePlain]: treesize reduction 46, result has 45.9 percent of original size [2019-12-07 16:33:54,301 INFO L534 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. [2019-12-07 16:33:54,301 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2019-12-07 16:33:54,389 INFO L343 Elim1Store]: treesize reduction 10, result has 75.6 percent of original size [2019-12-07 16:33:54,389 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2019-12-07 16:33:54,389 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:54,392 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:54,393 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:33:54,393 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:4 [2019-12-07 16:33:54,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:33:54,395 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:33:54,410 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 16:33:54,429 INFO L614 ElimStorePlain]: treesize reduction 26, result has 13.3 percent of original size [2019-12-07 16:33:54,429 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:33:54,430 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:4 [2019-12-07 16:33:54,454 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:54,454 INFO L377 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 [2019-12-07 16:33:54,454 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:54,457 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:54,457 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:33:54,457 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:4 [2019-12-07 16:33:54,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:33:54,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 16:33:54,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 11, 9, 12, 10] total 22 [2019-12-07 16:33:54,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484085654] [2019-12-07 16:33:54,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 16:33:54,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:33:54,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 16:33:54,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2019-12-07 16:33:54,460 INFO L87 Difference]: Start difference. First operand 84 states and 101 transitions. Second operand 22 states. [2019-12-07 16:33:55,025 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-12-07 16:33:59,599 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-12-07 16:34:00,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:34:00,813 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2019-12-07 16:34:00,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 16:34:00,813 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 24 [2019-12-07 16:34:00,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:34:00,814 INFO L225 Difference]: With dead ends: 126 [2019-12-07 16:34:00,814 INFO L226 Difference]: Without dead ends: 126 [2019-12-07 16:34:00,814 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 112 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=569, Invalid=1501, Unknown=0, NotChecked=0, Total=2070 [2019-12-07 16:34:00,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-12-07 16:34:00,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 84. [2019-12-07 16:34:00,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-07 16:34:00,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2019-12-07 16:34:00,816 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 24 [2019-12-07 16:34:00,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:34:00,816 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2019-12-07 16:34:00,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 16:34:00,816 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2019-12-07 16:34:00,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 16:34:00,817 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:34:00,817 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:34:01,418 WARN L499 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 [2019-12-07 16:34:01,418 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:34:01,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:34:01,419 INFO L82 PathProgramCache]: Analyzing trace with hash 803568070, now seen corresponding path program 1 times [2019-12-07 16:34:01,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:34:01,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1993888371] [2019-12-07 16:34:01,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2019-12-07 16:34:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:34:01,558 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 16:34:01,559 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:34:01,570 INFO L377 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 13 treesize of output 9 [2019-12-07 16:34:01,570 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:34:01,574 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:34:01,574 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:34:01,574 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-12-07 16:34:01,595 INFO L377 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 7 [2019-12-07 16:34:01,595 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:34:01,599 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:34:01,599 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:34:01,599 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2019-12-07 16:34:01,609 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:34:01,609 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:34:01,678 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:34:01,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1993888371] [2019-12-07 16:34:01,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:34:01,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-12-07 16:34:01,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67380108] [2019-12-07 16:34:01,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 16:34:01,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:34:01,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 16:34:01,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:34:01,679 INFO L87 Difference]: Start difference. First operand 84 states and 98 transitions. Second operand 12 states. [2019-12-07 16:34:02,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:34:02,010 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2019-12-07 16:34:02,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 16:34:02,011 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-12-07 16:34:02,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:34:02,011 INFO L225 Difference]: With dead ends: 91 [2019-12-07 16:34:02,011 INFO L226 Difference]: Without dead ends: 91 [2019-12-07 16:34:02,011 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-12-07 16:34:02,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-12-07 16:34:02,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 77. [2019-12-07 16:34:02,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-12-07 16:34:02,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2019-12-07 16:34:02,013 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 25 [2019-12-07 16:34:02,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:34:02,013 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2019-12-07 16:34:02,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 16:34:02,013 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2019-12-07 16:34:02,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 16:34:02,013 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:34:02,013 INFO L410 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] [2019-12-07 16:34:02,214 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 mathsat -unsat_core_generation=3 [2019-12-07 16:34:02,215 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:34:02,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:34:02,215 INFO L82 PathProgramCache]: Analyzing trace with hash -164612954, now seen corresponding path program 1 times [2019-12-07 16:34:02,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:34:02,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991268878] [2019-12-07 16:34:02,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/mathsat Starting monitored process 30 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with mathsat -unsat_core_generation=3 [2019-12-07 16:34:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:34:02,326 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 16:34:02,326 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:34:02,330 INFO L377 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 [2019-12-07 16:34:02,330 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:34:02,333 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:34:02,333 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:34:02,334 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 16:34:02,352 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:34:02,352 INFO L377 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 [2019-12-07 16:34:02,352 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:34:02,367 INFO L614 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-12-07 16:34:02,368 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:34:02,368 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-12-07 16:34:02,380 INFO L377 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 13 treesize of output 9 [2019-12-07 16:34:02,380 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:34:02,398 INFO L614 ElimStorePlain]: treesize reduction 5, result has 86.1 percent of original size [2019-12-07 16:34:02,399 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:34:02,399 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:34 [2019-12-07 16:34:02,430 INFO L377 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 27 treesize of output 15 [2019-12-07 16:34:02,430 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:34:02,435 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:34:02,435 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:34:02,435 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:19 [2019-12-07 16:34:02,450 INFO L377 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 0 case distinctions, treesize of input 21 treesize of output 21 [2019-12-07 16:34:02,450 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:34:02,458 INFO L614 ElimStorePlain]: treesize reduction 4, result has 76.5 percent of original size [2019-12-07 16:34:02,458 INFO L534 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. [2019-12-07 16:34:02,459 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:13 [2019-12-07 16:34:02,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:34:02,474 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:34:02,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:34:02,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991268878] [2019-12-07 16:34:02,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:34:02,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 12 [2019-12-07 16:34:02,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12536093] [2019-12-07 16:34:02,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 16:34:02,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:34:02,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 16:34:02,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-12-07 16:34:02,557 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand 13 states. [2019-12-07 16:34:41,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:34:41,332 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2019-12-07 16:34:41,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 16:34:41,332 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-07 16:34:41,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:34:41,333 INFO L225 Difference]: With dead ends: 92 [2019-12-07 16:34:41,333 INFO L226 Difference]: Without dead ends: 92 [2019-12-07 16:34:41,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2019-12-07 16:34:41,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-12-07 16:34:41,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2019-12-07 16:34:41,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-12-07 16:34:41,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2019-12-07 16:34:41,335 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 25 [2019-12-07 16:34:41,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:34:41,335 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2019-12-07 16:34:41,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 16:34:41,335 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2019-12-07 16:34:41,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 16:34:41,335 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:34:41,335 INFO L410 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] [2019-12-07 16:34:41,536 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 mathsat -unsat_core_generation=3 [2019-12-07 16:34:41,536 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 16:34:41,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:34:41,537 INFO L82 PathProgramCache]: Analyzing trace with hash 720743753, now seen corresponding path program 1 times [2019-12-07 16:34:41,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:34:41,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [872940505] [2019-12-07 16:34:41,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/mathsat Starting monitored process 31 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with mathsat -unsat_core_generation=3 [2019-12-07 16:34:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:34:41,672 INFO L264 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 16:34:41,673 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:34:41,676 INFO L377 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 [2019-12-07 16:34:41,676 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:34:41,677 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:34:41,677 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:34:41,677 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 16:34:41,695 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:34:41,696 INFO L377 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 [2019-12-07 16:34:41,696 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:34:41,711 INFO L614 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-12-07 16:34:41,711 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:34:41,711 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-12-07 16:34:41,723 INFO L377 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 [2019-12-07 16:34:41,723 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:34:41,731 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:34:41,731 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:34:41,732 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-12-07 16:34:41,769 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:34:41,769 INFO L377 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 41 treesize of output 59 [2019-12-07 16:34:41,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:34:41,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:34:41,770 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 16:34:41,810 INFO L614 ElimStorePlain]: treesize reduction 41, result has 51.2 percent of original size [2019-12-07 16:34:41,810 INFO L534 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. [2019-12-07 16:34:41,811 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2019-12-07 16:34:41,874 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:34:41,874 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 93 [2019-12-07 16:34:41,874 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:34:41,927 INFO L614 ElimStorePlain]: treesize reduction 40, result has 58.3 percent of original size [2019-12-07 16:34:41,927 INFO L534 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. [2019-12-07 16:34:41,927 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:56 [2019-12-07 16:34:41,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:34:42,014 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:34:42,014 INFO L377 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 95 [2019-12-07 16:34:42,014 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:34:42,077 INFO L614 ElimStorePlain]: treesize reduction 46, result has 60.7 percent of original size [2019-12-07 16:34:42,077 INFO L534 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. [2019-12-07 16:34:42,078 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:75, output treesize:80 [2019-12-07 16:34:42,406 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:34:42,406 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 67 [2019-12-07 16:34:42,407 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:34:42,431 INFO L614 ElimStorePlain]: treesize reduction 14, result has 70.8 percent of original size [2019-12-07 16:34:42,432 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:34:42,432 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:85, output treesize:34 [2019-12-07 16:34:42,476 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2019-12-07 16:34:42,476 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:34:42,492 INFO L614 ElimStorePlain]: treesize reduction 8, result has 75.0 percent of original size [2019-12-07 16:34:42,492 INFO L534 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. [2019-12-07 16:34:42,493 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:24 [2019-12-07 16:34:42,548 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:34:42,548 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 59 [2019-12-07 16:34:42,549 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:34:42,570 INFO L614 ElimStorePlain]: treesize reduction 28, result has 44.0 percent of original size [2019-12-07 16:34:42,570 INFO L534 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. [2019-12-07 16:34:42,570 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:22 [2019-12-07 16:34:42,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:34:42,616 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:34:49,086 WARN L192 SmtUtils]: Spent 6.12 s on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2019-12-07 16:34:49,086 INFO L343 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2019-12-07 16:34:49,086 INFO L377 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 41 [2019-12-07 16:34:49,095 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:34:49,095 INFO L377 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 41 treesize of output 43 [2019-12-07 16:34:49,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:34:49,097 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_181], 2=[v_arrayElimCell_180]} [2019-12-07 16:34:49,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [872940505] [2019-12-07 16:34:49,100 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@18094b3d [2019-12-07 16:34:49,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [373088194] [2019-12-07 16:34:49,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/cvc4 Starting monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 16:34:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:34:49,248 INFO L264 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-07 16:34:49,248 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:34:49,249 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@18094b3d [2019-12-07 16:34:49,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649360754] [2019-12-07 16:34:49,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e6ef23c-775d-4d6d-bd7e-8ad399afc9ad/bin/utaipan/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:34:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:34:49,289 INFO L264 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 16:34:49,290 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:34:49,291 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@18094b3d [2019-12-07 16:34:49,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:34:49,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 16:34:49,291 ERROR L206 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2019-12-07 16:34:49,291 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 16:34:49,895 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,31 mathsat -unsat_core_generation=3,32 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 16:34:49,909 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 16:34:49,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:34:49 BoogieIcfgContainer [2019-12-07 16:34:49,909 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:34:49,910 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:34:49,910 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:34:49,910 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:34:49,910 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:31:20" (3/4) ... [2019-12-07 16:34:49,912 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 16:34:49,912 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:34:49,913 INFO L168 Benchmark]: Toolchain (without parser) took 210370.23 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 223.3 MB). Free memory was 947.0 MB in the beginning and 1.0 GB in the end (delta: -98.4 MB). Peak memory consumption was 124.9 MB. Max. memory is 11.5 GB. [2019-12-07 16:34:49,913 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:34:49,913 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -149.4 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-12-07 16:34:49,913 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-12-07 16:34:49,914 INFO L168 Benchmark]: Boogie Preprocessor took 21.51 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:34:49,914 INFO L168 Benchmark]: RCFGBuilder took 310.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2019-12-07 16:34:49,914 INFO L168 Benchmark]: TraceAbstraction took 209697.31 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 109.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 12.5 MB). Peak memory consumption was 121.5 MB. Max. memory is 11.5 GB. [2019-12-07 16:34:49,914 INFO L168 Benchmark]: Witness Printer took 2.57 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:34:49,915 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 304.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -149.4 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.51 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 310.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 209697.31 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 109.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 12.5 MB). Peak memory consumption was 121.5 MB. Max. memory is 11.5 GB. * Witness Printer took 2.57 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 551]: 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: [L526] Node* list = ((void *)0); [L527] Node* y = ((void *)0); [L528] y = malloc(sizeof(*y)) [L529] y->next = ((void *)0) [L530] y->prev = ((void *)0) [L531] y->pData = &y->data [L532] list = y [L533] COND TRUE __VERIFIER_nondet_int() [L535] y = malloc(sizeof(*y)) [L536] y->next = list [L537] list->prev = y [L538] COND TRUE __VERIFIER_nondet_int() [L540] y->pData = malloc(sizeof(*y->pData)) [L546] list = y [L533] COND FALSE !(__VERIFIER_nondet_int()) [L548] COND TRUE ((void *)0) != list [L550] y = list [L551] EXPR list->next [L551] list = list->next [L552] EXPR y->pData [L552] COND TRUE &y->data != y->pData [L554] EXPR y->pData [L554] free(y->pData) [L554] free(y->pData) [L554] free(y->pData) [L556] free(y) [L556] free(y) [L556] free(y) [L548] COND TRUE ((void *)0) != list [L550] y = list [L551] list->next - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 56 locations, 27 error locations. Result: UNKNOWN, OverallTime: 209.6s, OverallIterations: 20, TraceHistogramMax: 2, AutomataDifference: 110.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 426 SDtfs, 1653 SDslu, 1568 SDs, 0 SdLazy, 3808 SolverSat, 618 SolverUnsat, 39 SolverUnknown, 0 SolverNotchecked, 85.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1108 GetRequests, 766 SyntacticMatches, 37 SemanticMatches, 305 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2770 ImplicationChecksByTransitivity, 32.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 390 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 82.2s InterpolantComputationTime, 516 NumberOfCodeBlocks, 516 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 974 ConstructedInterpolants, 140 QuantifiedInterpolants, 259672 SizeOfPredicates, 285 NumberOfNonLiveVariables, 2218 ConjunctsInSsa, 360 ConjunctsInUnsatCore, 58 InterpolantComputations, 28 PerfectInterpolantSequences, 27/86 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: 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...