./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.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_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/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 760c75961baa7cc196b373809e9a87dd0bcf8eb7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/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 760c75961baa7cc196b373809e9a87dd0bcf8eb7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 10:47:19,112 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:47:19,113 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:47:19,122 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:47:19,122 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:47:19,123 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:47:19,124 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:47:19,126 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:47:19,127 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:47:19,128 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:47:19,129 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:47:19,130 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:47:19,130 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:47:19,131 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:47:19,132 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:47:19,133 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:47:19,134 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:47:19,135 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:47:19,136 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:47:19,138 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:47:19,140 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:47:19,141 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:47:19,141 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:47:19,142 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:47:19,144 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:47:19,145 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:47:19,145 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:47:19,145 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:47:19,146 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:47:19,147 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:47:19,147 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:47:19,147 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:47:19,148 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:47:19,148 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:47:19,149 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:47:19,149 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:47:19,150 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:47:19,150 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:47:19,150 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:47:19,151 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:47:19,151 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:47:19,152 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 10:47:19,164 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:47:19,164 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:47:19,165 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 10:47:19,165 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 10:47:19,165 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 10:47:19,165 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 10:47:19,165 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 10:47:19,165 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 10:47:19,165 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 10:47:19,165 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 10:47:19,165 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 10:47:19,166 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 10:47:19,166 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 10:47:19,166 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 10:47:19,166 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 10:47:19,167 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:47:19,167 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:47:19,167 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:47:19,167 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:47:19,167 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 10:47:19,167 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:47:19,167 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:47:19,167 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:47:19,168 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 10:47:19,168 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 10:47:19,168 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 10:47:19,168 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:47:19,168 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 10:47:19,168 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:47:19,168 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:47:19,169 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:47:19,169 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:47:19,169 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:47:19,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:47:19,169 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:47:19,169 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:47:19,169 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 10:47:19,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:47:19,170 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:47:19,170 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 10:47:19,170 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_2170a1b0-e552-4eaf-853c-d2bd139fec38/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 -> 760c75961baa7cc196b373809e9a87dd0bcf8eb7 [2019-12-07 10:47:19,276 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:47:19,284 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:47:19,286 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:47:19,287 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:47:19,287 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:47:19,288 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i [2019-12-07 10:47:19,334 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/data/c4d4b563e/d6802a4fb0a84ab8b276547cb111e44f/FLAG848b07813 [2019-12-07 10:47:19,711 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:47:19,711 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i [2019-12-07 10:47:19,719 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/data/c4d4b563e/d6802a4fb0a84ab8b276547cb111e44f/FLAG848b07813 [2019-12-07 10:47:20,103 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/data/c4d4b563e/d6802a4fb0a84ab8b276547cb111e44f [2019-12-07 10:47:20,106 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:47:20,108 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:47:20,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:47:20,109 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:47:20,112 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:47:20,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:47:20" (1/1) ... [2019-12-07 10:47:20,115 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2833034c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:47:20, skipping insertion in model container [2019-12-07 10:47:20,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:47:20" (1/1) ... [2019-12-07 10:47:20,120 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:47:20,150 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:47:20,374 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:47:20,380 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:47:20,411 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:47:20,441 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:47:20,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:47:20 WrapperNode [2019-12-07 10:47:20,442 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:47:20,442 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:47:20,442 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:47:20,442 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:47:20,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:47:20" (1/1) ... [2019-12-07 10:47:20,458 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:47:20" (1/1) ... [2019-12-07 10:47:20,476 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:47:20,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:47:20,476 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:47:20,476 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:47:20,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:47:20" (1/1) ... [2019-12-07 10:47:20,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:47:20" (1/1) ... [2019-12-07 10:47:20,485 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:47:20" (1/1) ... [2019-12-07 10:47:20,485 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:47:20" (1/1) ... [2019-12-07 10:47:20,492 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:47:20" (1/1) ... [2019-12-07 10:47:20,495 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:47:20" (1/1) ... [2019-12-07 10:47:20,496 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:47:20" (1/1) ... [2019-12-07 10:47:20,498 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:47:20,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:47:20,499 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:47:20,499 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:47:20,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:47:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/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 10:47:20,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 10:47:20,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 10:47:20,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 10:47:20,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:47:20,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:47:20,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:47:20,869 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:47:20,870 INFO L287 CfgBuilder]: Removed 13 assume(true) statements. [2019-12-07 10:47:20,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:47:20 BoogieIcfgContainer [2019-12-07 10:47:20,871 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:47:20,871 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:47:20,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:47:20,873 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:47:20,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:47:20" (1/3) ... [2019-12-07 10:47:20,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bdd8638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:47:20, skipping insertion in model container [2019-12-07 10:47:20,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:47:20" (2/3) ... [2019-12-07 10:47:20,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bdd8638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:47:20, skipping insertion in model container [2019-12-07 10:47:20,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:47:20" (3/3) ... [2019-12-07 10:47:20,875 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order-2.i [2019-12-07 10:47:20,881 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:47:20,886 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 59 error locations. [2019-12-07 10:47:20,893 INFO L249 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2019-12-07 10:47:20,905 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:47:20,905 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 10:47:20,905 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:47:20,905 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:47:20,905 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:47:20,905 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:47:20,905 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:47:20,905 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:47:20,919 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2019-12-07 10:47:20,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 10:47:20,924 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:20,924 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 10:47:20,925 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 10:47:20,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:20,929 INFO L82 PathProgramCache]: Analyzing trace with hash 202069, now seen corresponding path program 1 times [2019-12-07 10:47:20,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:47:20,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959707520] [2019-12-07 10:47:20,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:21,028 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 10:47:21,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959707520] [2019-12-07 10:47:21,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:21,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:47:21,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106479634] [2019-12-07 10:47:21,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:47:21,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:47:21,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:47:21,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:47:21,044 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 3 states. [2019-12-07 10:47:21,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:21,123 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2019-12-07 10:47:21,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:47:21,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 10:47:21,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:21,131 INFO L225 Difference]: With dead ends: 120 [2019-12-07 10:47:21,132 INFO L226 Difference]: Without dead ends: 117 [2019-12-07 10:47:21,133 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 10:47:21,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-12-07 10:47:21,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-12-07 10:47:21,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-12-07 10:47:21,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2019-12-07 10:47:21,160 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 3 [2019-12-07 10:47:21,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:21,161 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2019-12-07 10:47:21,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:47:21,161 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2019-12-07 10:47:21,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 10:47:21,161 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:21,161 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 10:47:21,162 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 10:47:21,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:21,162 INFO L82 PathProgramCache]: Analyzing trace with hash 202070, now seen corresponding path program 1 times [2019-12-07 10:47:21,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:47:21,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006387512] [2019-12-07 10:47:21,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:21,193 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 10:47:21,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006387512] [2019-12-07 10:47:21,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:21,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:47:21,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309701881] [2019-12-07 10:47:21,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:47:21,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:47:21,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:47:21,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:47:21,195 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand 3 states. [2019-12-07 10:47:21,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:21,222 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2019-12-07 10:47:21,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:47:21,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 10:47:21,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:21,224 INFO L225 Difference]: With dead ends: 114 [2019-12-07 10:47:21,224 INFO L226 Difference]: Without dead ends: 114 [2019-12-07 10:47:21,225 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 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 10:47:21,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-12-07 10:47:21,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-12-07 10:47:21,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-12-07 10:47:21,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2019-12-07 10:47:21,231 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 3 [2019-12-07 10:47:21,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:21,231 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2019-12-07 10:47:21,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:47:21,232 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2019-12-07 10:47:21,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 10:47:21,232 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:21,232 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:21,232 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 10:47:21,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:21,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1935835100, now seen corresponding path program 1 times [2019-12-07 10:47:21,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:47:21,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879098922] [2019-12-07 10:47:21,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:21,258 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 10:47:21,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879098922] [2019-12-07 10:47:21,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:21,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:47:21,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965772817] [2019-12-07 10:47:21,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:47:21,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:47:21,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:47:21,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:47:21,259 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 3 states. [2019-12-07 10:47:21,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:21,328 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2019-12-07 10:47:21,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:47:21,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 10:47:21,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:21,330 INFO L225 Difference]: With dead ends: 144 [2019-12-07 10:47:21,330 INFO L226 Difference]: Without dead ends: 144 [2019-12-07 10:47:21,330 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:47:21,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-12-07 10:47:21,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 113. [2019-12-07 10:47:21,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-12-07 10:47:21,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2019-12-07 10:47:21,337 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 7 [2019-12-07 10:47:21,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:21,337 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2019-12-07 10:47:21,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:47:21,338 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2019-12-07 10:47:21,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 10:47:21,338 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:21,338 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:21,338 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 10:47:21,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:21,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1935835101, now seen corresponding path program 1 times [2019-12-07 10:47:21,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:47:21,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907159484] [2019-12-07 10:47:21,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:21,380 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 10:47:21,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907159484] [2019-12-07 10:47:21,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:21,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:47:21,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644445167] [2019-12-07 10:47:21,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:47:21,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:47:21,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:47:21,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:47:21,381 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 3 states. [2019-12-07 10:47:21,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:21,413 INFO L93 Difference]: Finished difference Result 215 states and 225 transitions. [2019-12-07 10:47:21,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:47:21,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 10:47:21,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:21,415 INFO L225 Difference]: With dead ends: 215 [2019-12-07 10:47:21,415 INFO L226 Difference]: Without dead ends: 215 [2019-12-07 10:47:21,415 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:47:21,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-12-07 10:47:21,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 112. [2019-12-07 10:47:21,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-12-07 10:47:21,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2019-12-07 10:47:21,422 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 7 [2019-12-07 10:47:21,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:21,422 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2019-12-07 10:47:21,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:47:21,422 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2019-12-07 10:47:21,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 10:47:21,422 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:21,422 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:21,422 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 10:47:21,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:21,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1935991168, now seen corresponding path program 1 times [2019-12-07 10:47:21,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:47:21,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621774918] [2019-12-07 10:47:21,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:21,441 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 10:47:21,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621774918] [2019-12-07 10:47:21,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:21,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:47:21,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921146791] [2019-12-07 10:47:21,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:47:21,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:47:21,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:47:21,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:47:21,442 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand 3 states. [2019-12-07 10:47:21,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:21,449 INFO L93 Difference]: Finished difference Result 118 states and 123 transitions. [2019-12-07 10:47:21,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:47:21,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 10:47:21,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:21,450 INFO L225 Difference]: With dead ends: 118 [2019-12-07 10:47:21,450 INFO L226 Difference]: Without dead ends: 118 [2019-12-07 10:47:21,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:47:21,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-12-07 10:47:21,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 113. [2019-12-07 10:47:21,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-12-07 10:47:21,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2019-12-07 10:47:21,455 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 7 [2019-12-07 10:47:21,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:21,455 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2019-12-07 10:47:21,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:47:21,455 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2019-12-07 10:47:21,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 10:47:21,456 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:21,456 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:21,456 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 10:47:21,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:21,456 INFO L82 PathProgramCache]: Analyzing trace with hash -118654038, now seen corresponding path program 1 times [2019-12-07 10:47:21,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:47:21,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847847951] [2019-12-07 10:47:21,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:21,497 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 10:47:21,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847847951] [2019-12-07 10:47:21,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:21,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:47:21,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338195793] [2019-12-07 10:47:21,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:47:21,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:47:21,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:47:21,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:47:21,498 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 5 states. [2019-12-07 10:47:21,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:21,621 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2019-12-07 10:47:21,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:47:21,621 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-12-07 10:47:21,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:21,622 INFO L225 Difference]: With dead ends: 117 [2019-12-07 10:47:21,622 INFO L226 Difference]: Without dead ends: 117 [2019-12-07 10:47:21,622 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:47:21,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-12-07 10:47:21,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2019-12-07 10:47:21,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-12-07 10:47:21,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2019-12-07 10:47:21,627 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 8 [2019-12-07 10:47:21,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:21,627 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2019-12-07 10:47:21,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:47:21,627 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2019-12-07 10:47:21,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 10:47:21,627 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:21,628 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:21,628 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 10:47:21,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:21,628 INFO L82 PathProgramCache]: Analyzing trace with hash -118654037, now seen corresponding path program 1 times [2019-12-07 10:47:21,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:47:21,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42868832] [2019-12-07 10:47:21,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:21,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:21,676 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 10:47:21,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42868832] [2019-12-07 10:47:21,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:21,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:47:21,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20398033] [2019-12-07 10:47:21,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:47:21,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:47:21,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:47:21,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:47:21,678 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand 4 states. [2019-12-07 10:47:21,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:21,719 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2019-12-07 10:47:21,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:47:21,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 10:47:21,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:21,720 INFO L225 Difference]: With dead ends: 116 [2019-12-07 10:47:21,720 INFO L226 Difference]: Without dead ends: 116 [2019-12-07 10:47:21,720 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 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 10:47:21,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-12-07 10:47:21,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-12-07 10:47:21,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-12-07 10:47:21,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 121 transitions. [2019-12-07 10:47:21,724 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 121 transitions. Word has length 8 [2019-12-07 10:47:21,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:21,724 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 121 transitions. [2019-12-07 10:47:21,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:47:21,725 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 121 transitions. [2019-12-07 10:47:21,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 10:47:21,725 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:21,725 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:21,725 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 10:47:21,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:21,726 INFO L82 PathProgramCache]: Analyzing trace with hash -59830876, now seen corresponding path program 1 times [2019-12-07 10:47:21,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:47:21,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928756973] [2019-12-07 10:47:21,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:21,750 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 10:47:21,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928756973] [2019-12-07 10:47:21,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394480590] [2019-12-07 10:47:21,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/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 10:47:21,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:21,794 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 10:47:21,798 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:47:21,812 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 10:47:21,812 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:47:21,820 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 10:47:21,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1365028274] [2019-12-07 10:47:21,836 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-12-07 10:47:21,836 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:47:21,840 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 10:47:21,844 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 10:47:21,845 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 10:47:21,930 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:47:22,038 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:47:22,213 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:47:22,583 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-12-07 10:47:22,711 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:47:22,726 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:47:22,737 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:47:22,748 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:47:22,802 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:47:23,236 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:47:23,247 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:47:23,256 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:47:23,263 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:47:23,330 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 10:47:23,994 WARN L192 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 99 [2019-12-07 10:47:24,115 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-12-07 10:47:24,636 WARN L192 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 106 [2019-12-07 10:47:24,769 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 10:47:24,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:47:24,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2019-12-07 10:47:24,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641331816] [2019-12-07 10:47:24,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:47:24,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:47:24,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:47:24,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:47:24,770 INFO L87 Difference]: Start difference. First operand 116 states and 121 transitions. Second operand 4 states. [2019-12-07 10:47:24,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:24,779 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2019-12-07 10:47:24,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:47:24,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 10:47:24,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:24,780 INFO L225 Difference]: With dead ends: 117 [2019-12-07 10:47:24,780 INFO L226 Difference]: Without dead ends: 117 [2019-12-07 10:47:24,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:47:24,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-12-07 10:47:24,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-12-07 10:47:24,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-12-07 10:47:24,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2019-12-07 10:47:24,783 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 11 [2019-12-07 10:47:24,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:24,784 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2019-12-07 10:47:24,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:47:24,784 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2019-12-07 10:47:24,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 10:47:24,784 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:24,784 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:24,985 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:47:24,986 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 10:47:24,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:24,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1859595258, now seen corresponding path program 1 times [2019-12-07 10:47:24,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:47:24,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622631878] [2019-12-07 10:47:24,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:25,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:25,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622631878] [2019-12-07 10:47:25,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27684141] [2019-12-07 10:47:25,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/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 10:47:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:25,075 INFO L264 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 10:47:25,076 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:47:25,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:25,112 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:47:25,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:25,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2068328973] [2019-12-07 10:47:25,131 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2019-12-07 10:47:25,131 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:47:25,132 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 10:47:25,132 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 10:47:25,132 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 10:47:25,169 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:47:25,243 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:47:25,339 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:47:25,483 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:47:25,593 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 10:47:25,915 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 101 [2019-12-07 10:47:26,143 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 113 [2019-12-07 10:47:26,212 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 10:47:26,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:47:26,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-12-07 10:47:26,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058558341] [2019-12-07 10:47:26,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:47:26,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:47:26,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:47:26,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:47:26,213 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand 7 states. [2019-12-07 10:47:26,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:26,300 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2019-12-07 10:47:26,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:47:26,301 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-12-07 10:47:26,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:26,301 INFO L225 Difference]: With dead ends: 115 [2019-12-07 10:47:26,301 INFO L226 Difference]: Without dead ends: 115 [2019-12-07 10:47:26,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:47:26,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-12-07 10:47:26,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-12-07 10:47:26,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-12-07 10:47:26,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 120 transitions. [2019-12-07 10:47:26,305 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 120 transitions. Word has length 12 [2019-12-07 10:47:26,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:26,305 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 120 transitions. [2019-12-07 10:47:26,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:47:26,305 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2019-12-07 10:47:26,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 10:47:26,305 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:26,306 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:26,506 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:47:26,507 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 10:47:26,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:26,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1859595257, now seen corresponding path program 1 times [2019-12-07 10:47:26,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:47:26,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76761253] [2019-12-07 10:47:26,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:26,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:26,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76761253] [2019-12-07 10:47:26,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218299018] [2019-12-07 10:47:26,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/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 10:47:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:26,588 INFO L264 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 10:47:26,589 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:47:26,629 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:26,629 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:47:26,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:26,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1635918230] [2019-12-07 10:47:26,689 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2019-12-07 10:47:26,689 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:47:26,690 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 10:47:26,690 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 10:47:26,690 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 10:47:26,724 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:47:26,797 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:47:26,891 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:47:26,900 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:47:26,908 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:47:26,935 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:47:26,999 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:47:27,112 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:47:27,121 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:47:27,166 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:47:27,175 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:47:27,502 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:47:27,598 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 10:47:27,955 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 101 [2019-12-07 10:47:28,179 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 113 [2019-12-07 10:47:28,253 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 10:47:28,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:47:28,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 5] total 8 [2019-12-07 10:47:28,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461640821] [2019-12-07 10:47:28,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:47:28,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:47:28,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:47:28,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:47:28,255 INFO L87 Difference]: Start difference. First operand 115 states and 120 transitions. Second operand 9 states. [2019-12-07 10:47:28,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:28,298 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2019-12-07 10:47:28,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:47:28,298 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-12-07 10:47:28,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:28,299 INFO L225 Difference]: With dead ends: 113 [2019-12-07 10:47:28,299 INFO L226 Difference]: Without dead ends: 113 [2019-12-07 10:47:28,299 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:47:28,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-12-07 10:47:28,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-12-07 10:47:28,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-12-07 10:47:28,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2019-12-07 10:47:28,301 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 12 [2019-12-07 10:47:28,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:28,301 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2019-12-07 10:47:28,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:47:28,302 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2019-12-07 10:47:28,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:47:28,302 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:28,302 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:28,502 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:47:28,503 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 10:47:28,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:28,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1901232613, now seen corresponding path program 1 times [2019-12-07 10:47:28,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:47:28,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622811960] [2019-12-07 10:47:28,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:28,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 10:47:28,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622811960] [2019-12-07 10:47:28,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:28,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:47:28,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840961280] [2019-12-07 10:47:28,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:47:28,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:47:28,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:47:28,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:47:28,549 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 3 states. [2019-12-07 10:47:28,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:28,591 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2019-12-07 10:47:28,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:47:28,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 10:47:28,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:28,592 INFO L225 Difference]: With dead ends: 110 [2019-12-07 10:47:28,592 INFO L226 Difference]: Without dead ends: 110 [2019-12-07 10:47:28,592 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:47:28,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-12-07 10:47:28,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-12-07 10:47:28,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-12-07 10:47:28,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 115 transitions. [2019-12-07 10:47:28,595 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 115 transitions. Word has length 16 [2019-12-07 10:47:28,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:28,595 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 115 transitions. [2019-12-07 10:47:28,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:47:28,595 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 115 transitions. [2019-12-07 10:47:28,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:47:28,596 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:28,596 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:28,596 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 10:47:28,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:28,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1901232614, now seen corresponding path program 1 times [2019-12-07 10:47:28,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:47:28,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163185500] [2019-12-07 10:47:28,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:28,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:47:28,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163185500] [2019-12-07 10:47:28,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:28,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:47:28,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461558330] [2019-12-07 10:47:28,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:47:28,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:47:28,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:47:28,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:47:28,638 INFO L87 Difference]: Start difference. First operand 110 states and 115 transitions. Second operand 5 states. [2019-12-07 10:47:28,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:28,700 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2019-12-07 10:47:28,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:47:28,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 10:47:28,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:28,701 INFO L225 Difference]: With dead ends: 103 [2019-12-07 10:47:28,701 INFO L226 Difference]: Without dead ends: 103 [2019-12-07 10:47:28,701 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:47:28,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-12-07 10:47:28,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-12-07 10:47:28,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-12-07 10:47:28,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 108 transitions. [2019-12-07 10:47:28,704 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 108 transitions. Word has length 16 [2019-12-07 10:47:28,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:28,704 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 108 transitions. [2019-12-07 10:47:28,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:47:28,704 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2019-12-07 10:47:28,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 10:47:28,705 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:28,705 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:28,705 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 10:47:28,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:28,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1507403472, now seen corresponding path program 1 times [2019-12-07 10:47:28,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:47:28,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526810029] [2019-12-07 10:47:28,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:28,835 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:28,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526810029] [2019-12-07 10:47:28,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990434907] [2019-12-07 10:47:28,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:47:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:28,871 INFO L264 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 47 conjunts are in the unsatisfiable core [2019-12-07 10:47:28,872 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:47:29,544 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:29,544 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:47:29,880 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:29,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [153291351] [2019-12-07 10:47:29,881 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-12-07 10:47:29,882 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:47:29,882 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 10:47:29,882 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 10:47:29,882 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 10:47:29,914 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:47:29,985 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:47:30,157 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@7d20e746 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.DagInterpreter.interpretForSingleMarker(DagInterpreter.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarizeInternal(FixpointLoopSummarizer.java:118) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) 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 10:47:30,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:47:30,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 28 [2019-12-07 10:47:30,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21886772] [2019-12-07 10:47:30,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 10:47:30,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:47:30,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 10:47:30,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=697, Unknown=0, NotChecked=0, Total=812 [2019-12-07 10:47:30,160 INFO L87 Difference]: Start difference. First operand 103 states and 108 transitions. Second operand 29 states. [2019-12-07 10:47:30,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 10:47:30,361 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:47:30,362 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@7d20e746 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 10:47:30,364 INFO L168 Benchmark]: Toolchain (without parser) took 10257.12 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 274.7 MB). Free memory was 934.0 MB in the beginning and 886.9 MB in the end (delta: 47.1 MB). Peak memory consumption was 321.8 MB. Max. memory is 11.5 GB. [2019-12-07 10:47:30,364 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:47:30,365 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -136.6 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-12-07 10:47:30,365 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.73 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 10:47:30,365 INFO L168 Benchmark]: Boogie Preprocessor took 22.41 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 10:47:30,366 INFO L168 Benchmark]: RCFGBuilder took 372.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 11.5 GB. [2019-12-07 10:47:30,366 INFO L168 Benchmark]: TraceAbstraction took 9492.11 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 181.4 MB). Free memory was 1.0 GB in the beginning and 886.9 MB in the end (delta: 133.6 MB). Peak memory consumption was 315.0 MB. Max. memory is 11.5 GB. [2019-12-07 10:47:30,367 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 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 332.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -136.6 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.73 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. * Boogie Preprocessor took 22.41 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 372.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9492.11 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 181.4 MB). Free memory was 1.0 GB in the beginning and 886.9 MB in the end (delta: 133.6 MB). Peak memory consumption was 315.0 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@7d20e746 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@7d20e746: 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 10:47:31,691 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:47:31,692 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:47:31,701 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:47:31,702 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:47:31,702 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:47:31,703 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:47:31,705 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:47:31,707 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:47:31,708 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:47:31,708 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:47:31,709 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:47:31,710 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:47:31,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:47:31,712 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:47:31,713 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:47:31,713 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:47:31,714 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:47:31,716 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:47:31,718 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:47:31,719 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:47:31,720 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:47:31,722 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:47:31,722 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:47:31,725 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:47:31,725 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:47:31,725 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:47:31,726 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:47:31,726 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:47:31,727 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:47:31,727 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:47:31,728 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:47:31,728 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:47:31,729 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:47:31,730 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:47:31,730 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:47:31,730 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:47:31,731 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:47:31,731 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:47:31,731 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:47:31,732 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:47:31,733 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-12-07 10:47:31,743 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:47:31,743 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:47:31,744 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 10:47:31,744 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 10:47:31,744 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 10:47:31,744 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 10:47:31,744 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 10:47:31,744 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 10:47:31,744 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 10:47:31,745 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:47:31,745 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:47:31,745 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:47:31,745 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:47:31,746 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 10:47:31,746 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:47:31,746 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:47:31,746 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:47:31,746 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 10:47:31,746 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 10:47:31,746 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 10:47:31,746 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:47:31,746 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 10:47:31,747 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 10:47:31,747 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 10:47:31,747 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:47:31,747 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:47:31,747 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:47:31,747 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:47:31,747 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:47:31,747 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:47:31,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:47:31,748 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:47:31,748 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:47:31,748 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 10:47:31,748 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 10:47:31,748 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:47:31,748 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 10:47:31,749 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_2170a1b0-e552-4eaf-853c-d2bd139fec38/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 -> 760c75961baa7cc196b373809e9a87dd0bcf8eb7 [2019-12-07 10:47:31,915 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:47:31,924 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:47:31,927 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:47:31,927 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:47:31,928 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:47:31,928 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i [2019-12-07 10:47:31,968 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/data/060f843bd/46e545e2137a4a718b065235d4521359/FLAG9aec327bc [2019-12-07 10:47:32,333 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:47:32,333 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i [2019-12-07 10:47:32,341 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/data/060f843bd/46e545e2137a4a718b065235d4521359/FLAG9aec327bc [2019-12-07 10:47:32,349 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/data/060f843bd/46e545e2137a4a718b065235d4521359 [2019-12-07 10:47:32,351 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:47:32,352 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:47:32,352 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:47:32,353 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:47:32,355 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:47:32,355 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:47:32" (1/1) ... [2019-12-07 10:47:32,357 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16abd910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:47:32, skipping insertion in model container [2019-12-07 10:47:32,357 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:47:32" (1/1) ... [2019-12-07 10:47:32,362 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:47:32,384 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:47:32,597 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:47:32,603 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:47:32,636 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:47:32,669 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:47:32,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:47:32 WrapperNode [2019-12-07 10:47:32,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:47:32,670 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:47:32,670 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:47:32,670 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:47:32,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:47:32" (1/1) ... [2019-12-07 10:47:32,688 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:47:32" (1/1) ... [2019-12-07 10:47:32,705 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:47:32,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:47:32,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:47:32,706 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:47:32,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:47:32" (1/1) ... [2019-12-07 10:47:32,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:47:32" (1/1) ... [2019-12-07 10:47:32,715 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:47:32" (1/1) ... [2019-12-07 10:47:32,715 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:47:32" (1/1) ... [2019-12-07 10:47:32,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:47:32" (1/1) ... [2019-12-07 10:47:32,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:47:32" (1/1) ... [2019-12-07 10:47:32,727 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:47:32" (1/1) ... [2019-12-07 10:47:32,729 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:47:32,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:47:32,730 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:47:32,730 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:47:32,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:47:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/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 10:47:32,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 10:47:32,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 10:47:32,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 10:47:32,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:47:32,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:47:32,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:47:33,119 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:47:33,119 INFO L287 CfgBuilder]: Removed 13 assume(true) statements. [2019-12-07 10:47:33,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:47:33 BoogieIcfgContainer [2019-12-07 10:47:33,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:47:33,121 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:47:33,121 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:47:33,123 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:47:33,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:47:32" (1/3) ... [2019-12-07 10:47:33,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@586a4851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:47:33, skipping insertion in model container [2019-12-07 10:47:33,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:47:32" (2/3) ... [2019-12-07 10:47:33,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@586a4851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:47:33, skipping insertion in model container [2019-12-07 10:47:33,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:47:33" (3/3) ... [2019-12-07 10:47:33,125 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order-2.i [2019-12-07 10:47:33,132 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:47:33,137 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 59 error locations. [2019-12-07 10:47:33,144 INFO L249 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2019-12-07 10:47:33,157 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:47:33,157 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 10:47:33,157 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:47:33,157 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:47:33,157 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:47:33,158 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:47:33,158 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:47:33,158 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:47:33,174 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2019-12-07 10:47:33,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 10:47:33,179 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:33,179 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 10:47:33,180 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 10:47:33,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:33,184 INFO L82 PathProgramCache]: Analyzing trace with hash 925702, now seen corresponding path program 1 times [2019-12-07 10:47:33,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:47:33,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1088005081] [2019-12-07 10:47:33,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/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 10:47:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:33,230 INFO L264 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:47:33,233 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:47:33,268 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 10:47:33,269 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:33,275 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:33,275 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:47:33,275 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 10:47:33,281 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 10:47:33,281 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:47:33,284 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 10:47:33,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1088005081] [2019-12-07 10:47:33,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:33,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 10:47:33,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581222422] [2019-12-07 10:47:33,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:47:33,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:47:33,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:47:33,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:47:33,300 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 3 states. [2019-12-07 10:47:33,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:33,408 INFO L93 Difference]: Finished difference Result 128 states and 135 transitions. [2019-12-07 10:47:33,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:47:33,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 10:47:33,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:33,417 INFO L225 Difference]: With dead ends: 128 [2019-12-07 10:47:33,417 INFO L226 Difference]: Without dead ends: 124 [2019-12-07 10:47:33,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 10:47:33,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-12-07 10:47:33,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2019-12-07 10:47:33,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-12-07 10:47:33,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 129 transitions. [2019-12-07 10:47:33,448 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 129 transitions. Word has length 4 [2019-12-07 10:47:33,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:33,448 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 129 transitions. [2019-12-07 10:47:33,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:47:33,448 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 129 transitions. [2019-12-07 10:47:33,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 10:47:33,448 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:33,449 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 10:47:33,649 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 10:47:33,651 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 10:47:33,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:33,653 INFO L82 PathProgramCache]: Analyzing trace with hash 925703, now seen corresponding path program 1 times [2019-12-07 10:47:33,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:47:33,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [656796804] [2019-12-07 10:47:33,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/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 10:47:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:33,730 INFO L264 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 10:47:33,731 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:47:33,740 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 10:47:33,741 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:33,745 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:33,746 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:47:33,746 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 10:47:33,755 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 10:47:33,755 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:47:33,792 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 10:47:33,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [656796804] [2019-12-07 10:47:33,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:33,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 10:47:33,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211962287] [2019-12-07 10:47:33,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:47:33,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:47:33,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:47:33,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:47:33,795 INFO L87 Difference]: Start difference. First operand 124 states and 129 transitions. Second operand 4 states. [2019-12-07 10:47:33,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:33,872 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2019-12-07 10:47:33,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:47:33,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-12-07 10:47:33,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:33,874 INFO L225 Difference]: With dead ends: 121 [2019-12-07 10:47:33,874 INFO L226 Difference]: Without dead ends: 121 [2019-12-07 10:47:33,875 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 10:47:33,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-12-07 10:47:33,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-12-07 10:47:33,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-12-07 10:47:33,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2019-12-07 10:47:33,882 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 4 [2019-12-07 10:47:33,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:33,882 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2019-12-07 10:47:33,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:47:33,883 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2019-12-07 10:47:33,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 10:47:33,883 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:33,883 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:34,083 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 10:47:34,084 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 10:47:34,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:34,085 INFO L82 PathProgramCache]: Analyzing trace with hash 2097999444, now seen corresponding path program 1 times [2019-12-07 10:47:34,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:47:34,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1243788248] [2019-12-07 10:47:34,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/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 10:47:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:34,138 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 10:47:34,139 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:47:34,146 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 10:47:34,146 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:47:34,152 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 10:47:34,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1243788248] [2019-12-07 10:47:34,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:34,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 10:47:34,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684132575] [2019-12-07 10:47:34,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:47:34,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:47:34,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:47:34,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:47:34,154 INFO L87 Difference]: Start difference. First operand 121 states and 126 transitions. Second operand 4 states. [2019-12-07 10:47:34,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:34,170 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2019-12-07 10:47:34,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:47:34,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 10:47:34,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:34,172 INFO L225 Difference]: With dead ends: 131 [2019-12-07 10:47:34,172 INFO L226 Difference]: Without dead ends: 131 [2019-12-07 10:47:34,172 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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 10:47:34,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-12-07 10:47:34,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2019-12-07 10:47:34,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-12-07 10:47:34,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2019-12-07 10:47:34,179 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 9 [2019-12-07 10:47:34,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:34,180 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2019-12-07 10:47:34,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:47:34,180 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2019-12-07 10:47:34,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 10:47:34,180 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:34,180 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:34,381 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 10:47:34,382 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 10:47:34,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:34,383 INFO L82 PathProgramCache]: Analyzing trace with hash 2098000980, now seen corresponding path program 1 times [2019-12-07 10:47:34,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:47:34,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1532353787] [2019-12-07 10:47:34,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/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 10:47:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:34,425 INFO L264 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:47:34,426 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:47:34,430 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 10:47:34,430 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:34,432 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:34,432 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:47:34,432 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 10:47:34,435 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 10:47:34,435 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:47:34,437 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 10:47:34,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1532353787] [2019-12-07 10:47:34,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:34,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 10:47:34,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85521123] [2019-12-07 10:47:34,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:47:34,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:47:34,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:47:34,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:47:34,439 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand 3 states. [2019-12-07 10:47:34,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:34,519 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2019-12-07 10:47:34,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:47:34,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 10:47:34,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:34,520 INFO L225 Difference]: With dead ends: 126 [2019-12-07 10:47:34,520 INFO L226 Difference]: Without dead ends: 126 [2019-12-07 10:47:34,520 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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 10:47:34,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-12-07 10:47:34,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-12-07 10:47:34,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-12-07 10:47:34,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 134 transitions. [2019-12-07 10:47:34,526 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 134 transitions. Word has length 9 [2019-12-07 10:47:34,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:34,526 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 134 transitions. [2019-12-07 10:47:34,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:47:34,526 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2019-12-07 10:47:34,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 10:47:34,527 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:34,527 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:34,727 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 10:47:34,729 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 10:47:34,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:34,730 INFO L82 PathProgramCache]: Analyzing trace with hash 2098000981, now seen corresponding path program 1 times [2019-12-07 10:47:34,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:47:34,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [952519910] [2019-12-07 10:47:34,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/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 10:47:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:34,777 INFO L264 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 10:47:34,778 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:47:34,784 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 10:47:34,784 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:34,789 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:34,789 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:47:34,789 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 10:47:34,797 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 10:47:34,797 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:47:34,827 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 10:47:34,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [952519910] [2019-12-07 10:47:34,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:34,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 10:47:34,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956748485] [2019-12-07 10:47:34,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:47:34,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:47:34,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:47:34,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:47:34,829 INFO L87 Difference]: Start difference. First operand 126 states and 134 transitions. Second operand 4 states. [2019-12-07 10:47:34,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:34,882 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2019-12-07 10:47:34,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:47:34,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 10:47:34,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:34,884 INFO L225 Difference]: With dead ends: 125 [2019-12-07 10:47:34,884 INFO L226 Difference]: Without dead ends: 125 [2019-12-07 10:47:34,884 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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 10:47:34,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-12-07 10:47:34,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-12-07 10:47:34,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-12-07 10:47:34,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2019-12-07 10:47:34,890 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 9 [2019-12-07 10:47:34,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:34,890 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2019-12-07 10:47:34,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:47:34,891 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2019-12-07 10:47:34,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 10:47:34,891 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:34,891 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:35,092 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 10:47:35,094 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 10:47:35,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:35,095 INFO L82 PathProgramCache]: Analyzing trace with hash 613520946, now seen corresponding path program 1 times [2019-12-07 10:47:35,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:47:35,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [323259192] [2019-12-07 10:47:35,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/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 10:47:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:35,194 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 10:47:35,194 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:47:35,198 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 10:47:35,198 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:35,200 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:35,200 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:47:35,200 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 10:47:35,223 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:35,223 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 14 treesize of output 30 [2019-12-07 10:47:35,224 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:35,236 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 10:47:35,237 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 10:47:35,237 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-12-07 10:47:35,244 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 10:47:35,244 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:47:35,258 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 10:47:35,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [323259192] [2019-12-07 10:47:35,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:35,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 10:47:35,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646550131] [2019-12-07 10:47:35,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:47:35,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:47:35,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:47:35,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:47:35,260 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand 4 states. [2019-12-07 10:47:35,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:35,384 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2019-12-07 10:47:35,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:47:35,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 10:47:35,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:35,385 INFO L225 Difference]: With dead ends: 126 [2019-12-07 10:47:35,385 INFO L226 Difference]: Without dead ends: 126 [2019-12-07 10:47:35,386 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 3 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 10:47:35,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-12-07 10:47:35,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-12-07 10:47:35,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-12-07 10:47:35,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 131 transitions. [2019-12-07 10:47:35,390 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 131 transitions. Word has length 10 [2019-12-07 10:47:35,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:35,390 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 131 transitions. [2019-12-07 10:47:35,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:47:35,391 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 131 transitions. [2019-12-07 10:47:35,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 10:47:35,391 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:35,391 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:35,591 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 10:47:35,593 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 10:47:35,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:35,594 INFO L82 PathProgramCache]: Analyzing trace with hash 613520947, now seen corresponding path program 1 times [2019-12-07 10:47:35,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:47:35,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [56015421] [2019-12-07 10:47:35,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/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 10:47:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:35,703 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 10:47:35,704 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:47:35,711 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 10:47:35,711 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:35,717 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:35,719 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 10:47:35,719 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:35,724 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:35,724 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:47:35,724 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 10:47:35,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:47:35,749 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 10:47:35,750 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:35,760 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:35,768 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:35,769 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 10:47:35,769 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:35,780 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:35,781 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 10:47:35,781 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:20 [2019-12-07 10:47:35,803 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 10:47:35,804 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:47:35,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:47:35,996 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 10:47:35,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [56015421] [2019-12-07 10:47:35,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:35,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 10:47:35,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142472596] [2019-12-07 10:47:35,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:47:35,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:47:35,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:47:35,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:47:35,998 INFO L87 Difference]: Start difference. First operand 125 states and 131 transitions. Second operand 8 states. [2019-12-07 10:47:47,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:47,695 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2019-12-07 10:47:47,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:47:47,696 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-12-07 10:47:47,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:47,697 INFO L225 Difference]: With dead ends: 125 [2019-12-07 10:47:47,697 INFO L226 Difference]: Without dead ends: 125 [2019-12-07 10:47:47,697 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:47:47,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-12-07 10:47:47,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-12-07 10:47:47,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-12-07 10:47:47,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2019-12-07 10:47:47,701 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 10 [2019-12-07 10:47:47,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:47,701 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2019-12-07 10:47:47,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:47:47,701 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2019-12-07 10:47:47,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 10:47:47,702 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:47,702 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:47,902 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 10:47:47,903 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 10:47:47,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:47,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1523256032, now seen corresponding path program 1 times [2019-12-07 10:47:47,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:47:47,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659105151] [2019-12-07 10:47:47,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/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 10:47:48,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:48,006 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 10:47:48,007 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:47:48,011 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 10:47:48,011 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:48,012 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:48,013 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:47:48,013 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 10:47:48,032 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:48,032 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 14 treesize of output 30 [2019-12-07 10:47:48,033 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:48,044 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 10:47:48,044 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 10:47:48,044 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-12-07 10:47:48,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:48,049 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:47:48,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:48,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659105151] [2019-12-07 10:47:48,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1151058427] [2019-12-07 10:47:48,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 10:47:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:48,155 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 10:47:48,156 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:47:48,175 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:48,176 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 12 treesize of output 28 [2019-12-07 10:47:48,176 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:48,187 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 10:47:48,187 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 10:47:48,187 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-12-07 10:47:48,204 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:48,205 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 14 treesize of output 30 [2019-12-07 10:47:48,205 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:48,217 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 10:47:48,217 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 10:47:48,217 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-12-07 10:47:48,222 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:48,222 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:47:48,232 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:48,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347252990] [2019-12-07 10:47:48,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:47:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:48,298 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 10:47:48,299 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:47:48,318 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:48,319 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 10:47:48,319 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:48,337 INFO L614 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-12-07 10:47:48,338 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 10:47:48,338 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2019-12-07 10:47:48,350 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:48,350 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:47:48,378 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:48,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 10:47:48,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 4, 3, 4, 4] total 7 [2019-12-07 10:47:48,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471295537] [2019-12-07 10:47:48,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:47:48,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:47:48,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:47:48,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:47:48,380 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand 8 states. [2019-12-07 10:47:48,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:48,609 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2019-12-07 10:47:48,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:47:48,610 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-12-07 10:47:48,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:48,611 INFO L225 Difference]: With dead ends: 123 [2019-12-07 10:47:48,611 INFO L226 Difference]: Without dead ends: 123 [2019-12-07 10:47:48,611 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 74 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:47:48,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-12-07 10:47:48,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-12-07 10:47:48,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-12-07 10:47:48,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2019-12-07 10:47:48,614 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 15 [2019-12-07 10:47:48,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:48,614 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2019-12-07 10:47:48,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:47:48,614 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2019-12-07 10:47:48,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 10:47:48,614 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:48,614 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:49,215 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3,10 cvc4 --incremental --print-success --lang smt --rewrite-divk,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:47:49,217 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 10:47:49,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:49,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1523256033, now seen corresponding path program 1 times [2019-12-07 10:47:49,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:47:49,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023117641] [2019-12-07 10:47:49,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 10:47:49,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:49,357 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 10:47:49,357 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:47:49,363 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 10:47:49,364 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:49,371 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:49,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 10:47:49,375 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:49,380 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:49,380 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:47:49,380 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 10:47:49,409 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:49,409 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 10:47:49,410 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:49,418 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:49,420 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 10:47:49,421 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:49,428 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:49,428 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 10:47:49,428 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:18 [2019-12-07 10:47:49,448 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:49,448 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:47:49,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:47:49,643 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:49,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2023117641] [2019-12-07 10:47:49,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1950836699] [2019-12-07 10:47:49,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 10:47:49,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:49,750 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 10:47:49,751 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:47:49,755 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 10:47:49,756 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:49,761 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:49,764 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 10:47:49,764 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:49,770 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:49,770 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:47:49,770 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 10:47:49,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:47:49,779 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 10:47:49,779 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:49,788 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:49,795 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:49,795 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 10:47:49,796 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:49,803 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:49,803 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 10:47:49,803 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:20 [2019-12-07 10:47:49,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:49,813 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:47:49,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:47:49,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:49,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648421785] [2019-12-07 10:47:49,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:47:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:49,934 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 10:47:49,935 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:47:49,939 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 10:47:49,939 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:49,943 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:49,943 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:47:49,943 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 10:47:49,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:47:49,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 10:47:49,970 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:49,980 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:49,986 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:49,986 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 10:47:49,987 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:49,993 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:49,994 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 10:47:49,994 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:20 [2019-12-07 10:47:50,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:50,004 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:47:50,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:47:50,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:47:50,101 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:50,101 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 10:47:50,101 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:50,112 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:50,112 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 10:47:50,112 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:50,137 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:50,138 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 10:47:50,138 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:22 [2019-12-07 10:47:50,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:50,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 10:47:50,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 5, 5] total 9 [2019-12-07 10:47:50,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556448638] [2019-12-07 10:47:50,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 10:47:50,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:47:50,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 10:47:50,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:47:50,206 INFO L87 Difference]: Start difference. First operand 123 states and 128 transitions. Second operand 10 states. [2019-12-07 10:47:50,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:50,647 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2019-12-07 10:47:50,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:47:50,648 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-12-07 10:47:50,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:50,649 INFO L225 Difference]: With dead ends: 121 [2019-12-07 10:47:50,649 INFO L226 Difference]: Without dead ends: 121 [2019-12-07 10:47:50,649 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 70 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:47:50,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-12-07 10:47:50,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-12-07 10:47:50,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-12-07 10:47:50,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2019-12-07 10:47:50,651 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 15 [2019-12-07 10:47:50,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:50,651 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2019-12-07 10:47:50,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 10:47:50,652 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2019-12-07 10:47:50,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:47:50,652 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:50,652 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:51,253 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 cvc4 --incremental --print-success --lang smt --rewrite-divk,12 mathsat -unsat_core_generation=3 [2019-12-07 10:47:51,255 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 10:47:51,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:51,256 INFO L82 PathProgramCache]: Analyzing trace with hash 2088887169, now seen corresponding path program 1 times [2019-12-07 10:47:51,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:47:51,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435407264] [2019-12-07 10:47:51,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 10:47:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:51,323 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 10:47:51,324 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:47:51,327 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 10:47:51,327 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:51,328 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:51,329 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:47:51,329 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 10:47:51,344 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:47:51,344 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:47:51,346 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:47:51,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [435407264] [2019-12-07 10:47:51,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:51,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 10:47:51,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993489874] [2019-12-07 10:47:51,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:47:51,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:47:51,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:47:51,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:47:51,347 INFO L87 Difference]: Start difference. First operand 121 states and 126 transitions. Second operand 6 states. [2019-12-07 10:47:51,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:51,549 INFO L93 Difference]: Finished difference Result 118 states and 123 transitions. [2019-12-07 10:47:51,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:47:51,550 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 10:47:51,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:51,551 INFO L225 Difference]: With dead ends: 118 [2019-12-07 10:47:51,551 INFO L226 Difference]: Without dead ends: 118 [2019-12-07 10:47:51,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:47:51,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-12-07 10:47:51,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-12-07 10:47:51,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-12-07 10:47:51,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 123 transitions. [2019-12-07 10:47:51,553 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 123 transitions. Word has length 22 [2019-12-07 10:47:51,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:51,553 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 123 transitions. [2019-12-07 10:47:51,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:47:51,553 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 123 transitions. [2019-12-07 10:47:51,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:47:51,554 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:51,554 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:51,754 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 10:47:51,755 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 10:47:51,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:51,756 INFO L82 PathProgramCache]: Analyzing trace with hash 2088887170, now seen corresponding path program 1 times [2019-12-07 10:47:51,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:47:51,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [305656979] [2019-12-07 10:47:51,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-12-07 10:47:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:51,908 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 10:47:51,909 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:47:51,913 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 10:47:51,914 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:51,918 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:51,918 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:47:51,918 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 10:47:51,949 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:47:51,949 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:47:52,129 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:47:52,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [305656979] [2019-12-07 10:47:52,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:52,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-12-07 10:47:52,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780808333] [2019-12-07 10:47:52,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 10:47:52,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:47:52,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 10:47:52,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:47:52,130 INFO L87 Difference]: Start difference. First operand 118 states and 123 transitions. Second operand 10 states. [2019-12-07 10:47:52,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:52,515 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2019-12-07 10:47:52,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:47:52,515 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-12-07 10:47:52,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:52,516 INFO L225 Difference]: With dead ends: 111 [2019-12-07 10:47:52,516 INFO L226 Difference]: Without dead ends: 111 [2019-12-07 10:47:52,516 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:47:52,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-12-07 10:47:52,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-12-07 10:47:52,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 10:47:52,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 116 transitions. [2019-12-07 10:47:52,519 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 116 transitions. Word has length 22 [2019-12-07 10:47:52,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:52,519 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 116 transitions. [2019-12-07 10:47:52,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 10:47:52,519 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2019-12-07 10:47:52,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 10:47:52,520 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:52,520 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:52,720 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 10:47:52,722 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 10:47:52,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:52,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1383417867, now seen corresponding path program 1 times [2019-12-07 10:47:52,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:47:52,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [929418906] [2019-12-07 10:47:52,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/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 10:47:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:52,865 INFO L264 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 10:47:52,867 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:47:52,874 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 10:47:52,874 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:52,879 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:52,880 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:47:52,880 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-12-07 10:47:52,932 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:52,932 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 36 [2019-12-07 10:47:52,933 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:52,940 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:52,941 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:47:52,941 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:15 [2019-12-07 10:47:52,960 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 10:47:52,960 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:52,969 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:52,969 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:47:52,970 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-12-07 10:47:52,992 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 19 treesize of output 18 [2019-12-07 10:47:52,992 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:53,003 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:53,003 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 10:47:53,003 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2019-12-07 10:47:53,091 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:53,092 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 1 case distinctions, treesize of input 26 treesize of output 52 [2019-12-07 10:47:53,092 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:53,125 INFO L614 ElimStorePlain]: treesize reduction 24, result has 57.9 percent of original size [2019-12-07 10:47:53,126 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:47:53,126 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2019-12-07 10:47:53,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:47:53,178 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:53,178 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 35 treesize of output 52 [2019-12-07 10:47:53,178 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:53,214 INFO L614 ElimStorePlain]: treesize reduction 16, result has 72.4 percent of original size [2019-12-07 10:47:53,215 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:47:53,215 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:39 [2019-12-07 10:47:53,375 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:53,375 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 28 [2019-12-07 10:47:53,376 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:53,381 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:53,381 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 10:47:53,381 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:3 [2019-12-07 10:47:53,430 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:53,430 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:47:53,891 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:54,021 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-12-07 10:47:54,022 INFO L614 ElimStorePlain]: treesize reduction 25, result has 66.2 percent of original size [2019-12-07 10:47:54,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:47:54,022 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 10:47:54,023 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:67, output treesize:41 [2019-12-07 10:47:54,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:47:54,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:47:54,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:47:54,478 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:54,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [929418906] [2019-12-07 10:47:54,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [184113678] [2019-12-07 10:47:54,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 10:47:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:54,622 INFO L264 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-07 10:47:54,624 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:47:54,628 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 10:47:54,628 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:54,633 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:54,634 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:47:54,634 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-12-07 10:47:54,652 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:54,653 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 36 [2019-12-07 10:47:54,653 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:54,660 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:54,660 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:47:54,660 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:15 [2019-12-07 10:47:54,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, 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 10:47:54,664 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:54,673 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:54,673 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:47:54,673 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-12-07 10:47:54,677 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 19 treesize of output 18 [2019-12-07 10:47:54,678 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:54,687 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:54,688 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 10:47:54,688 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2019-12-07 10:47:54,733 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:54,733 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 1 case distinctions, treesize of input 26 treesize of output 52 [2019-12-07 10:47:54,734 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:54,764 INFO L614 ElimStorePlain]: treesize reduction 24, result has 57.9 percent of original size [2019-12-07 10:47:54,764 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:47:54,764 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2019-12-07 10:47:54,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:47:54,777 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:54,777 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 35 treesize of output 52 [2019-12-07 10:47:54,777 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:54,791 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:54,792 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:47:54,792 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:39 [2019-12-07 10:47:54,807 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:54,807 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 28 [2019-12-07 10:47:54,808 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:54,813 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:54,813 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 10:47:54,813 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:3 [2019-12-07 10:47:54,816 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:54,817 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:47:54,851 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:54,985 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-12-07 10:47:54,985 INFO L614 ElimStorePlain]: treesize reduction 25, result has 66.2 percent of original size [2019-12-07 10:47:54,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:47:54,986 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 10:47:54,986 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:67, output treesize:41 [2019-12-07 10:47:54,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:47:54,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:47:54,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:47:55,122 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:55,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956260277] [2019-12-07 10:47:55,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:47:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:55,169 INFO L264 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 10:47:55,170 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:47:55,212 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:55,212 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 12 treesize of output 28 [2019-12-07 10:47:55,212 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:55,226 INFO L614 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-12-07 10:47:55,226 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:47:55,226 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-12-07 10:47:55,242 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:55,242 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 36 [2019-12-07 10:47:55,242 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:55,248 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:55,248 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:47:55,248 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:12 [2019-12-07 10:47:55,292 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 10:47:55,292 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:55,300 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:55,300 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:47:55,300 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-12-07 10:47:55,353 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 19 treesize of output 18 [2019-12-07 10:47:55,353 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:55,362 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:55,362 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 10:47:55,362 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2019-12-07 10:47:55,501 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:55,501 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 1 case distinctions, treesize of input 26 treesize of output 52 [2019-12-07 10:47:55,501 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:55,532 INFO L614 ElimStorePlain]: treesize reduction 24, result has 55.6 percent of original size [2019-12-07 10:47:55,532 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:47:55,532 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 [2019-12-07 10:47:55,649 INFO L343 Elim1Store]: treesize reduction 20, result has 50.0 percent of original size [2019-12-07 10:47:55,649 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 52 [2019-12-07 10:47:55,649 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:55,683 INFO L614 ElimStorePlain]: treesize reduction 16, result has 70.9 percent of original size [2019-12-07 10:47:55,684 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:47:55,684 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:36 [2019-12-07 10:47:55,959 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:55,959 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 41 [2019-12-07 10:47:55,961 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:55,967 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:47:55,967 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 10:47:55,967 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:3 [2019-12-07 10:47:55,970 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:55,970 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:47:56,001 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:47:56,125 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-12-07 10:47:56,126 INFO L614 ElimStorePlain]: treesize reduction 25, result has 66.2 percent of original size [2019-12-07 10:47:56,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:47:56,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:47:56,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:47:56,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:47:56,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:47:56,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:47:56,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:47:56,129 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-12-07 10:47:56,129 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:28 [2019-12-07 10:47:56,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:48:01,834 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:48:01,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 10:48:01,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 15, 13, 14, 14] total 37 [2019-12-07 10:48:01,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208378954] [2019-12-07 10:48:01,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-07 10:48:01,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:48:01,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-07 10:48:01,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1263, Unknown=2, NotChecked=0, Total=1406 [2019-12-07 10:48:01,836 INFO L87 Difference]: Start difference. First operand 111 states and 116 transitions. Second operand 38 states. [2019-12-07 10:48:03,219 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-12-07 10:48:03,675 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2019-12-07 10:48:04,278 WARN L192 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 92 [2019-12-07 10:48:04,804 WARN L192 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 94 [2019-12-07 10:48:05,239 WARN L192 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 94 [2019-12-07 10:48:35,945 WARN L192 SmtUtils]: Spent 30.42 s on a formula simplification. DAG size of input: 121 DAG size of output: 102 [2019-12-07 10:48:43,030 WARN L192 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 83 [2019-12-07 10:49:14,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:14,563 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2019-12-07 10:49:14,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 10:49:14,563 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 28 [2019-12-07 10:49:14,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:14,564 INFO L225 Difference]: With dead ends: 111 [2019-12-07 10:49:14,564 INFO L226 Difference]: Without dead ends: 111 [2019-12-07 10:49:14,565 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 118 SyntacticMatches, 8 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 41.2s TimeCoverageRelationStatistics Valid=544, Invalid=2534, Unknown=2, NotChecked=0, Total=3080 [2019-12-07 10:49:14,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-12-07 10:49:14,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2019-12-07 10:49:14,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-07 10:49:14,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2019-12-07 10:49:14,567 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 28 [2019-12-07 10:49:14,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:14,567 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2019-12-07 10:49:14,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-07 10:49:14,568 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2019-12-07 10:49:14,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 10:49:14,568 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:14,568 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:49:15,169 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3,19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 10:49:15,170 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 10:49:15,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:15,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1383419083, now seen corresponding path program 1 times [2019-12-07 10:49:15,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:49:15,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [250014885] [2019-12-07 10:49:15,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/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 10:49:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:15,251 INFO L264 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 10:49:15,251 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:49:15,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 13 treesize of output 9 [2019-12-07 10:49:15,270 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:49:15,274 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:49:15,274 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:49:15,274 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-12-07 10:49:15,310 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 10:49:15,310 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:49:15,311 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:49:15,311 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 10:49:15,311 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-12-07 10:49:15,330 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:49:15,330 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:49:15,386 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 10:49:15,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [250014885] [2019-12-07 10:49:15,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:49:15,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 7] imperfect sequences [] total 12 [2019-12-07 10:49:15,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807116752] [2019-12-07 10:49:15,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 10:49:15,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:49:15,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 10:49:15,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:49:15,387 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 13 states. [2019-12-07 10:49:15,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:15,718 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2019-12-07 10:49:15,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 10:49:15,719 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-12-07 10:49:15,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:15,719 INFO L225 Difference]: With dead ends: 102 [2019-12-07 10:49:15,719 INFO L226 Difference]: Without dead ends: 102 [2019-12-07 10:49:15,720 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2019-12-07 10:49:15,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-12-07 10:49:15,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-12-07 10:49:15,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-07 10:49:15,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2019-12-07 10:49:15,722 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 28 [2019-12-07 10:49:15,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:15,722 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2019-12-07 10:49:15,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 10:49:15,722 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2019-12-07 10:49:15,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 10:49:15,722 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:15,722 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:49:15,923 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 10:49:15,924 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 10:49:15,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:15,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1383380101, now seen corresponding path program 1 times [2019-12-07 10:49:15,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:49:15,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1790425676] [2019-12-07 10:49:15,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-12-07 10:49:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:16,054 INFO L264 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 10:49:16,055 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:49:16,153 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:49:16,153 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:49:16,219 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:49:16,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1790425676] [2019-12-07 10:49:16,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:49:16,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 11 [2019-12-07 10:49:16,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717513445] [2019-12-07 10:49:16,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 10:49:16,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:49:16,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 10:49:16,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:49:16,220 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand 12 states. [2019-12-07 10:49:16,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:16,675 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2019-12-07 10:49:16,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:49:16,675 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-12-07 10:49:16,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:16,676 INFO L225 Difference]: With dead ends: 97 [2019-12-07 10:49:16,676 INFO L226 Difference]: Without dead ends: 97 [2019-12-07 10:49:16,676 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:49:16,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-12-07 10:49:16,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-12-07 10:49:16,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-12-07 10:49:16,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2019-12-07 10:49:16,678 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 28 [2019-12-07 10:49:16,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:16,678 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2019-12-07 10:49:16,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 10:49:16,678 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2019-12-07 10:49:16,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 10:49:16,679 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:16,679 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 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 10:49:16,879 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-12-07 10:49:16,880 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 10:49:16,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:16,881 INFO L82 PathProgramCache]: Analyzing trace with hash -63718946, now seen corresponding path program 1 times [2019-12-07 10:49:16,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:49:16,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2006120986] [2019-12-07 10:49:16,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-12-07 10:49:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:17,010 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 10:49:17,011 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:49:17,019 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 10:49:17,019 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:49:17,026 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:49:17,027 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:49:17,027 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-12-07 10:49:17,078 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:49:17,078 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 36 [2019-12-07 10:49:17,079 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:49:17,087 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:49:17,087 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:49:17,088 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:15 [2019-12-07 10:49:17,115 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 10:49:17,115 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:49:17,127 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:49:17,127 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:49:17,127 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-12-07 10:49:17,180 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:49:17,180 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 1 case distinctions, treesize of input 37 treesize of output 55 [2019-12-07 10:49:17,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:49:17,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:49:17,181 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 10:49:17,232 INFO L614 ElimStorePlain]: treesize reduction 37, result has 49.3 percent of original size [2019-12-07 10:49:17,233 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 10:49:17,233 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2019-12-07 10:49:17,358 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:49:17,359 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 40 treesize of output 81 [2019-12-07 10:49:17,359 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:49:23,446 WARN L192 SmtUtils]: Spent 6.09 s on a formula simplification. DAG size of input: 32 DAG size of output: 25 [2019-12-07 10:49:23,446 INFO L614 ElimStorePlain]: treesize reduction 42, result has 50.6 percent of original size [2019-12-07 10:49:23,446 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:49:23,447 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:43 [2019-12-07 10:49:23,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:49:23,580 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:49:23,580 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 111 [2019-12-07 10:49:23,581 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:49:23,638 INFO L614 ElimStorePlain]: treesize reduction 46, result has 53.1 percent of original size [2019-12-07 10:49:23,639 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:49:23,639 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:55 [2019-12-07 10:49:23,923 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:49:23,924 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 93 [2019-12-07 10:49:23,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:49:23,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:49:23,925 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:49:23,937 INFO L614 ElimStorePlain]: treesize reduction 11, result has 42.1 percent of original size [2019-12-07 10:49:23,937 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 10:49:23,937 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:3 [2019-12-07 10:49:24,018 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:24,018 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:49:24,624 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:49:24,711 INFO L614 ElimStorePlain]: treesize reduction 46, result has 34.3 percent of original size [2019-12-07 10:49:24,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:49:24,712 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 10:49:24,712 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:16 [2019-12-07 10:49:24,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:49:25,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:49:25,105 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:49:25,111 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:49:25,111 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 24 treesize of output 28 [2019-12-07 10:49:25,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:49:25,112 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 10:49:25,153 INFO L614 ElimStorePlain]: treesize reduction 9, result has 55.0 percent of original size [2019-12-07 10:49:25,153 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 10:49:25,154 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:11 [2019-12-07 10:49:25,237 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:25,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2006120986] [2019-12-07 10:49:25,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2000494904] [2019-12-07 10:49:25,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 10:49:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:25,380 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-07 10:49:25,381 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:49:25,386 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 10:49:25,386 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:49:25,393 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:49:25,393 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:49:25,393 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-12-07 10:49:25,415 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:49:25,416 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 36 [2019-12-07 10:49:25,416 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:49:25,429 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:49:25,429 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:49:25,429 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:15 [2019-12-07 10:49:25,433 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 10:49:25,434 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:49:25,446 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:49:25,446 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:49:25,446 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-12-07 10:49:25,471 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:49:25,471 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 1 case distinctions, treesize of input 37 treesize of output 55 [2019-12-07 10:49:25,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:49:25,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:49:25,472 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 10:49:25,520 INFO L614 ElimStorePlain]: treesize reduction 37, result has 49.3 percent of original size [2019-12-07 10:49:25,520 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 10:49:25,520 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2019-12-07 10:49:25,604 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:49:25,604 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 40 treesize of output 81 [2019-12-07 10:49:25,605 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:49:31,721 WARN L192 SmtUtils]: Spent 6.12 s on a formula simplification. DAG size of input: 32 DAG size of output: 25 [2019-12-07 10:49:31,721 INFO L614 ElimStorePlain]: treesize reduction 42, result has 50.6 percent of original size [2019-12-07 10:49:31,721 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:49:31,721 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:43 [2019-12-07 10:49:31,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:49:31,789 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:49:31,789 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 111 [2019-12-07 10:49:31,790 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:49:31,846 INFO L614 ElimStorePlain]: treesize reduction 46, result has 53.1 percent of original size [2019-12-07 10:49:31,846 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:49:31,846 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:55 [2019-12-07 10:49:31,906 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:49:31,906 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 93 [2019-12-07 10:49:31,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:49:31,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:49:31,907 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:49:31,921 INFO L614 ElimStorePlain]: treesize reduction 42, result has 16.0 percent of original size [2019-12-07 10:49:31,921 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 10:49:31,921 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:3 [2019-12-07 10:49:31,924 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:31,925 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:49:31,968 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:49:32,052 INFO L614 ElimStorePlain]: treesize reduction 46, result has 34.3 percent of original size [2019-12-07 10:49:32,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:49:32,053 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 10:49:32,053 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:16 [2019-12-07 10:49:32,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:49:32,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:49:32,134 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:49:32,142 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:49:32,142 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 24 treesize of output 28 [2019-12-07 10:49:32,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:49:32,143 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 10:49:32,183 INFO L614 ElimStorePlain]: treesize reduction 9, result has 55.0 percent of original size [2019-12-07 10:49:32,183 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 10:49:32,183 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:11 [2019-12-07 10:49:32,257 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:32,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853171623] [2019-12-07 10:49:32,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:49:32,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:32,325 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 10:49:32,326 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:49:32,408 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:49:32,409 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 36 [2019-12-07 10:49:32,409 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:49:32,417 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:49:32,418 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:49:32,418 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:12 [2019-12-07 10:49:32,495 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 10:49:32,496 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:49:32,506 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:49:32,507 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:49:32,507 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-12-07 10:49:32,618 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:49:32,619 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 1 case distinctions, treesize of input 37 treesize of output 55 [2019-12-07 10:49:32,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:49:32,619 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:49:32,640 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:49:32,640 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 10:49:32,640 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2019-12-07 10:49:32,897 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:49:32,897 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 40 treesize of output 81 [2019-12-07 10:49:32,898 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:49:32,944 INFO L614 ElimStorePlain]: treesize reduction 42, result has 48.8 percent of original size [2019-12-07 10:49:32,944 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:49:32,945 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2019-12-07 10:49:49,448 WARN L192 SmtUtils]: Spent 16.39 s on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-12-07 10:49:49,448 INFO L343 Elim1Store]: treesize reduction 20, result has 79.8 percent of original size [2019-12-07 10:49:49,448 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 111 [2019-12-07 10:49:49,449 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:49:49,515 INFO L614 ElimStorePlain]: treesize reduction 68, result has 41.9 percent of original size [2019-12-07 10:49:49,515 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:49:49,515 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:53, output treesize:52 [2019-12-07 10:49:50,074 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-12-07 10:49:50,075 INFO L343 Elim1Store]: treesize reduction 10, result has 87.7 percent of original size [2019-12-07 10:49:50,075 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 97 [2019-12-07 10:49:50,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:49:50,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:49:50,076 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:49:50,094 INFO L614 ElimStorePlain]: treesize reduction 48, result has 14.3 percent of original size [2019-12-07 10:49:50,094 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:49:50,094 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:3 [2019-12-07 10:49:50,097 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:50,097 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:49:50,140 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:49:50,215 INFO L614 ElimStorePlain]: treesize reduction 46, result has 34.3 percent of original size [2019-12-07 10:49:50,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:49:50,216 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 10:49:50,216 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:16 [2019-12-07 10:49:50,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:49:50,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:49:50,308 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:49:50,308 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 39 [2019-12-07 10:49:50,309 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:49:50,329 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:49:50,329 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 39 [2019-12-07 10:49:50,330 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:49:50,348 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:49:50,348 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-12-07 10:49:50,349 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:14 [2019-12-07 10:49:50,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:49:50,522 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:49:50,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 10:49:50,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15, 14, 16, 15] total 36 [2019-12-07 10:49:50,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092065814] [2019-12-07 10:49:50,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-07 10:49:50,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:49:50,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-07 10:49:50,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1206, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 10:49:50,524 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand 37 states. [2019-12-07 10:49:51,791 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-12-07 10:49:52,360 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-12-07 10:49:52,668 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-12-07 10:49:52,908 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-12-07 10:49:53,219 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-12-07 10:49:53,531 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-12-07 10:49:54,041 WARN L192 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 87 [2019-12-07 10:49:54,634 WARN L192 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 89 [2019-12-07 10:49:55,209 WARN L192 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 89 [2019-12-07 10:49:55,750 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-12-07 10:49:56,643 WARN L192 SmtUtils]: Spent 662.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 95 [2019-12-07 10:49:58,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:49:58,573 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2019-12-07 10:49:58,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 10:49:58,574 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 29 [2019-12-07 10:49:58,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:49:58,575 INFO L225 Difference]: With dead ends: 97 [2019-12-07 10:49:58,575 INFO L226 Difference]: Without dead ends: 97 [2019-12-07 10:49:58,576 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 125 SyntacticMatches, 8 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=450, Invalid=2412, Unknown=0, NotChecked=0, Total=2862 [2019-12-07 10:49:58,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-12-07 10:49:58,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2019-12-07 10:49:58,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-12-07 10:49:58,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2019-12-07 10:49:58,578 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 29 [2019-12-07 10:49:58,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:49:58,578 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2019-12-07 10:49:58,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-07 10:49:58,578 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2019-12-07 10:49:58,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 10:49:58,579 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:49:58,579 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 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 10:49:59,181 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3,24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 10:49:59,182 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 10:49:59,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:49:59,184 INFO L82 PathProgramCache]: Analyzing trace with hash -63681212, now seen corresponding path program 1 times [2019-12-07 10:49:59,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:49:59,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1014704270] [2019-12-07 10:49:59,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2019-12-07 10:49:59,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:49:59,297 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 10:49:59,298 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:49:59,337 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 10:49:59,337 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:49:59,347 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:49:59,348 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 10:49:59,348 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:23 [2019-12-07 10:49:59,413 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 23 treesize of output 11 [2019-12-07 10:49:59,413 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:49:59,418 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:49:59,418 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 10:49:59,418 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:8 [2019-12-07 10:49:59,460 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:49:59,460 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:49:59,617 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 10:49:59,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1014704270] [2019-12-07 10:49:59,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:49:59,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 7] imperfect sequences [] total 16 [2019-12-07 10:49:59,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395515295] [2019-12-07 10:49:59,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 10:49:59,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:49:59,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 10:49:59,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2019-12-07 10:49:59,618 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand 17 states. [2019-12-07 10:50:00,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:50:00,438 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2019-12-07 10:50:00,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:50:00,440 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2019-12-07 10:50:00,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:50:00,440 INFO L225 Difference]: With dead ends: 88 [2019-12-07 10:50:00,440 INFO L226 Difference]: Without dead ends: 88 [2019-12-07 10:50:00,441 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:50:00,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-12-07 10:50:00,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-12-07 10:50:00,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-12-07 10:50:00,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2019-12-07 10:50:00,442 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 29 [2019-12-07 10:50:00,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:50:00,442 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2019-12-07 10:50:00,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 10:50:00,443 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2019-12-07 10:50:00,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 10:50:00,443 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:50:00,443 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:50:00,643 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2019-12-07 10:50:00,644 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 10:50:00,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:50:00,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1975287187, now seen corresponding path program 1 times [2019-12-07 10:50:00,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:50:00,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1887993627] [2019-12-07 10:50:00,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/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 10:50:00,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:50:00,839 INFO L264 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 10:50:00,840 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:50:00,846 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 10:50:00,846 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:00,850 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:00,850 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:50:00,850 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 10:50:00,884 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:00,884 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 36 [2019-12-07 10:50:00,884 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:00,890 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:00,890 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:50:00,890 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:12 [2019-12-07 10:50:00,904 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 10:50:00,904 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:00,912 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:00,912 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:50:00,912 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-12-07 10:50:00,953 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:00,953 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 1 case distinctions, treesize of input 39 treesize of output 57 [2019-12-07 10:50:00,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:50:00,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:50:00,954 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 10:50:00,997 INFO L614 ElimStorePlain]: treesize reduction 39, result has 49.4 percent of original size [2019-12-07 10:50:00,998 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 10:50:00,998 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2019-12-07 10:50:01,126 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:01,126 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 42 treesize of output 83 [2019-12-07 10:50:01,127 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:01,175 INFO L614 ElimStorePlain]: treesize reduction 42, result has 51.7 percent of original size [2019-12-07 10:50:01,175 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:50:01,176 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-12-07 10:50:01,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:50:01,288 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:01,288 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 113 [2019-12-07 10:50:01,289 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:01,341 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.0 percent of original size [2019-12-07 10:50:01,341 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:50:01,341 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:57 [2019-12-07 10:50:01,580 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:01,580 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 95 [2019-12-07 10:50:01,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:50:01,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:50:01,581 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:01,595 INFO L614 ElimStorePlain]: treesize reduction 42, result has 19.2 percent of original size [2019-12-07 10:50:01,595 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 10:50:01,595 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:57, output treesize:5 [2019-12-07 10:50:01,649 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:50:01,649 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:50:01,959 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:01,959 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 46 treesize of output 50 [2019-12-07 10:50:01,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:50:01,959 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:01,964 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:01,964 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 10:50:01,964 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:35 [2019-12-07 10:50:02,048 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:02,086 INFO L614 ElimStorePlain]: treesize reduction 53, result has 18.5 percent of original size [2019-12-07 10:50:02,087 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 10:50:02,087 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:8 [2019-12-07 10:50:02,257 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:50:02,262 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:02,262 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 24 treesize of output 28 [2019-12-07 10:50:02,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:50:02,263 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 10:50:02,276 INFO L614 ElimStorePlain]: treesize reduction 9, result has 43.8 percent of original size [2019-12-07 10:50:02,276 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 10:50:02,276 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:3 [2019-12-07 10:50:02,278 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:50:02,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1887993627] [2019-12-07 10:50:02,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [43842931] [2019-12-07 10:50:02,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/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 10:50:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:50:02,421 INFO L264 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 10:50:02,422 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:50:02,502 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:02,502 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 12 treesize of output 28 [2019-12-07 10:50:02,502 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:02,516 INFO L614 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-12-07 10:50:02,516 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:50:02,516 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-12-07 10:50:02,619 INFO L343 Elim1Store]: treesize reduction 8, result has 87.3 percent of original size [2019-12-07 10:50:02,619 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 71 [2019-12-07 10:50:02,619 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:02,651 INFO L614 ElimStorePlain]: treesize reduction 28, result has 49.1 percent of original size [2019-12-07 10:50:02,651 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:50:02,651 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:27 [2019-12-07 10:50:02,712 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 10:50:02,713 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:02,726 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:02,726 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:50:02,726 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-12-07 10:50:02,816 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:02,817 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 1 case distinctions, treesize of input 41 treesize of output 59 [2019-12-07 10:50:02,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:50:02,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:50:02,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:50:02,818 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 10:50:02,871 INFO L614 ElimStorePlain]: treesize reduction 39, result has 55.2 percent of original size [2019-12-07 10:50:02,871 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 10:50:02,872 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:48 [2019-12-07 10:50:03,103 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:03,103 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 42 treesize of output 83 [2019-12-07 10:50:03,104 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:09,277 WARN L192 SmtUtils]: Spent 6.17 s on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-12-07 10:50:09,277 INFO L614 ElimStorePlain]: treesize reduction 42, result has 57.6 percent of original size [2019-12-07 10:50:09,278 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:50:09,278 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:61, output treesize:57 [2019-12-07 10:50:09,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:50:09,460 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:09,460 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 113 [2019-12-07 10:50:09,460 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:09,525 INFO L614 ElimStorePlain]: treesize reduction 46, result has 58.9 percent of original size [2019-12-07 10:50:09,526 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:50:09,526 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:75 [2019-12-07 10:50:10,003 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:10,004 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 66 treesize of output 100 [2019-12-07 10:50:10,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:50:10,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:50:10,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:50:10,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:50:10,006 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 10:50:10,037 INFO L614 ElimStorePlain]: treesize reduction 26, result has 50.0 percent of original size [2019-12-07 10:50:10,037 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:50:10,038 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:71, output treesize:26 [2019-12-07 10:50:10,216 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:50:10,216 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:50:10,440 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:10,487 INFO L614 ElimStorePlain]: treesize reduction 50, result has 35.9 percent of original size [2019-12-07 10:50:10,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:50:10,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:50:10,487 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-07 10:50:10,488 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:69, output treesize:36 [2019-12-07 10:50:10,858 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:50:10,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565329178] [2019-12-07 10:50:10,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/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 10:50:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:50:10,905 INFO L264 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 10:50:10,906 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:50:10,922 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:10,922 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 12 treesize of output 28 [2019-12-07 10:50:10,922 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:10,933 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 10:50:10,933 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:50:10,934 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-12-07 10:50:10,948 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:10,948 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 36 [2019-12-07 10:50:10,949 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:10,953 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:10,953 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:50:10,953 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:9 [2019-12-07 10:50:11,017 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 10:50:11,017 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:11,024 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:11,024 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:50:11,024 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-12-07 10:50:11,128 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:11,128 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 1 case distinctions, treesize of input 39 treesize of output 57 [2019-12-07 10:50:11,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:50:11,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:50:11,129 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 10:50:11,171 INFO L614 ElimStorePlain]: treesize reduction 39, result has 47.3 percent of original size [2019-12-07 10:50:11,171 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 10:50:11,171 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2019-12-07 10:50:11,434 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:11,434 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 42 treesize of output 83 [2019-12-07 10:50:11,435 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:15,521 WARN L192 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 32 DAG size of output: 25 [2019-12-07 10:50:15,522 INFO L614 ElimStorePlain]: treesize reduction 42, result has 50.0 percent of original size [2019-12-07 10:50:15,522 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:50:15,522 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:42 [2019-12-07 10:50:32,102 WARN L192 SmtUtils]: Spent 16.45 s on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-12-07 10:50:32,102 INFO L343 Elim1Store]: treesize reduction 20, result has 79.8 percent of original size [2019-12-07 10:50:32,102 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 113 [2019-12-07 10:50:32,103 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:32,155 INFO L614 ElimStorePlain]: treesize reduction 46, result has 52.6 percent of original size [2019-12-07 10:50:32,156 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:50:32,156 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:54 [2019-12-07 10:50:32,778 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-12-07 10:50:32,779 INFO L343 Elim1Store]: treesize reduction 10, result has 87.7 percent of original size [2019-12-07 10:50:32,779 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 99 [2019-12-07 10:50:32,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:50:32,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:50:32,780 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:32,790 INFO L614 ElimStorePlain]: treesize reduction 48, result has 20.0 percent of original size [2019-12-07 10:50:32,790 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:50:32,791 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:61, output treesize:7 [2019-12-07 10:50:32,820 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:50:32,820 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:50:32,907 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:32,908 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 46 treesize of output 50 [2019-12-07 10:50:32,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:50:32,908 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:32,913 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:32,913 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 10:50:32,913 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:35 [2019-12-07 10:50:32,915 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:32,954 INFO L614 ElimStorePlain]: treesize reduction 53, result has 18.5 percent of original size [2019-12-07 10:50:32,954 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 10:50:32,954 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:8 [2019-12-07 10:50:33,083 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:50:33,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 10:50:33,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 16, 13, 14, 14] total 52 [2019-12-07 10:50:33,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240928916] [2019-12-07 10:50:33,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-12-07 10:50:33,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:50:33,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-12-07 10:50:33,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=2468, Unknown=0, NotChecked=0, Total=2756 [2019-12-07 10:50:33,085 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 53 states. [2019-12-07 10:50:34,302 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-12-07 10:50:34,807 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-12-07 10:50:35,175 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-12-07 10:50:35,784 WARN L192 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 10:50:36,000 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-12-07 10:50:36,701 WARN L192 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 111 [2019-12-07 10:50:37,508 WARN L192 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 115 [2019-12-07 10:50:38,277 WARN L192 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 114 [2019-12-07 10:50:40,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:50:40,049 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2019-12-07 10:50:40,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 10:50:40,049 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 30 [2019-12-07 10:50:40,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:50:40,050 INFO L225 Difference]: With dead ends: 91 [2019-12-07 10:50:40,050 INFO L226 Difference]: Without dead ends: 91 [2019-12-07 10:50:40,051 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 116 SyntacticMatches, 7 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1570 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=831, Invalid=4139, Unknown=0, NotChecked=0, Total=4970 [2019-12-07 10:50:40,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-12-07 10:50:40,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2019-12-07 10:50:40,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-12-07 10:50:40,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2019-12-07 10:50:40,053 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 30 [2019-12-07 10:50:40,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:50:40,053 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2019-12-07 10:50:40,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-12-07 10:50:40,053 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2019-12-07 10:50:40,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 10:50:40,053 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:50:40,054 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:50:40,655 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 10:50:40,656 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 10:50:40,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:50:40,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1974117395, now seen corresponding path program 1 times [2019-12-07 10:50:40,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:50:40,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1365847809] [2019-12-07 10:50:40,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/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 10:50:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:50:40,754 INFO L264 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 10:50:40,754 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:50:40,769 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 10:50:40,769 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:40,775 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:40,775 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 10:50:40,775 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2019-12-07 10:50:40,812 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 17 treesize of output 9 [2019-12-07 10:50:40,812 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:40,814 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:40,814 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 10:50:40,814 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-12-07 10:50:40,833 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:50:40,833 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:50:40,907 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 10:50:40,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1365847809] [2019-12-07 10:50:40,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:50:40,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 7] imperfect sequences [] total 13 [2019-12-07 10:50:40,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063019128] [2019-12-07 10:50:40,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 10:50:40,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:50:40,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 10:50:40,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:50:40,908 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 14 states. [2019-12-07 10:50:41,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:50:41,542 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2019-12-07 10:50:41,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:50:41,543 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2019-12-07 10:50:41,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:50:41,543 INFO L225 Difference]: With dead ends: 86 [2019-12-07 10:50:41,543 INFO L226 Difference]: Without dead ends: 86 [2019-12-07 10:50:41,544 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2019-12-07 10:50:41,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-12-07 10:50:41,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-12-07 10:50:41,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-07 10:50:41,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2019-12-07 10:50:41,545 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 30 [2019-12-07 10:50:41,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:50:41,545 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2019-12-07 10:50:41,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 10:50:41,545 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2019-12-07 10:50:41,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 10:50:41,546 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:50:41,546 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:50:41,746 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 mathsat -unsat_core_generation=3 [2019-12-07 10:50:41,747 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 10:50:41,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:50:41,748 INFO L82 PathProgramCache]: Analyzing trace with hash 652960449, now seen corresponding path program 1 times [2019-12-07 10:50:41,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:50:41,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1431724830] [2019-12-07 10:50:41,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/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 10:50:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:50:41,841 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 10:50:41,842 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:50:41,862 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:41,863 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 10:50:41,863 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:41,879 INFO L614 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-12-07 10:50:41,879 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:50:41,879 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2019-12-07 10:50:41,909 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 10:50:41,909 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:41,919 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:41,919 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 10:50:41,920 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:32 [2019-12-07 10:50:41,978 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 25 treesize of output 13 [2019-12-07 10:50:41,978 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:41,983 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:41,983 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:50:41,983 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2019-12-07 10:50:42,027 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 17 treesize of output 17 [2019-12-07 10:50:42,027 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:42,035 INFO L614 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-12-07 10:50:42,035 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 10:50:42,035 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-12-07 10:50:42,061 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:50:42,061 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:50:42,301 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:42,301 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 12 treesize of output 16 [2019-12-07 10:50:42,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:50:42,302 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:42,303 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:42,303 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:50:42,303 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2019-12-07 10:50:42,305 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:50:42,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1431724830] [2019-12-07 10:50:42,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [115513368] [2019-12-07 10:50:42,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/cvc4 Starting monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 10:50:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:50:42,449 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-07 10:50:42,450 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:50:42,453 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 5 treesize of output 3 [2019-12-07 10:50:42,453 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:42,454 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:42,454 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:50:42,454 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2019-12-07 10:50:42,459 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:42,459 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 11 treesize of output 15 [2019-12-07 10:50:42,460 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:42,463 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:42,463 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:50:42,463 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-07 10:50:42,550 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 10:50:42,550 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:42,559 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:42,559 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 10:50:42,559 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:25 [2019-12-07 10:50:42,675 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 25 treesize of output 13 [2019-12-07 10:50:42,675 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:42,679 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:42,679 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:50:42,679 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:10 [2019-12-07 10:50:42,722 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:42,723 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 18 treesize of output 34 [2019-12-07 10:50:42,723 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:42,738 INFO L614 ElimStorePlain]: treesize reduction 18, result has 37.9 percent of original size [2019-12-07 10:50:42,738 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 10:50:42,738 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-12-07 10:50:42,742 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:50:42,742 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:50:42,750 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 17 treesize of output 13 [2019-12-07 10:50:42,750 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:42,751 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:42,752 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:50:42,752 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:4 [2019-12-07 10:50:42,806 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:42,806 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 12 treesize of output 16 [2019-12-07 10:50:42,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:50:42,806 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:42,807 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:42,808 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:50:42,808 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2019-12-07 10:50:42,809 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:50:42,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810423617] [2019-12-07 10:50:42,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:50:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:50:42,857 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 10:50:42,857 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:50:42,864 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:42,864 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 11 treesize of output 15 [2019-12-07 10:50:42,864 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:42,867 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:42,868 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:50:42,868 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-07 10:50:42,871 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 10:50:42,872 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:42,880 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:42,880 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 10:50:42,881 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:25 [2019-12-07 10:50:42,884 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 25 treesize of output 13 [2019-12-07 10:50:42,884 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:42,889 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:42,889 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:50:42,889 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:10 [2019-12-07 10:50:42,934 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:42,934 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 18 treesize of output 34 [2019-12-07 10:50:42,935 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:42,950 INFO L614 ElimStorePlain]: treesize reduction 18, result has 37.9 percent of original size [2019-12-07 10:50:42,950 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 10:50:42,950 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-12-07 10:50:42,953 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:50:42,953 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:50:42,956 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 17 treesize of output 13 [2019-12-07 10:50:42,957 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:42,958 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:42,958 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:50:42,958 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:4 [2019-12-07 10:50:42,966 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:42,967 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 12 treesize of output 16 [2019-12-07 10:50:42,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:50:42,967 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:42,968 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:42,968 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:50:42,968 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2019-12-07 10:50:42,970 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:50:42,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 10:50:42,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12, 12, 12, 12] total 28 [2019-12-07 10:50:42,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838085200] [2019-12-07 10:50:42,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 10:50:42,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:50:42,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 10:50:42,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2019-12-07 10:50:42,972 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 29 states. [2019-12-07 10:50:44,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:50:44,622 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2019-12-07 10:50:44,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 10:50:44,623 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 33 [2019-12-07 10:50:44,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:50:44,623 INFO L225 Difference]: With dead ends: 85 [2019-12-07 10:50:44,623 INFO L226 Difference]: Without dead ends: 85 [2019-12-07 10:50:44,624 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 158 SyntacticMatches, 7 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=278, Invalid=1282, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 10:50:44,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-12-07 10:50:44,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-12-07 10:50:44,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-12-07 10:50:44,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2019-12-07 10:50:44,625 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 33 [2019-12-07 10:50:44,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:50:44,626 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2019-12-07 10:50:44,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 10:50:44,626 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2019-12-07 10:50:44,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 10:50:44,626 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:50:44,626 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:50:45,227 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true,30 mathsat -unsat_core_generation=3,31 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 10:50:45,228 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 10:50:45,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:50:45,229 INFO L82 PathProgramCache]: Analyzing trace with hash 652529473, now seen corresponding path program 1 times [2019-12-07 10:50:45,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:50:45,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207518998] [2019-12-07 10:50:45,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/mathsat Starting monitored process 33 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with mathsat -unsat_core_generation=3 [2019-12-07 10:50:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:50:45,412 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 10:50:45,413 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:50:45,419 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 10:50:45,419 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:45,423 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:45,423 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:50:45,423 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 10:50:45,498 INFO L343 Elim1Store]: treesize reduction 8, result has 87.3 percent of original size [2019-12-07 10:50:45,498 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 71 [2019-12-07 10:50:45,499 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:45,531 INFO L614 ElimStorePlain]: treesize reduction 28, result has 49.1 percent of original size [2019-12-07 10:50:45,531 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:50:45,531 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:27 [2019-12-07 10:50:45,551 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 10:50:45,551 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:45,563 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:45,563 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:50:45,563 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-12-07 10:50:45,613 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:45,613 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 1 case distinctions, treesize of input 50 treesize of output 64 [2019-12-07 10:50:45,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:50:45,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:50:45,614 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 10:50:45,669 INFO L614 ElimStorePlain]: treesize reduction 39, result has 55.2 percent of original size [2019-12-07 10:50:45,669 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 10:50:45,669 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:67, output treesize:48 [2019-12-07 10:50:45,797 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:45,797 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 42 treesize of output 83 [2019-12-07 10:50:45,798 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:47,892 WARN L192 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2019-12-07 10:50:47,893 INFO L614 ElimStorePlain]: treesize reduction 42, result has 57.6 percent of original size [2019-12-07 10:50:47,893 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:50:47,893 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:61, output treesize:57 [2019-12-07 10:50:47,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:50:48,009 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:48,009 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 113 [2019-12-07 10:50:48,009 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:48,077 INFO L614 ElimStorePlain]: treesize reduction 46, result has 58.9 percent of original size [2019-12-07 10:50:48,078 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:50:48,078 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:75 [2019-12-07 10:50:48,356 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:48,356 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 66 treesize of output 100 [2019-12-07 10:50:48,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:50:48,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:50:48,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:50:48,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:50:48,358 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 10:50:48,385 INFO L614 ElimStorePlain]: treesize reduction 26, result has 48.0 percent of original size [2019-12-07 10:50:48,385 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 10:50:48,385 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:71, output treesize:24 [2019-12-07 10:50:48,463 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 17 treesize of output 17 [2019-12-07 10:50:48,463 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:48,471 INFO L614 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-12-07 10:50:48,471 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 10:50:48,471 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-12-07 10:50:48,514 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:50:48,514 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:50:49,086 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 10:50:49,110 INFO L614 ElimStorePlain]: treesize reduction 11, result has 71.1 percent of original size [2019-12-07 10:50:49,110 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 10:50:49,110 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:22 [2019-12-07 10:50:51,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:50:51,231 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:51,232 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 31 treesize of output 35 [2019-12-07 10:50:51,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:50:51,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:50:51,232 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:51,244 INFO L614 ElimStorePlain]: treesize reduction 13, result has 35.0 percent of original size [2019-12-07 10:50:51,244 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 10:50:51,244 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:3 [2019-12-07 10:50:51,247 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:50:51,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207518998] [2019-12-07 10:50:51,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [172269351] [2019-12-07 10:50:51,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/cvc4 Starting monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 10:50:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:50:51,442 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-07 10:50:51,443 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:50:51,537 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:51,537 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 12 treesize of output 28 [2019-12-07 10:50:51,537 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:51,552 INFO L614 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-12-07 10:50:51,552 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:50:51,552 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-12-07 10:50:51,614 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:51,614 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 36 [2019-12-07 10:50:51,615 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:51,620 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:51,620 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:50:51,620 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:12 [2019-12-07 10:50:51,671 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 10:50:51,671 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:51,678 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:51,678 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:50:51,679 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-12-07 10:50:51,755 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:51,755 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 1 case distinctions, treesize of input 41 treesize of output 59 [2019-12-07 10:50:51,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:50:51,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:50:51,756 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 10:50:51,797 INFO L614 ElimStorePlain]: treesize reduction 39, result has 49.4 percent of original size [2019-12-07 10:50:51,797 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 10:50:51,797 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-12-07 10:50:52,012 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:52,012 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 42 treesize of output 83 [2019-12-07 10:50:52,013 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:52,059 INFO L614 ElimStorePlain]: treesize reduction 42, result has 51.7 percent of original size [2019-12-07 10:50:52,059 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:50:52,059 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-12-07 10:50:52,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:50:52,220 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:52,220 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 113 [2019-12-07 10:50:52,221 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:52,279 INFO L614 ElimStorePlain]: treesize reduction 68, result has 44.3 percent of original size [2019-12-07 10:50:52,279 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:50:52,279 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:57 [2019-12-07 10:50:52,666 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:52,666 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 95 [2019-12-07 10:50:52,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:50:52,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:50:52,667 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:52,680 INFO L614 ElimStorePlain]: treesize reduction 42, result has 22.2 percent of original size [2019-12-07 10:50:52,680 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 10:50:52,680 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:12 [2019-12-07 10:50:52,721 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:52,722 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 18 treesize of output 34 [2019-12-07 10:50:52,722 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:52,732 INFO L614 ElimStorePlain]: treesize reduction 18, result has 37.9 percent of original size [2019-12-07 10:50:52,732 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 10:50:52,732 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-12-07 10:50:52,737 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:50:52,737 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:50:52,828 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:52,828 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 83 treesize of output 87 [2019-12-07 10:50:52,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:50:52,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:50:52,829 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 10:50:52,843 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:52,843 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-12-07 10:50:52,843 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:72 [2019-12-07 10:50:53,107 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 10:50:53,216 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2019-12-07 10:50:53,217 INFO L614 ElimStorePlain]: treesize reduction 30, result has 73.0 percent of original size [2019-12-07 10:50:53,218 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 10:50:53,220 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:53,250 INFO L614 ElimStorePlain]: treesize reduction 10, result has 69.7 percent of original size [2019-12-07 10:50:53,250 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 10:50:53,250 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:136, output treesize:9 [2019-12-07 10:50:53,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:50:53,376 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:50:53,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754202466] [2019-12-07 10:50:53,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:50:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:50:53,423 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 10:50:53,424 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:50:53,441 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:53,441 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 36 [2019-12-07 10:50:53,442 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:53,446 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:53,446 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:50:53,446 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:9 [2019-12-07 10:50:53,449 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 10:50:53,449 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:53,456 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:53,456 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:50:53,456 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-12-07 10:50:53,554 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:53,554 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 1 case distinctions, treesize of input 39 treesize of output 57 [2019-12-07 10:50:53,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:50:53,555 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:53,567 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:53,568 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 10:50:53,568 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2019-12-07 10:50:53,826 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:50:53,826 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 42 treesize of output 83 [2019-12-07 10:50:53,827 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:50:53,877 INFO L614 ElimStorePlain]: treesize reduction 42, result has 50.0 percent of original size [2019-12-07 10:50:53,878 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:50:53,878 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:42 [2019-12-07 10:51:10,385 WARN L192 SmtUtils]: Spent 16.39 s on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-12-07 10:51:10,386 INFO L343 Elim1Store]: treesize reduction 20, result has 79.8 percent of original size [2019-12-07 10:51:10,386 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 113 [2019-12-07 10:51:10,387 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:10,453 INFO L614 ElimStorePlain]: treesize reduction 68, result has 42.9 percent of original size [2019-12-07 10:51:10,453 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:51:10,454 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:54 [2019-12-07 10:51:11,009 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-12-07 10:51:11,010 INFO L343 Elim1Store]: treesize reduction 10, result has 87.7 percent of original size [2019-12-07 10:51:11,010 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 99 [2019-12-07 10:51:11,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:51:11,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:51:11,011 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:11,025 INFO L614 ElimStorePlain]: treesize reduction 48, result has 17.2 percent of original size [2019-12-07 10:51:11,026 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 10:51:11,026 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:61, output treesize:10 [2019-12-07 10:51:11,068 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:11,068 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 18 treesize of output 34 [2019-12-07 10:51:11,068 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:11,079 INFO L614 ElimStorePlain]: treesize reduction 18, result has 37.9 percent of original size [2019-12-07 10:51:11,079 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 10:51:11,079 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-12-07 10:51:11,084 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:51:11,084 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:51:11,135 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:11,136 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 83 treesize of output 87 [2019-12-07 10:51:11,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:51:11,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:51:11,136 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 10:51:11,149 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:11,149 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-12-07 10:51:11,149 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:72 [2019-12-07 10:51:11,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:51:11,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:51:11,423 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:11,423 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 38 [2019-12-07 10:51:11,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:51:11,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:51:11,424 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:11,428 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:11,428 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:51:11,428 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:7 [2019-12-07 10:51:11,481 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:51:11,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 10:51:11,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 17, 15, 16, 16] total 49 [2019-12-07 10:51:11,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490533138] [2019-12-07 10:51:11,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-12-07 10:51:11,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:51:11,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-12-07 10:51:11,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=2223, Unknown=1, NotChecked=0, Total=2450 [2019-12-07 10:51:11,482 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 50 states. [2019-12-07 10:51:12,787 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-12-07 10:51:16,229 WARN L192 SmtUtils]: Spent 2.28 s on a formula simplification that was a NOOP. DAG size: 84 [2019-12-07 10:51:16,472 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-12-07 10:51:17,150 WARN L192 SmtUtils]: Spent 500.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-12-07 10:51:17,718 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-07 10:51:18,250 WARN L192 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-07 10:51:19,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:51:19,487 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2019-12-07 10:51:19,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 10:51:19,487 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 33 [2019-12-07 10:51:19,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:51:19,488 INFO L225 Difference]: With dead ends: 88 [2019-12-07 10:51:19,488 INFO L226 Difference]: Without dead ends: 88 [2019-12-07 10:51:19,489 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 134 SyntacticMatches, 10 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1584 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=654, Invalid=3897, Unknown=5, NotChecked=0, Total=4556 [2019-12-07 10:51:19,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-12-07 10:51:19,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2019-12-07 10:51:19,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-07 10:51:19,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2019-12-07 10:51:19,490 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 33 [2019-12-07 10:51:19,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:51:19,491 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2019-12-07 10:51:19,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-12-07 10:51:19,491 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2019-12-07 10:51:19,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:51:19,491 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:51:19,491 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:51:20,092 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,34 cvc4 --incremental --print-success --lang smt --rewrite-divk,33 mathsat -unsat_core_generation=3 [2019-12-07 10:51:20,093 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 10:51:20,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:51:20,093 INFO L82 PathProgramCache]: Analyzing trace with hash -554352783, now seen corresponding path program 1 times [2019-12-07 10:51:20,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:51:20,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1931560276] [2019-12-07 10:51:20,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/mathsat Starting monitored process 36 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with mathsat -unsat_core_generation=3 [2019-12-07 10:51:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:20,216 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-07 10:51:20,216 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:51:20,222 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 10:51:20,222 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:20,226 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:20,226 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:51:20,226 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 10:51:20,305 INFO L343 Elim1Store]: treesize reduction 8, result has 87.3 percent of original size [2019-12-07 10:51:20,306 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 71 [2019-12-07 10:51:20,306 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:20,340 INFO L614 ElimStorePlain]: treesize reduction 28, result has 49.1 percent of original size [2019-12-07 10:51:20,340 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:51:20,340 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:27 [2019-12-07 10:51:20,362 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 10:51:20,362 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:20,376 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:20,376 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:51:20,377 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-12-07 10:51:20,429 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:20,430 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 1 case distinctions, treesize of input 39 treesize of output 57 [2019-12-07 10:51:20,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:51:20,430 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:20,449 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:20,450 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 10:51:20,450 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:48 [2019-12-07 10:51:20,576 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:20,576 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 42 treesize of output 83 [2019-12-07 10:51:20,577 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:20,636 INFO L614 ElimStorePlain]: treesize reduction 42, result has 57.6 percent of original size [2019-12-07 10:51:20,636 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:51:20,636 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:61, output treesize:57 [2019-12-07 10:51:20,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:51:20,757 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:20,757 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 113 [2019-12-07 10:51:20,757 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:20,824 INFO L614 ElimStorePlain]: treesize reduction 68, result has 49.3 percent of original size [2019-12-07 10:51:20,825 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:51:20,825 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:75 [2019-12-07 10:51:21,081 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:21,081 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 66 treesize of output 100 [2019-12-07 10:51:21,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:51:21,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:51:21,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:51:21,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:51:21,083 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 10:51:21,106 INFO L614 ElimStorePlain]: treesize reduction 26, result has 50.0 percent of original size [2019-12-07 10:51:21,107 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 10:51:21,107 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:71, output treesize:26 [2019-12-07 10:51:21,184 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 17 treesize of output 17 [2019-12-07 10:51:21,184 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:21,191 INFO L614 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-12-07 10:51:21,191 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 10:51:21,191 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-12-07 10:51:21,233 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:51:21,234 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:51:21,757 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 10:51:21,775 INFO L614 ElimStorePlain]: treesize reduction 11, result has 62.1 percent of original size [2019-12-07 10:51:21,775 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 10:51:21,775 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:13 [2019-12-07 10:51:23,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:51:23,887 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:23,887 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 31 treesize of output 35 [2019-12-07 10:51:23,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:51:23,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:51:23,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:51:23,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:51:23,889 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:23,910 INFO L614 ElimStorePlain]: treesize reduction 14, result has 33.3 percent of original size [2019-12-07 10:51:23,910 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 10:51:23,910 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:3 [2019-12-07 10:51:23,913 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:51:23,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1931560276] [2019-12-07 10:51:23,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [95401109] [2019-12-07 10:51:23,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/cvc4 Starting monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 10:51:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:24,106 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-07 10:51:24,107 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:51:24,201 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:24,202 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 12 treesize of output 28 [2019-12-07 10:51:24,202 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:24,215 INFO L614 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-12-07 10:51:24,215 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:51:24,216 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-12-07 10:51:24,323 INFO L343 Elim1Store]: treesize reduction 8, result has 87.3 percent of original size [2019-12-07 10:51:24,323 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 71 [2019-12-07 10:51:24,323 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:24,356 INFO L614 ElimStorePlain]: treesize reduction 28, result has 49.1 percent of original size [2019-12-07 10:51:24,356 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:51:24,356 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:27 [2019-12-07 10:51:24,360 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 10:51:24,360 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:24,373 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:24,374 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:51:24,374 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-12-07 10:51:24,402 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:24,403 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 1 case distinctions, treesize of input 41 treesize of output 59 [2019-12-07 10:51:24,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:51:24,403 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:24,425 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:24,425 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 10:51:24,425 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:48 [2019-12-07 10:51:24,508 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:24,509 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 42 treesize of output 83 [2019-12-07 10:51:24,509 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:24,567 INFO L614 ElimStorePlain]: treesize reduction 42, result has 57.6 percent of original size [2019-12-07 10:51:24,568 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:51:24,568 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:61, output treesize:57 [2019-12-07 10:51:24,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:51:24,631 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:24,632 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 113 [2019-12-07 10:51:24,632 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:24,698 INFO L614 ElimStorePlain]: treesize reduction 68, result has 49.3 percent of original size [2019-12-07 10:51:24,698 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:51:24,698 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:75 [2019-12-07 10:51:24,756 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:24,757 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 66 treesize of output 100 [2019-12-07 10:51:24,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:51:24,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:51:24,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:51:24,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:51:24,758 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 10:51:24,788 INFO L614 ElimStorePlain]: treesize reduction 26, result has 48.0 percent of original size [2019-12-07 10:51:24,789 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 10:51:24,789 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:71, output treesize:24 [2019-12-07 10:51:24,828 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 17 treesize of output 17 [2019-12-07 10:51:24,828 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:24,836 INFO L614 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-12-07 10:51:24,836 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 10:51:24,836 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-12-07 10:51:24,842 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:51:24,843 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:51:24,912 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 10:51:24,935 INFO L614 ElimStorePlain]: treesize reduction 11, result has 62.1 percent of original size [2019-12-07 10:51:24,935 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 10:51:24,935 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:13 [2019-12-07 10:51:24,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:51:24,998 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:51:25,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637985774] [2019-12-07 10:51:25,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:51:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:51:25,062 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 10:51:25,063 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:51:25,076 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:25,076 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 12 treesize of output 28 [2019-12-07 10:51:25,077 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:25,089 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 10:51:25,090 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:51:25,090 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-12-07 10:51:25,107 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:25,107 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 36 [2019-12-07 10:51:25,107 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:25,112 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:25,112 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:51:25,112 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:9 [2019-12-07 10:51:27,161 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 10:51:27,161 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:27,168 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:27,168 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:51:27,168 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-12-07 10:51:27,251 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:27,251 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 1 case distinctions, treesize of input 30 treesize of output 52 [2019-12-07 10:51:27,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:51:27,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:51:27,252 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 10:51:27,289 INFO L614 ElimStorePlain]: treesize reduction 30, result has 46.4 percent of original size [2019-12-07 10:51:27,289 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 10:51:27,290 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2019-12-07 10:51:27,519 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:27,520 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 33 treesize of output 78 [2019-12-07 10:51:27,520 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:27,575 INFO L614 ElimStorePlain]: treesize reduction 42, result has 44.0 percent of original size [2019-12-07 10:51:27,575 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:51:27,575 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2019-12-07 10:51:44,153 WARN L192 SmtUtils]: Spent 16.47 s on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-12-07 10:51:44,153 INFO L343 Elim1Store]: treesize reduction 20, result has 79.8 percent of original size [2019-12-07 10:51:44,153 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 108 [2019-12-07 10:51:44,154 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:44,196 INFO L614 ElimStorePlain]: treesize reduction 46, result has 47.7 percent of original size [2019-12-07 10:51:44,197 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 10:51:44,197 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:45 [2019-12-07 10:51:44,877 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-12-07 10:51:44,877 INFO L343 Elim1Store]: treesize reduction 10, result has 87.7 percent of original size [2019-12-07 10:51:44,877 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 94 [2019-12-07 10:51:44,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:51:44,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:51:44,878 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:44,892 INFO L614 ElimStorePlain]: treesize reduction 48, result has 17.2 percent of original size [2019-12-07 10:51:44,893 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 10:51:44,893 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:57, output treesize:10 [2019-12-07 10:51:44,974 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:44,974 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 10:51:44,975 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:44,989 INFO L614 ElimStorePlain]: treesize reduction 18, result has 37.9 percent of original size [2019-12-07 10:51:44,990 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 10:51:44,990 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2019-12-07 10:51:44,994 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:51:44,994 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:51:44,997 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 21 treesize of output 17 [2019-12-07 10:51:44,997 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:51:44,998 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:51:44,998 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:51:44,998 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:8 [2019-12-07 10:51:47,856 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 10:51:47,889 INFO L614 ElimStorePlain]: treesize reduction 30, result has 31.8 percent of original size [2019-12-07 10:51:47,889 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 10:51:47,889 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:68, output treesize:9 [2019-12-07 10:51:47,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:51:48,027 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:51:48,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 10:51:48,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 17, 15, 16, 16] total 47 [2019-12-07 10:51:48,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550774593] [2019-12-07 10:51:48,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-12-07 10:51:48,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:51:48,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-12-07 10:51:48,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=2031, Unknown=7, NotChecked=0, Total=2256 [2019-12-07 10:51:48,029 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 48 states. [2019-12-07 10:51:49,479 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-12-07 10:51:52,360 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-12-07 10:51:52,942 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 10:51:53,184 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-12-07 10:51:55,862 WARN L192 SmtUtils]: Spent 2.54 s on a formula simplification. DAG size of input: 107 DAG size of output: 105 [2019-12-07 10:51:56,588 WARN L192 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2019-12-07 10:51:57,361 WARN L192 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2019-12-07 10:51:59,897 WARN L192 SmtUtils]: Spent 2.16 s on a formula simplification that was a NOOP. DAG size: 76 [2019-12-07 10:52:02,461 WARN L192 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2019-12-07 10:52:04,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:52:04,538 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2019-12-07 10:52:04,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 10:52:04,539 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 34 [2019-12-07 10:52:04,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:52:04,540 INFO L225 Difference]: With dead ends: 87 [2019-12-07 10:52:04,540 INFO L226 Difference]: Without dead ends: 87 [2019-12-07 10:52:04,541 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 140 SyntacticMatches, 12 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1423 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=681, Invalid=3730, Unknown=11, NotChecked=0, Total=4422 [2019-12-07 10:52:04,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-07 10:52:04,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2019-12-07 10:52:04,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-12-07 10:52:04,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2019-12-07 10:52:04,542 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 34 [2019-12-07 10:52:04,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:52:04,543 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2019-12-07 10:52:04,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-12-07 10:52:04,543 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2019-12-07 10:52:04,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:52:04,543 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:52:04,543 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:52:05,144 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true,37 cvc4 --incremental --print-success --lang smt --rewrite-divk,36 mathsat -unsat_core_generation=3 [2019-12-07 10:52:05,145 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 10:52:05,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:52:05,146 INFO L82 PathProgramCache]: Analyzing trace with hash -553921807, now seen corresponding path program 1 times [2019-12-07 10:52:05,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:52:05,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1014712929] [2019-12-07 10:52:05,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/mathsat Starting monitored process 39 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with mathsat -unsat_core_generation=3 [2019-12-07 10:52:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:05,332 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-07 10:52:05,333 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:52:05,337 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 10:52:05,337 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:05,340 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:05,340 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:52:05,341 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 10:52:05,365 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:05,365 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 10:52:05,365 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:05,385 INFO L614 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-12-07 10:52:05,385 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:52:05,385 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-12-07 10:52:05,447 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:05,448 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 24 treesize of output 71 [2019-12-07 10:52:05,448 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:05,485 INFO L614 ElimStorePlain]: treesize reduction 28, result has 54.8 percent of original size [2019-12-07 10:52:05,486 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:52:05,486 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:34 [2019-12-07 10:52:05,512 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:52:05,512 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:05,530 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:05,530 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:52:05,530 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2019-12-07 10:52:05,585 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:05,585 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 1 case distinctions, treesize of input 49 treesize of output 63 [2019-12-07 10:52:05,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:52:05,586 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:05,612 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:05,612 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 10:52:05,612 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:69, output treesize:59 [2019-12-07 10:52:05,756 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:05,756 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 50 treesize of output 87 [2019-12-07 10:52:05,757 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:05,815 INFO L614 ElimStorePlain]: treesize reduction 46, result has 57.0 percent of original size [2019-12-07 10:52:05,815 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 10:52:05,815 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2019-12-07 10:52:05,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:52:05,929 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:05,929 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 125 [2019-12-07 10:52:05,930 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:05,992 INFO L614 ElimStorePlain]: treesize reduction 58, result has 54.7 percent of original size [2019-12-07 10:52:05,992 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 10:52:05,992 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:74, output treesize:79 [2019-12-07 10:52:06,387 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:06,387 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 77 treesize of output 87 [2019-12-07 10:52:06,387 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:06,417 INFO L614 ElimStorePlain]: treesize reduction 18, result has 60.9 percent of original size [2019-12-07 10:52:06,417 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 10:52:06,418 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:82, output treesize:28 [2019-12-07 10:52:06,533 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 22 treesize of output 25 [2019-12-07 10:52:06,533 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:52:06,550 INFO L614 ElimStorePlain]: treesize reduction 8, result has 71.4 percent of original size [2019-12-07 10:52:06,550 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 10:52:06,550 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:20 [2019-12-07 10:52:06,609 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:52:06,609 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:52:07,452 INFO L343 Elim1Store]: treesize reduction 83, result has 30.8 percent of original size [2019-12-07 10:52:07,452 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 3 case distinctions, treesize of input 77 treesize of output 54 [2019-12-07 10:52:07,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:52:07,474 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:52:07,475 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 54 treesize of output 70 [2019-12-07 10:52:07,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:52:07,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:52:07,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:52:07,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:52:07,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:52:07,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:52:07,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:52:07,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:52:07,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:52:07,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:52:07,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:52:07,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:52:07,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:52:07,484 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_306, v_arrayElimCell_305], 2=[v_arrayElimCell_304]} [2019-12-07 10:52:07,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1014712929] [2019-12-07 10:52:07,489 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@47b7c039 [2019-12-07 10:52:07,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1020267034] [2019-12-07 10:52:07,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/cvc4 Starting monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 10:52:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:07,657 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 10:52:07,658 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:52:07,659 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@47b7c039 [2019-12-07 10:52:07,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387086513] [2019-12-07 10:52:07,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2170a1b0-e552-4eaf-853c-d2bd139fec38/bin/utaipan/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:52:07,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:52:07,708 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-07 10:52:07,709 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:52:07,710 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@47b7c039 [2019-12-07 10:52:07,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:52:07,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 10:52:07,710 ERROR L206 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2019-12-07 10:52:07,710 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:52:08,314 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 mathsat -unsat_core_generation=3,40 cvc4 --incremental --print-success --lang smt --rewrite-divk,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:52:08,343 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 10:52:08,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:52:08 BoogieIcfgContainer [2019-12-07 10:52:08,344 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:52:08,344 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:52:08,344 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:52:08,344 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:52:08,345 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:47:33" (3/4) ... [2019-12-07 10:52:08,348 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 10:52:08,348 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:52:08,349 INFO L168 Benchmark]: Toolchain (without parser) took 275997.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.1 MB). Free memory was 947.0 MB in the beginning and 973.2 MB in the end (delta: -26.2 MB). Peak memory consumption was 158.9 MB. Max. memory is 11.5 GB. [2019-12-07 10:52:08,349 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 10:52:08,349 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -178.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:52:08,350 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-12-07 10:52:08,350 INFO L168 Benchmark]: Boogie Preprocessor took 24.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:52:08,350 INFO L168 Benchmark]: RCFGBuilder took 390.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 11.5 GB. [2019-12-07 10:52:08,350 INFO L168 Benchmark]: TraceAbstraction took 275222.97 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 41.4 MB). Free memory was 1.1 GB in the beginning and 973.2 MB in the end (delta: 98.8 MB). Peak memory consumption was 140.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:52:08,350 INFO L168 Benchmark]: Witness Printer took 4.08 ms. Allocated memory is still 1.2 GB. Free memory is still 973.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:52:08,351 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 317.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -178.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 390.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 275222.97 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 41.4 MB). Free memory was 1.1 GB in the beginning and 973.2 MB in the end (delta: 98.8 MB). Peak memory consumption was 140.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.08 ms. Allocated memory is still 1.2 GB. Free memory is still 973.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 603]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L617] const int len = 3; [L564] DLL last = (DLL) malloc(sizeof(struct node)); [L565] COND FALSE !(((void *)0) == last) [L568] last->next = last [L569] last->prev = last [L570] DLL head = last; [L571] COND TRUE len > 1 [L572] DLL new_head = (DLL) malloc(sizeof(struct node)); [L573] COND FALSE !(((void *)0) == new_head) [L576] new_head->next = head [L577] head->prev = new_head [L578] head = new_head [L579] len-- [L571] COND TRUE len > 1 [L572] DLL new_head = (DLL) malloc(sizeof(struct node)); [L573] COND FALSE !(((void *)0) == new_head) [L576] new_head->next = head [L577] head->prev = new_head [L578] head = new_head [L579] len-- [L571] COND FALSE !(len > 1) [L581] last->next = head [L582] head->prev = last [L583] return head; [L618] DLL head = dll_circular_create(len); [L586] EXPR head->prev [L586] DLL pred = head->prev; [L587] EXPR head->next [L587] DLL succ = head->next; [L588] COND FALSE !(__VERIFIER_nondet_int()) [L597] COND TRUE __VERIFIER_nondet_int() [L598] free(succ) [L598] free(succ) [L598] free(succ) [L599] COND FALSE !(__VERIFIER_nondet_int()) [L603] free(pred) [L603] free(pred) [L603] free(pred) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 59 error locations. Result: UNKNOWN, OverallTime: 275.1s, OverallIterations: 22, TraceHistogramMax: 2, AutomataDifference: 129.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1622 SDtfs, 7554 SDslu, 4574 SDs, 0 SdLazy, 6895 SolverSat, 838 SolverUnsat, 20 SolverUnknown, 0 SolverNotchecked, 64.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1803 GetRequests, 1262 SyntacticMatches, 66 SemanticMatches, 475 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 6598 ImplicationChecksByTransitivity, 94.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 25 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 131.0s InterpolantComputationTime, 865 NumberOfCodeBlocks, 865 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1656 ConstructedInterpolants, 340 QuantifiedInterpolants, 563393 SizeOfPredicates, 590 NumberOfNonLiveVariables, 3754 ConjunctsInSsa, 661 ConjunctsInUnsatCore, 74 InterpolantComputations, 26 PerfectInterpolantSequences, 123/384 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...