./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.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_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/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 f711e8fa055cb799c5be49ac147c434ba7c6e879 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/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 f711e8fa055cb799c5be49ac147c434ba7c6e879 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 14:29:13,501 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:29:13,502 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:29:13,510 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:29:13,510 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:29:13,511 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:29:13,512 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:29:13,514 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:29:13,515 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:29:13,516 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:29:13,517 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:29:13,518 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:29:13,518 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:29:13,519 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:29:13,520 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:29:13,521 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:29:13,522 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:29:13,523 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:29:13,524 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:29:13,527 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:29:13,528 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:29:13,529 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:29:13,530 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:29:13,530 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:29:13,533 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:29:13,533 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:29:13,533 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:29:13,534 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:29:13,534 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:29:13,535 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:29:13,535 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:29:13,535 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:29:13,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:29:13,536 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:29:13,537 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:29:13,537 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:29:13,538 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:29:13,538 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:29:13,538 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:29:13,539 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:29:13,540 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:29:13,540 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 14:29:13,553 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:29:13,553 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:29:13,554 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 14:29:13,554 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 14:29:13,554 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 14:29:13,554 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 14:29:13,554 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 14:29:13,555 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 14:29:13,555 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 14:29:13,556 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 14:29:13,557 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 14:29:13,557 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 14:29:13,557 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 14:29:13,557 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 14:29:13,557 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 14:29:13,558 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:29:13,558 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:29:13,558 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:29:13,558 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:29:13,558 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 14:29:13,558 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:29:13,558 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:29:13,558 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:29:13,559 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 14:29:13,559 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 14:29:13,559 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 14:29:13,559 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:29:13,559 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 14:29:13,559 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:29:13,559 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:29:13,559 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:29:13,559 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:29:13,560 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:29:13,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:29:13,560 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:29:13,560 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:29:13,560 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 14:29:13,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:29:13,560 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:29:13,560 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 14:29:13,560 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_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/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 -> f711e8fa055cb799c5be49ac147c434ba7c6e879 [2019-12-07 14:29:13,662 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:29:13,672 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:29:13,675 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:29:13,676 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:29:13,677 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:29:13,677 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/bin/utaipan/../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.i [2019-12-07 14:29:13,718 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/bin/utaipan/data/a17c5ad33/08c27f0936474c0da6758cb8f293eb40/FLAG0feef051c [2019-12-07 14:29:14,104 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:29:14,105 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.i [2019-12-07 14:29:14,113 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/bin/utaipan/data/a17c5ad33/08c27f0936474c0da6758cb8f293eb40/FLAG0feef051c [2019-12-07 14:29:14,121 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/bin/utaipan/data/a17c5ad33/08c27f0936474c0da6758cb8f293eb40 [2019-12-07 14:29:14,123 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:29:14,124 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:29:14,125 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:29:14,125 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:29:14,127 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:29:14,127 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:29:14" (1/1) ... [2019-12-07 14:29:14,129 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ac05d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:29:14, skipping insertion in model container [2019-12-07 14:29:14,129 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:29:14" (1/1) ... [2019-12-07 14:29:14,134 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:29:14,159 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:29:14,367 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:29:14,374 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:29:14,408 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:29:14,439 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:29:14,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:29:14 WrapperNode [2019-12-07 14:29:14,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:29:14,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:29:14,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:29:14,440 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:29:14,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 02:29:14" (1/1) ... [2019-12-07 14:29:14,457 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:29:14" (1/1) ... [2019-12-07 14:29:14,473 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:29:14,474 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:29:14,474 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:29:14,474 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:29:14,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:29:14" (1/1) ... [2019-12-07 14:29:14,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:29:14" (1/1) ... [2019-12-07 14:29:14,483 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:29:14" (1/1) ... [2019-12-07 14:29:14,484 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:29:14" (1/1) ... [2019-12-07 14:29:14,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:29:14" (1/1) ... [2019-12-07 14:29:14,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:29:14" (1/1) ... [2019-12-07 14:29:14,494 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:29:14" (1/1) ... [2019-12-07 14:29:14,496 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:29:14,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:29:14,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:29:14,497 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:29:14,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:29:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/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 14:29:14,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 14:29:14,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:29:14,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 14:29:14,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 14:29:14,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 14:29:14,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:29:14,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:29:14,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:29:14,855 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:29:14,856 INFO L287 CfgBuilder]: Removed 13 assume(true) statements. [2019-12-07 14:29:14,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:29:14 BoogieIcfgContainer [2019-12-07 14:29:14,856 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:29:14,857 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:29:14,857 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:29:14,859 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:29:14,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:29:14" (1/3) ... [2019-12-07 14:29:14,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d05a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:29:14, skipping insertion in model container [2019-12-07 14:29:14,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:29:14" (2/3) ... [2019-12-07 14:29:14,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d05a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:29:14, skipping insertion in model container [2019-12-07 14:29:14,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:29:14" (3/3) ... [2019-12-07 14:29:14,861 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-1.i [2019-12-07 14:29:14,867 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:29:14,872 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 32 error locations. [2019-12-07 14:29:14,879 INFO L249 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2019-12-07 14:29:14,892 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:29:14,892 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 14:29:14,892 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:29:14,892 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:29:14,892 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:29:14,892 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:29:14,892 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:29:14,892 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:29:14,903 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2019-12-07 14:29:14,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 14:29:14,907 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:29:14,908 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 14:29:14,908 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 14:29:14,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:29:14,912 INFO L82 PathProgramCache]: Analyzing trace with hash 154019, now seen corresponding path program 1 times [2019-12-07 14:29:14,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:29:14,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440974420] [2019-12-07 14:29:14,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:29:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:29:15,012 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 14:29:15,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440974420] [2019-12-07 14:29:15,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:29:15,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:29:15,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402034983] [2019-12-07 14:29:15,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:29:15,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:29:15,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:29:15,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:29:15,027 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 3 states. [2019-12-07 14:29:15,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:29:15,102 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2019-12-07 14:29:15,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:29:15,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 14:29:15,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:29:15,110 INFO L225 Difference]: With dead ends: 78 [2019-12-07 14:29:15,110 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 14:29:15,111 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 14:29:15,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 14:29:15,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 57. [2019-12-07 14:29:15,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-07 14:29:15,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2019-12-07 14:29:15,135 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 3 [2019-12-07 14:29:15,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:29:15,135 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2019-12-07 14:29:15,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:29:15,135 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2019-12-07 14:29:15,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 14:29:15,135 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:29:15,136 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 14:29:15,136 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 14:29:15,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:29:15,136 INFO L82 PathProgramCache]: Analyzing trace with hash 154020, now seen corresponding path program 1 times [2019-12-07 14:29:15,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:29:15,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270960005] [2019-12-07 14:29:15,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:29:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:29:15,171 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 14:29:15,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270960005] [2019-12-07 14:29:15,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:29:15,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:29:15,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128073680] [2019-12-07 14:29:15,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:29:15,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:29:15,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:29:15,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:29:15,174 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 3 states. [2019-12-07 14:29:15,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:29:15,219 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2019-12-07 14:29:15,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:29:15,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 14:29:15,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:29:15,220 INFO L225 Difference]: With dead ends: 53 [2019-12-07 14:29:15,221 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 14:29:15,221 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 14:29:15,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 14:29:15,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-12-07 14:29:15,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 14:29:15,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-12-07 14:29:15,227 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 3 [2019-12-07 14:29:15,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:29:15,227 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-12-07 14:29:15,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:29:15,227 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-12-07 14:29:15,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 14:29:15,228 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:29:15,228 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:29:15,228 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 14:29:15,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:29:15,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1510732108, now seen corresponding path program 1 times [2019-12-07 14:29:15,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:29:15,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059486617] [2019-12-07 14:29:15,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:29:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:29:15,263 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 14:29:15,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059486617] [2019-12-07 14:29:15,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:29:15,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:29:15,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114396556] [2019-12-07 14:29:15,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:29:15,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:29:15,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:29:15,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:29:15,265 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 3 states. [2019-12-07 14:29:15,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:29:15,273 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2019-12-07 14:29:15,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:29:15,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-07 14:29:15,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:29:15,274 INFO L225 Difference]: With dead ends: 64 [2019-12-07 14:29:15,274 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 14:29:15,274 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 14:29:15,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 14:29:15,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2019-12-07 14:29:15,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-07 14:29:15,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-12-07 14:29:15,279 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 8 [2019-12-07 14:29:15,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:29:15,279 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-12-07 14:29:15,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:29:15,279 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-12-07 14:29:15,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 14:29:15,279 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:29:15,279 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:29:15,280 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 14:29:15,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:29:15,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1510838299, now seen corresponding path program 1 times [2019-12-07 14:29:15,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:29:15,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168735404] [2019-12-07 14:29:15,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:29:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:29:15,311 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 14:29:15,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168735404] [2019-12-07 14:29:15,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:29:15,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:29:15,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101061433] [2019-12-07 14:29:15,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:29:15,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:29:15,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:29:15,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:29:15,313 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 3 states. [2019-12-07 14:29:15,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:29:15,357 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-12-07 14:29:15,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:29:15,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-07 14:29:15,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:29:15,358 INFO L225 Difference]: With dead ends: 69 [2019-12-07 14:29:15,358 INFO L226 Difference]: Without dead ends: 69 [2019-12-07 14:29:15,359 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 14:29:15,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-07 14:29:15,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 52. [2019-12-07 14:29:15,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 14:29:15,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-12-07 14:29:15,363 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 8 [2019-12-07 14:29:15,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:29:15,364 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-12-07 14:29:15,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:29:15,364 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-12-07 14:29:15,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 14:29:15,364 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:29:15,364 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:29:15,365 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 14:29:15,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:29:15,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1510838298, now seen corresponding path program 1 times [2019-12-07 14:29:15,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:29:15,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010702176] [2019-12-07 14:29:15,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:29:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:29:15,403 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 14:29:15,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010702176] [2019-12-07 14:29:15,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:29:15,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:29:15,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709292974] [2019-12-07 14:29:15,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:29:15,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:29:15,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:29:15,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:29:15,404 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 3 states. [2019-12-07 14:29:15,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:29:15,439 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-12-07 14:29:15,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:29:15,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-07 14:29:15,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:29:15,440 INFO L225 Difference]: With dead ends: 50 [2019-12-07 14:29:15,440 INFO L226 Difference]: Without dead ends: 50 [2019-12-07 14:29:15,441 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 14:29:15,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-07 14:29:15,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-12-07 14:29:15,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-07 14:29:15,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-12-07 14:29:15,443 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 8 [2019-12-07 14:29:15,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:29:15,444 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-12-07 14:29:15,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:29:15,444 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-12-07 14:29:15,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 14:29:15,444 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:29:15,444 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:29:15,444 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 14:29:15,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:29:15,445 INFO L82 PathProgramCache]: Analyzing trace with hash -216659000, now seen corresponding path program 1 times [2019-12-07 14:29:15,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:29:15,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896750809] [2019-12-07 14:29:15,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:29:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:29:15,492 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 14:29:15,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896750809] [2019-12-07 14:29:15,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:29:15,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:29:15,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362312220] [2019-12-07 14:29:15,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:29:15,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:29:15,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:29:15,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:29:15,493 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2019-12-07 14:29:15,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:29:15,573 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2019-12-07 14:29:15,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:29:15,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-12-07 14:29:15,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:29:15,574 INFO L225 Difference]: With dead ends: 72 [2019-12-07 14:29:15,574 INFO L226 Difference]: Without dead ends: 72 [2019-12-07 14:29:15,575 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:29:15,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-12-07 14:29:15,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 54. [2019-12-07 14:29:15,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-07 14:29:15,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2019-12-07 14:29:15,578 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 10 [2019-12-07 14:29:15,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:29:15,578 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2019-12-07 14:29:15,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:29:15,579 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2019-12-07 14:29:15,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 14:29:15,579 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:29:15,579 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:29:15,579 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 14:29:15,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:29:15,580 INFO L82 PathProgramCache]: Analyzing trace with hash -216658999, now seen corresponding path program 1 times [2019-12-07 14:29:15,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:29:15,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803855318] [2019-12-07 14:29:15,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:29:15,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:29:15,643 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 14:29:15,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803855318] [2019-12-07 14:29:15,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:29:15,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:29:15,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064053680] [2019-12-07 14:29:15,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:29:15,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:29:15,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:29:15,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:29:15,645 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 6 states. [2019-12-07 14:29:15,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:29:15,752 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-12-07 14:29:15,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:29:15,752 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-12-07 14:29:15,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:29:15,753 INFO L225 Difference]: With dead ends: 71 [2019-12-07 14:29:15,753 INFO L226 Difference]: Without dead ends: 71 [2019-12-07 14:29:15,753 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:29:15,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-12-07 14:29:15,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 54. [2019-12-07 14:29:15,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-07 14:29:15,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-12-07 14:29:15,756 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 10 [2019-12-07 14:29:15,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:29:15,756 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-12-07 14:29:15,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:29:15,757 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-12-07 14:29:15,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 14:29:15,757 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:29:15,757 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:29:15,757 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 14:29:15,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:29:15,758 INFO L82 PathProgramCache]: Analyzing trace with hash 850302895, now seen corresponding path program 1 times [2019-12-07 14:29:15,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:29:15,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765805552] [2019-12-07 14:29:15,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:29:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:29:15,783 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 14:29:15,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765805552] [2019-12-07 14:29:15,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475896347] [2019-12-07 14:29:15,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/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 14:29:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:29:15,834 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:29:15,838 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:29:15,858 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 14:29:15,859 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:29:15,870 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 14:29:15,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [439780251] [2019-12-07 14:29:15,889 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 14:29:15,889 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:29:15,894 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 14:29:15,899 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 14:29:15,900 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 14:29:16,010 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:29:16,259 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:29:16,577 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:29:16,761 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@2bbb5ec2 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker.assertLhs(IncrementalPlicationChecker.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ArrayIndexEqualityManager.(ArrayIndexEqualityManager.java:91) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:555) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:428) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:234) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.quantifier(PartialQuantifierElimination.java:146) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:279) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 14:29:16,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:29:16,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2019-12-07 14:29:16,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932933855] [2019-12-07 14:29:16,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:29:16,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:29:16,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:29:16,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:29:16,764 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 7 states. [2019-12-07 14:29:16,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 14:29:16,965 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:29:16,966 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@2bbb5ec2 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 14:29:16,969 INFO L168 Benchmark]: Toolchain (without parser) took 2845.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 940.7 MB in the beginning and 892.6 MB in the end (delta: 48.1 MB). Peak memory consumption was 141.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:29:16,970 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 959.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:29:16,970 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -132.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2019-12-07 14:29:16,971 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.29 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:29:16,972 INFO L168 Benchmark]: Boogie Preprocessor took 22.74 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-12-07 14:29:16,972 INFO L168 Benchmark]: RCFGBuilder took 360.04 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.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. [2019-12-07 14:29:16,973 INFO L168 Benchmark]: TraceAbstraction took 2110.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 892.6 MB in the end (delta: 132.4 MB). Peak memory consumption was 132.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:29:16,977 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 959.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 315.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -132.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.29 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.74 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 360.04 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.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2110.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 892.6 MB in the end (delta: 132.4 MB). Peak memory consumption was 132.4 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@2bbb5ec2 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@2bbb5ec2: 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 14:29:18,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:29:18,497 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:29:18,505 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:29:18,505 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:29:18,506 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:29:18,507 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:29:18,509 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:29:18,510 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:29:18,511 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:29:18,511 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:29:18,512 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:29:18,512 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:29:18,513 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:29:18,514 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:29:18,515 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:29:18,515 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:29:18,516 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:29:18,517 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:29:18,519 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:29:18,520 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:29:18,521 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:29:18,522 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:29:18,523 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:29:18,525 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:29:18,525 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:29:18,525 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:29:18,526 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:29:18,526 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:29:18,527 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:29:18,527 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:29:18,528 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:29:18,528 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:29:18,529 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:29:18,530 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:29:18,530 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:29:18,531 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:29:18,531 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:29:18,531 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:29:18,531 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:29:18,532 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:29:18,532 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-12-07 14:29:18,544 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:29:18,544 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:29:18,545 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 14:29:18,545 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 14:29:18,545 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 14:29:18,545 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 14:29:18,546 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 14:29:18,546 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 14:29:18,546 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 14:29:18,547 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:29:18,547 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:29:18,547 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:29:18,547 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:29:18,547 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 14:29:18,548 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:29:18,548 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:29:18,548 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:29:18,548 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 14:29:18,548 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 14:29:18,548 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 14:29:18,549 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:29:18,549 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 14:29:18,549 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 14:29:18,549 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 14:29:18,549 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:29:18,550 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:29:18,550 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:29:18,550 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:29:18,550 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:29:18,550 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:29:18,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:29:18,551 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:29:18,551 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:29:18,551 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 14:29:18,551 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 14:29:18,552 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:29:18,552 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 14:29:18,552 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_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/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 -> f711e8fa055cb799c5be49ac147c434ba7c6e879 [2019-12-07 14:29:18,717 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:29:18,726 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:29:18,728 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:29:18,729 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:29:18,729 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:29:18,730 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/bin/utaipan/../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.i [2019-12-07 14:29:18,767 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/bin/utaipan/data/2eb8decf4/19be84921b294e628b57a90bd8ba391c/FLAGc98220b31 [2019-12-07 14:29:19,144 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:29:19,144 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.i [2019-12-07 14:29:19,154 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/bin/utaipan/data/2eb8decf4/19be84921b294e628b57a90bd8ba391c/FLAGc98220b31 [2019-12-07 14:29:19,163 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/bin/utaipan/data/2eb8decf4/19be84921b294e628b57a90bd8ba391c [2019-12-07 14:29:19,165 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:29:19,166 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:29:19,167 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:29:19,167 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:29:19,169 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:29:19,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:29:19" (1/1) ... [2019-12-07 14:29:19,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5772f275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:29:19, skipping insertion in model container [2019-12-07 14:29:19,171 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:29:19" (1/1) ... [2019-12-07 14:29:19,176 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:29:19,205 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:29:19,429 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:29:19,437 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:29:19,467 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:29:19,501 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:29:19,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:29:19 WrapperNode [2019-12-07 14:29:19,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:29:19,502 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:29:19,502 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:29:19,502 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:29:19,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:29:19" (1/1) ... [2019-12-07 14:29:19,519 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:29:19" (1/1) ... [2019-12-07 14:29:19,534 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:29:19,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:29:19,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:29:19,535 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:29:19,541 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:29:19" (1/1) ... [2019-12-07 14:29:19,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:29:19" (1/1) ... [2019-12-07 14:29:19,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:29:19" (1/1) ... [2019-12-07 14:29:19,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:29:19" (1/1) ... [2019-12-07 14:29:19,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:29:19" (1/1) ... [2019-12-07 14:29:19,554 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:29:19" (1/1) ... [2019-12-07 14:29:19,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:29:19" (1/1) ... [2019-12-07 14:29:19,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:29:19,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:29:19,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:29:19,558 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:29:19,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:29:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/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 14:29:19,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 14:29:19,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 14:29:19,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 14:29:19,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 14:29:19,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:29:19,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 14:29:19,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:29:19,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:29:19,945 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:29:19,945 INFO L287 CfgBuilder]: Removed 13 assume(true) statements. [2019-12-07 14:29:19,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:29:19 BoogieIcfgContainer [2019-12-07 14:29:19,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:29:19,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:29:19,947 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:29:19,949 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:29:19,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:29:19" (1/3) ... [2019-12-07 14:29:19,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a822924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:29:19, skipping insertion in model container [2019-12-07 14:29:19,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:29:19" (2/3) ... [2019-12-07 14:29:19,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a822924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:29:19, skipping insertion in model container [2019-12-07 14:29:19,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:29:19" (3/3) ... [2019-12-07 14:29:19,951 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-1.i [2019-12-07 14:29:19,957 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:29:19,962 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 32 error locations. [2019-12-07 14:29:19,970 INFO L249 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2019-12-07 14:29:19,983 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:29:19,983 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 14:29:19,983 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:29:19,983 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:29:19,984 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:29:19,984 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:29:19,984 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:29:19,984 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:29:19,995 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2019-12-07 14:29:20,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 14:29:20,000 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:29:20,001 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 14:29:20,001 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 14:29:20,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:29:20,005 INFO L82 PathProgramCache]: Analyzing trace with hash 925702, now seen corresponding path program 1 times [2019-12-07 14:29:20,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:29:20,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1397650659] [2019-12-07 14:29:20,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/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 14:29:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:29:20,060 INFO L264 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:29:20,063 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:29:20,099 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 14:29:20,100 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:20,106 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:20,106 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:29:20,107 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 14:29:20,114 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 14:29:20,114 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:29:20,118 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 14:29:20,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1397650659] [2019-12-07 14:29:20,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:29:20,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 14:29:20,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169242160] [2019-12-07 14:29:20,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:29:20,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:29:20,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:29:20,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:29:20,138 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2019-12-07 14:29:20,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:29:20,282 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2019-12-07 14:29:20,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:29:20,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 14:29:20,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:29:20,290 INFO L225 Difference]: With dead ends: 89 [2019-12-07 14:29:20,290 INFO L226 Difference]: Without dead ends: 83 [2019-12-07 14:29:20,291 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 14:29:20,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-07 14:29:20,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 65. [2019-12-07 14:29:20,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-07 14:29:20,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-12-07 14:29:20,317 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 4 [2019-12-07 14:29:20,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:29:20,317 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-12-07 14:29:20,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:29:20,317 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-12-07 14:29:20,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 14:29:20,318 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:29:20,318 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 14:29:20,518 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 14:29:20,519 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 14:29:20,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:29:20,520 INFO L82 PathProgramCache]: Analyzing trace with hash 925703, now seen corresponding path program 1 times [2019-12-07 14:29:20,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:29:20,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406026876] [2019-12-07 14:29:20,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/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 14:29:20,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:29:20,579 INFO L264 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:29:20,580 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:29:20,592 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 14:29:20,592 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:20,599 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:20,599 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:29:20,600 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 14:29:20,609 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 14:29:20,609 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:29:20,645 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 14:29:20,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406026876] [2019-12-07 14:29:20,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:29:20,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 14:29:20,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750226953] [2019-12-07 14:29:20,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:29:20,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:29:20,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:29:20,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:29:20,647 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 4 states. [2019-12-07 14:29:20,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:29:20,786 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-12-07 14:29:20,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:29:20,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-12-07 14:29:20,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:29:20,788 INFO L225 Difference]: With dead ends: 61 [2019-12-07 14:29:20,788 INFO L226 Difference]: Without dead ends: 61 [2019-12-07 14:29:20,788 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 14:29:20,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-07 14:29:20,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-12-07 14:29:20,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 14:29:20,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2019-12-07 14:29:20,793 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 4 [2019-12-07 14:29:20,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:29:20,794 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2019-12-07 14:29:20,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:29:20,794 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2019-12-07 14:29:20,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 14:29:20,794 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:29:20,794 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:29:20,995 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 14:29:20,996 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 14:29:20,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:29:20,996 INFO L82 PathProgramCache]: Analyzing trace with hash 613337907, now seen corresponding path program 1 times [2019-12-07 14:29:20,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:29:20,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971082561] [2019-12-07 14:29:20,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/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 14:29:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:29:21,051 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:29:21,052 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:29:21,058 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 14:29:21,059 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:29:21,064 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 14:29:21,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971082561] [2019-12-07 14:29:21,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:29:21,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 14:29:21,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418959054] [2019-12-07 14:29:21,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:29:21,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:29:21,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:29:21,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:29:21,066 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 4 states. [2019-12-07 14:29:21,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:29:21,081 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2019-12-07 14:29:21,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:29:21,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 14:29:21,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:29:21,082 INFO L225 Difference]: With dead ends: 74 [2019-12-07 14:29:21,082 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 14:29:21,082 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 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 14:29:21,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 14:29:21,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2019-12-07 14:29:21,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-12-07 14:29:21,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2019-12-07 14:29:21,087 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 10 [2019-12-07 14:29:21,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:29:21,088 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2019-12-07 14:29:21,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:29:21,088 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2019-12-07 14:29:21,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 14:29:21,088 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:29:21,088 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:29:21,289 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 14:29:21,289 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 14:29:21,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:29:21,290 INFO L82 PathProgramCache]: Analyzing trace with hash 613339348, now seen corresponding path program 1 times [2019-12-07 14:29:21,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:29:21,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100006693] [2019-12-07 14:29:21,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/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 14:29:21,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:29:21,350 INFO L264 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:29:21,351 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:29:21,354 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 14:29:21,355 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:21,356 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:21,356 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:29:21,356 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 14:29:21,360 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 14:29:21,360 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:29:21,361 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 14:29:21,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2100006693] [2019-12-07 14:29:21,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:29:21,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 14:29:21,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989957280] [2019-12-07 14:29:21,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:29:21,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:29:21,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:29:21,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:29:21,363 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand 3 states. [2019-12-07 14:29:21,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:29:21,472 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2019-12-07 14:29:21,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:29:21,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-07 14:29:21,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:29:21,474 INFO L225 Difference]: With dead ends: 84 [2019-12-07 14:29:21,474 INFO L226 Difference]: Without dead ends: 84 [2019-12-07 14:29:21,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:29:21,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-12-07 14:29:21,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 66. [2019-12-07 14:29:21,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 14:29:21,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2019-12-07 14:29:21,479 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 10 [2019-12-07 14:29:21,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:29:21,479 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2019-12-07 14:29:21,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:29:21,479 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2019-12-07 14:29:21,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 14:29:21,480 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:29:21,480 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:29:21,681 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 14:29:21,682 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 14:29:21,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:29:21,683 INFO L82 PathProgramCache]: Analyzing trace with hash 613339349, now seen corresponding path program 1 times [2019-12-07 14:29:21,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:29:21,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1819328514] [2019-12-07 14:29:21,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/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 14:29:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:29:21,784 INFO L264 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:29:21,785 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:29:21,791 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 14:29:21,791 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:21,797 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:21,798 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:29:21,798 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 14:29:21,807 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 14:29:21,807 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:29:21,843 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 14:29:21,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1819328514] [2019-12-07 14:29:21,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:29:21,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 14:29:21,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794587613] [2019-12-07 14:29:21,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:29:21,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:29:21,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:29:21,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:29:21,844 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand 4 states. [2019-12-07 14:29:21,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:29:21,977 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2019-12-07 14:29:21,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:29:21,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 14:29:21,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:29:21,979 INFO L225 Difference]: With dead ends: 64 [2019-12-07 14:29:21,979 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 14:29:21,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 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 14:29:21,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 14:29:21,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-12-07 14:29:21,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 14:29:21,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2019-12-07 14:29:21,983 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 10 [2019-12-07 14:29:21,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:29:21,983 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2019-12-07 14:29:21,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:29:21,984 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2019-12-07 14:29:21,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 14:29:21,984 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:29:21,984 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:29:22,185 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 14:29:22,186 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 14:29:22,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:29:22,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1008594167, now seen corresponding path program 1 times [2019-12-07 14:29:22,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:29:22,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1310396755] [2019-12-07 14:29:22,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/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 14:29:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:29:22,286 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 14:29:22,288 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:29:22,291 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 14:29:22,292 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:22,293 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:22,293 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:29:22,294 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 14:29:22,319 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:22,320 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 14:29:22,320 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:22,332 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 14:29:22,333 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 14:29:22,333 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-12-07 14:29:22,341 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 14:29:22,341 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:29:22,357 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 14:29:22,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1310396755] [2019-12-07 14:29:22,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:29:22,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 14:29:22,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802068505] [2019-12-07 14:29:22,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:29:22,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:29:22,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:29:22,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:29:22,359 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 4 states. [2019-12-07 14:29:22,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:29:22,522 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2019-12-07 14:29:22,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:29:22,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 14:29:22,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:29:22,523 INFO L225 Difference]: With dead ends: 83 [2019-12-07 14:29:22,523 INFO L226 Difference]: Without dead ends: 83 [2019-12-07 14:29:22,523 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 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 14:29:22,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-07 14:29:22,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 64. [2019-12-07 14:29:22,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 14:29:22,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2019-12-07 14:29:22,527 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 12 [2019-12-07 14:29:22,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:29:22,527 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2019-12-07 14:29:22,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:29:22,527 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2019-12-07 14:29:22,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 14:29:22,528 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:29:22,528 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:29:22,728 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 14:29:22,729 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 14:29:22,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:29:22,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1008594168, now seen corresponding path program 1 times [2019-12-07 14:29:22,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:29:22,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [506197780] [2019-12-07 14:29:22,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/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 14:29:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:29:22,799 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 14:29:22,800 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:29:22,806 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 14:29:22,807 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:22,814 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:22,816 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 14:29:22,816 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:22,821 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:22,822 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:29:22,822 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 14:29:22,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:29:22,847 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-12-07 14:29:22,848 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:22,863 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:22,871 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:22,872 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 14:29:22,872 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:22,880 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:22,881 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 14:29:22,881 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:18 [2019-12-07 14:29:22,904 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 14:29:22,905 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:29:22,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:23,101 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 14:29:23,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [506197780] [2019-12-07 14:29:23,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:29:23,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 14:29:23,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180017429] [2019-12-07 14:29:23,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 14:29:23,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:29:23,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 14:29:23,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:29:23,102 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 8 states. [2019-12-07 14:29:26,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:29:26,109 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2019-12-07 14:29:26,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 14:29:26,110 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-12-07 14:29:26,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:29:26,111 INFO L225 Difference]: With dead ends: 102 [2019-12-07 14:29:26,111 INFO L226 Difference]: Without dead ends: 102 [2019-12-07 14:29:26,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 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 14:29:26,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-12-07 14:29:26,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 64. [2019-12-07 14:29:26,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 14:29:26,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-12-07 14:29:26,115 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 12 [2019-12-07 14:29:26,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:29:26,115 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-12-07 14:29:26,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 14:29:26,115 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-12-07 14:29:26,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 14:29:26,115 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:29:26,116 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:29:26,316 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 14:29:26,317 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 14:29:26,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:29:26,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1419674411, now seen corresponding path program 1 times [2019-12-07 14:29:26,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:29:26,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171164781] [2019-12-07 14:29:26,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/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 14:29:26,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:29:26,442 INFO L264 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 14:29:26,443 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:29:26,447 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 14:29:26,447 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:26,449 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:26,449 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:29:26,449 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 14:29:26,468 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:26,469 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 14:29:26,470 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:26,481 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 14:29:26,482 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 14:29:26,482 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-12-07 14:29:26,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:29:26,487 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:29:26,497 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:29:26,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171164781] [2019-12-07 14:29:26,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1581769033] [2019-12-07 14:29:26,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/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 14:29:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:29:26,623 INFO L264 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 14:29:26,624 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:29:26,645 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:26,645 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 14:29:26,646 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:26,657 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 14:29:26,657 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 14:29:26,657 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-12-07 14:29:26,671 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:26,672 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 14:29:26,672 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:26,683 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 14:29:26,684 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 14:29:26,684 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-12-07 14:29:26,689 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:29:26,689 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:29:26,699 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:29:26,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967249184] [2019-12-07 14:29:26,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/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 14:29:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:29:26,770 INFO L264 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 14:29:26,771 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:29:26,791 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:26,792 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 14:29:26,792 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:26,806 INFO L614 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-12-07 14:29:26,807 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 14:29:26,807 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2019-12-07 14:29:26,819 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:29:26,820 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:29:26,846 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:29:26,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:29:26,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 4, 3, 4, 4] total 7 [2019-12-07 14:29:26,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136587247] [2019-12-07 14:29:26,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 14:29:26,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:29:26,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 14:29:26,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:29:26,848 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 8 states. [2019-12-07 14:29:27,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:29:27,075 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2019-12-07 14:29:27,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:29:27,075 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-12-07 14:29:27,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:29:27,076 INFO L225 Difference]: With dead ends: 88 [2019-12-07 14:29:27,076 INFO L226 Difference]: Without dead ends: 88 [2019-12-07 14:29:27,076 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 92 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 14:29:27,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-12-07 14:29:27,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 62. [2019-12-07 14:29:27,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 14:29:27,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-12-07 14:29:27,079 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 18 [2019-12-07 14:29:27,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:29:27,079 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-12-07 14:29:27,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 14:29:27,080 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-12-07 14:29:27,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 14:29:27,080 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:29:27,080 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:29:27,681 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 14:29:27,682 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 14:29:27,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:29:27,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1419674412, now seen corresponding path program 1 times [2019-12-07 14:29:27,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:29:27,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268490080] [2019-12-07 14:29:27,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/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 14:29:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:29:27,781 INFO L264 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 14:29:27,782 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:29:27,788 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 14:29:27,788 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:27,794 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:27,797 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 14:29:27,797 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:27,802 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:27,802 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:29:27,802 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 14:29:27,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:29:27,824 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-12-07 14:29:27,825 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:27,834 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:27,841 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:27,841 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 14:29:27,841 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:27,848 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:27,848 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 14:29:27,849 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:18 [2019-12-07 14:29:27,867 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:29:27,867 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:29:27,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:28,049 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:29:28,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1268490080] [2019-12-07 14:29:28,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [994641980] [2019-12-07 14:29:28,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/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 14:29:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:29:28,188 INFO L264 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 14:29:28,189 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:29:28,194 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 14:29:28,194 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:28,200 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:28,202 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 14:29:28,202 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:28,207 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:28,207 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:29:28,207 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 14:29:28,218 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:28,218 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 14:29:28,219 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:28,226 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:28,229 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-12-07 14:29:28,229 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:28,236 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:28,237 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 14:29:28,237 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:18 [2019-12-07 14:29:28,240 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:29:28,240 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:29:28,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:28,330 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:29:28,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675902530] [2019-12-07 14:29:28,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/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 14:29:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:29:28,381 INFO L264 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 14:29:28,382 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:29:28,385 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 14:29:28,386 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:28,389 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:28,390 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:29:28,390 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 14:29:28,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:29:28,417 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-12-07 14:29:28,417 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:28,426 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:28,432 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:28,432 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 14:29:28,433 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:28,439 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:28,440 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 14:29:28,440 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:18 [2019-12-07 14:29:28,444 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:29:28,444 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:29:28,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:28,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:28,546 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:28,547 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 14:29:28,547 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:28,560 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:28,560 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 14:29:28,560 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:28,586 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:28,586 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 14:29:28,586 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:22 [2019-12-07 14:29:28,662 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:29:28,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:29:28,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 5, 5] total 9 [2019-12-07 14:29:28,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618520728] [2019-12-07 14:29:28,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:29:28,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:29:28,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:29:28,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:29:28,663 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 10 states. [2019-12-07 14:29:29,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:29:29,170 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2019-12-07 14:29:29,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:29:29,170 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-12-07 14:29:29,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:29:29,171 INFO L225 Difference]: With dead ends: 78 [2019-12-07 14:29:29,171 INFO L226 Difference]: Without dead ends: 78 [2019-12-07 14:29:29,171 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 90 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-12-07 14:29:29,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-07 14:29:29,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 60. [2019-12-07 14:29:29,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-07 14:29:29,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-12-07 14:29:29,173 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 18 [2019-12-07 14:29:29,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:29:29,174 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-12-07 14:29:29,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:29:29,174 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-12-07 14:29:29,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 14:29:29,174 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:29:29,174 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:29:29,775 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 14:29:29,777 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 14:29:29,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:29:29,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1641358142, now seen corresponding path program 1 times [2019-12-07 14:29:29,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:29:29,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919036576] [2019-12-07 14:29:29,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/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 14:29:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:29:29,884 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 14:29:29,885 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:29:29,897 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:29:29,897 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:29:29,930 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:29:29,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919036576] [2019-12-07 14:29:29,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1977804664] [2019-12-07 14:29:29,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/bin/utaipan/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:29:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:29:30,051 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 14:29:30,052 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:29:30,057 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:29:30,058 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:29:30,061 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:29:30,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407533855] [2019-12-07 14:29:30,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/bin/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:29:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:29:30,110 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 14:29:30,111 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:29:30,155 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:29:30,155 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:29:30,169 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 14:29:30,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 4 imperfect interpolant sequences. [2019-12-07 14:29:30,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5, 5, 5, 5] total 12 [2019-12-07 14:29:30,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909505593] [2019-12-07 14:29:30,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:29:30,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:29:30,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:29:30,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:29:30,170 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 6 states. [2019-12-07 14:29:30,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:29:30,516 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-12-07 14:29:30,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:29:30,517 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 14:29:30,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:29:30,517 INFO L225 Difference]: With dead ends: 76 [2019-12-07 14:29:30,517 INFO L226 Difference]: Without dead ends: 76 [2019-12-07 14:29:30,517 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 133 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-12-07 14:29:30,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-07 14:29:30,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 57. [2019-12-07 14:29:30,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-07 14:29:30,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2019-12-07 14:29:30,520 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 25 [2019-12-07 14:29:30,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:29:30,520 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2019-12-07 14:29:30,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:29:30,520 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2019-12-07 14:29:30,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 14:29:30,521 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:29:30,521 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:29:31,122 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3,16 cvc4 --incremental --print-success --lang smt --rewrite-divk,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:29:31,123 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 14:29:31,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:29:31,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1641358141, now seen corresponding path program 1 times [2019-12-07 14:29:31,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:29:31,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256632500] [2019-12-07 14:29:31,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/bin/utaipan/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 14:29:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:29:31,209 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 14:29:31,210 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:29:31,223 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:29:31,223 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:29:31,254 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:29:31,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [256632500] [2019-12-07 14:29:31,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [246172277] [2019-12-07 14:29:31,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/bin/utaipan/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:29:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:29:31,382 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 14:29:31,383 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:29:31,389 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:29:31,389 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:29:31,392 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:29:31,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976801059] [2019-12-07 14:29:31,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/bin/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:29:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:29:31,442 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 14:29:31,443 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:29:31,447 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 14:29:31,447 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:31,451 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:31,451 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:29:31,451 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 14:29:31,509 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:29:31,509 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:29:31,768 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 14:29:31,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 4 imperfect interpolant sequences. [2019-12-07 14:29:31,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5, 5, 5, 5] total 16 [2019-12-07 14:29:31,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88153886] [2019-12-07 14:29:31,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:29:31,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:29:31,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:29:31,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-07 14:29:31,770 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 10 states. [2019-12-07 14:29:32,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:29:32,399 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2019-12-07 14:29:32,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:29:32,400 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-12-07 14:29:32,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:29:32,401 INFO L225 Difference]: With dead ends: 65 [2019-12-07 14:29:32,401 INFO L226 Difference]: Without dead ends: 65 [2019-12-07 14:29:32,401 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-12-07 14:29:32,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-12-07 14:29:32,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2019-12-07 14:29:32,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-12-07 14:29:32,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2019-12-07 14:29:32,404 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 25 [2019-12-07 14:29:32,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:29:32,404 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2019-12-07 14:29:32,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:29:32,404 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2019-12-07 14:29:32,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 14:29:32,405 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:29:32,405 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:29:33,006 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:29:33,007 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 14:29:33,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:29:33,007 INFO L82 PathProgramCache]: Analyzing trace with hash 502294179, now seen corresponding path program 1 times [2019-12-07 14:29:33,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:29:33,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1665277849] [2019-12-07 14:29:33,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/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 14:29:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:29:33,092 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 14:29:33,093 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:29:33,104 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:29:33,104 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:29:33,132 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:29:33,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1665277849] [2019-12-07 14:29:33,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [922948612] [2019-12-07 14:29:33,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/bin/utaipan/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:29:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:29:33,267 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 14:29:33,268 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:29:33,276 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:29:33,276 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:29:33,279 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:29:33,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983656529] [2019-12-07 14:29:33,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/bin/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:29:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:29:33,327 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 14:29:33,328 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:29:33,334 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:29:33,334 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:29:33,383 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:29:33,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:29:33,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 6] total 10 [2019-12-07 14:29:33,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918606585] [2019-12-07 14:29:33,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:29:33,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:29:33,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:29:33,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:29:33,384 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand 10 states. [2019-12-07 14:29:33,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:29:33,522 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2019-12-07 14:29:33,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:29:33,522 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-12-07 14:29:33,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:29:33,523 INFO L225 Difference]: With dead ends: 83 [2019-12-07 14:29:33,523 INFO L226 Difference]: Without dead ends: 83 [2019-12-07 14:29:33,523 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 151 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:29:33,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-07 14:29:33,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-12-07 14:29:33,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-12-07 14:29:33,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2019-12-07 14:29:33,526 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 28 [2019-12-07 14:29:33,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:29:33,526 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2019-12-07 14:29:33,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:29:33,526 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2019-12-07 14:29:33,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 14:29:33,527 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:29:33,527 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:29:34,128 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3,22 cvc4 --incremental --print-success --lang smt --rewrite-divk,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:29:34,129 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 14:29:34,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:29:34,130 INFO L82 PathProgramCache]: Analyzing trace with hash -77247477, now seen corresponding path program 2 times [2019-12-07 14:29:34,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:29:34,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1204600874] [2019-12-07 14:29:34,131 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/bin/utaipan/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-12-07 14:29:34,454 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 14:29:34,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:29:34,476 INFO L264 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 14:29:34,478 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:29:34,517 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:34,517 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 14:29:34,518 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:34,537 INFO L614 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-12-07 14:29:34,537 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 14:29:34,537 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:21 [2019-12-07 14:29:34,580 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:34,580 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 2 case distinctions, treesize of input 17 treesize of output 50 [2019-12-07 14:29:34,580 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:34,611 INFO L614 ElimStorePlain]: treesize reduction 28, result has 48.1 percent of original size [2019-12-07 14:29:34,612 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 14:29:34,612 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:26 [2019-12-07 14:29:34,696 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:34,696 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 55 [2019-12-07 14:29:34,696 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:34,713 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:34,713 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 14:29:34,713 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 [2019-12-07 14:29:34,734 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 14:29:34,734 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:34,743 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:34,743 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:29:34,743 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-12-07 14:29:34,768 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 27 treesize of output 11 [2019-12-07 14:29:34,768 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:34,778 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:34,778 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 14:29:34,778 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:18 [2019-12-07 14:29:34,818 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-12-07 14:29:34,818 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:34,826 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:34,826 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 14:29:34,826 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:14 [2019-12-07 14:29:34,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:29:34,847 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-12-07 14:29:34,847 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:34,853 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:34,853 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:29:34,853 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 14:29:34,899 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 14:29:34,899 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:34,902 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:34,902 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 14:29:34,902 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-12-07 14:29:34,925 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:29:34,925 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:29:35,014 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 14:29:35,016 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:35,017 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:29:35,017 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:12 [2019-12-07 14:29:35,041 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 14:29:35,045 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:35,045 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:29:35,045 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2019-12-07 14:29:35,231 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 14:29:35,237 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:35,237 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 14:29:35,237 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:37 [2019-12-07 14:29:35,435 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:35,659 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 33 [2019-12-07 14:29:35,659 INFO L614 ElimStorePlain]: treesize reduction 125, result has 29.8 percent of original size [2019-12-07 14:29:35,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:29:35,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:29:35,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:35,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:35,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:29:35,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:35,662 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2019-12-07 14:29:35,662 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:69, output treesize:52 [2019-12-07 14:29:35,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:29:35,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:36,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:36,104 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:36,104 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 25 treesize of output 43 [2019-12-07 14:29:36,105 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:36,123 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:36,123 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 25 treesize of output 43 [2019-12-07 14:29:36,123 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:36,149 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:36,149 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-12-07 14:29:36,149 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:54, output treesize:7 [2019-12-07 14:29:36,212 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:29:36,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1204600874] [2019-12-07 14:29:36,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2036837213] [2019-12-07 14:29:36,212 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/bin/utaipan/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:29:36,511 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 14:29:36,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:29:36,515 INFO L264 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 14:29:36,516 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:29:36,554 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 14:29:36,554 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:36,561 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:36,561 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:29:36,561 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-12-07 14:29:36,652 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:36,652 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 14:29:36,653 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:36,662 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:36,662 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:29:36,662 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:17 [2019-12-07 14:29:36,717 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 14:29:36,717 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:36,726 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:36,726 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:29:36,727 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-12-07 14:29:36,781 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-12-07 14:29:36,781 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:36,791 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:36,792 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 14:29:36,792 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:17 [2019-12-07 14:29:36,892 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-12-07 14:29:36,893 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:36,899 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:36,900 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 14:29:36,900 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:14 [2019-12-07 14:29:36,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:29:36,904 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-12-07 14:29:36,904 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:36,915 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:36,915 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:29:36,916 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 14:29:36,918 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 14:29:36,919 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:36,921 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:36,922 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 14:29:36,922 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-12-07 14:29:36,927 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 14:29:36,927 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:29:36,929 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 14:29:36,932 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:36,932 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:29:36,932 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:12 [2019-12-07 14:29:36,958 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 14:29:36,961 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:36,961 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:29:36,962 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2019-12-07 14:29:37,179 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 14:29:37,185 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:37,185 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 14:29:37,185 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:37 [2019-12-07 14:29:37,451 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:37,661 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 33 [2019-12-07 14:29:37,661 INFO L614 ElimStorePlain]: treesize reduction 125, result has 29.8 percent of original size [2019-12-07 14:29:37,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:29:37,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:29:37,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:37,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:37,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:29:37,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:37,663 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2019-12-07 14:29:37,663 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:69, output treesize:58 [2019-12-07 14:29:37,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:29:37,987 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 14:29:37,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249540716] [2019-12-07 14:29:37,987 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/bin/utaipan/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:29:39,085 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 14:29:39,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:29:39,091 INFO L264 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-07 14:29:39,092 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:29:39,229 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:39,230 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 14:29:39,230 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:39,237 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:39,237 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:29:39,237 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:14 [2019-12-07 14:29:39,293 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 14:29:39,293 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:39,300 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:39,301 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:29:39,301 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-12-07 14:29:39,365 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-12-07 14:29:39,366 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:39,373 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:39,374 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 14:29:39,374 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:14 [2019-12-07 14:29:39,492 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-12-07 14:29:39,492 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:39,496 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:39,496 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 14:29:39,496 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2019-12-07 14:29:39,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:29:39,572 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-12-07 14:29:39,572 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:39,576 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:39,576 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:29:39,576 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:11 [2019-12-07 14:29:39,668 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 14:29:39,668 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:39,670 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:39,670 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 14:29:39,670 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-12-07 14:29:39,673 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 17 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 14:29:39,673 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:29:39,675 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 14:29:39,677 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:39,677 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:29:39,677 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:12 [2019-12-07 14:29:39,700 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 14:29:39,703 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:39,704 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:29:39,704 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2019-12-07 14:29:39,818 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 14:29:39,823 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:39,824 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 14:29:39,824 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:37 [2019-12-07 14:29:40,148 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:40,356 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 33 [2019-12-07 14:29:40,356 INFO L614 ElimStorePlain]: treesize reduction 125, result has 29.8 percent of original size [2019-12-07 14:29:40,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:29:40,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:29:40,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:40,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:40,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:29:40,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:40,358 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2019-12-07 14:29:40,358 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:69, output treesize:58 [2019-12-07 14:29:40,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:29:41,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:29:41,068 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 14:29:41,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:29:41,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 13, 13, 13, 13] total 54 [2019-12-07 14:29:41,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188292464] [2019-12-07 14:29:41,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-12-07 14:29:41,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:29:41,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-12-07 14:29:41,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=2638, Unknown=0, NotChecked=0, Total=2862 [2019-12-07 14:29:41,071 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 54 states. [2019-12-07 14:29:42,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:29:42,900 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2019-12-07 14:29:42,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 14:29:42,900 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 40 [2019-12-07 14:29:42,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:29:42,901 INFO L225 Difference]: With dead ends: 99 [2019-12-07 14:29:42,901 INFO L226 Difference]: Without dead ends: 99 [2019-12-07 14:29:42,902 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 174 SyntacticMatches, 8 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1588 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=597, Invalid=3563, Unknown=0, NotChecked=0, Total=4160 [2019-12-07 14:29:42,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-12-07 14:29:42,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 83. [2019-12-07 14:29:42,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-12-07 14:29:42,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2019-12-07 14:29:42,904 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 40 [2019-12-07 14:29:42,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:29:42,905 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2019-12-07 14:29:42,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-12-07 14:29:42,905 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2019-12-07 14:29:42,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 14:29:42,906 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:29:42,906 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:29:43,507 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 cvc4 --incremental --print-success --lang smt --rewrite-divk,24 mathsat -unsat_core_generation=3 [2019-12-07 14:29:43,508 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 14:29:43,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:29:43,508 INFO L82 PathProgramCache]: Analyzing trace with hash 829720554, now seen corresponding path program 1 times [2019-12-07 14:29:43,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:29:43,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548856658] [2019-12-07 14:29:43,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/bin/utaipan/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2019-12-07 14:29:43,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:29:43,776 INFO L264 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-07 14:29:43,777 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:29:43,782 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 14:29:43,783 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:43,786 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:43,786 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:29:43,786 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 14:29:43,812 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:43,813 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 14:29:43,813 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:43,835 INFO L614 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-12-07 14:29:43,835 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:29:43,835 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-12-07 14:29:43,851 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 14:29:43,851 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:43,863 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:43,863 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:29:43,863 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-12-07 14:29:43,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:29:43,886 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 25 treesize of output 13 [2019-12-07 14:29:43,886 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:43,897 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:43,898 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:29:43,898 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:32 [2019-12-07 14:29:43,933 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:43,933 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 72 [2019-12-07 14:29:43,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:29:43,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:43,934 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 14:29:43,981 INFO L614 ElimStorePlain]: treesize reduction 47, result has 50.5 percent of original size [2019-12-07 14:29:43,982 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 14:29:43,982 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:71, output treesize:48 [2019-12-07 14:29:44,048 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:29:44,119 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:44,120 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 105 [2019-12-07 14:29:44,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:44,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:29:44,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:44,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:44,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:44,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:29:44,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:44,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:44,123 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 14:29:44,181 INFO L614 ElimStorePlain]: treesize reduction 44, result has 52.7 percent of original size [2019-12-07 14:29:44,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:44,182 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:29:44,182 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:49 [2019-12-07 14:29:44,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:44,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:44,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:29:44,243 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-12-07 14:29:44,243 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:44,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:29:44,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:29:44,255 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:29:44,316 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:44,316 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 127 [2019-12-07 14:29:44,317 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:44,418 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-12-07 14:29:44,419 INFO L614 ElimStorePlain]: treesize reduction 66, result has 62.3 percent of original size [2019-12-07 14:29:44,419 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-12-07 14:29:44,419 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:106 [2019-12-07 14:29:44,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:44,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:29:44,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:29:44,751 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2019-12-07 14:29:44,752 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:44,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:29:44,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:29:44,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:29:44,764 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:29:52,923 WARN L192 SmtUtils]: Spent 8.16 s on a formula simplification that was a NOOP. DAG size: 47 [2019-12-07 14:29:52,923 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:52,923 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 146 [2019-12-07 14:29:52,924 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:53,056 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-12-07 14:29:53,057 INFO L614 ElimStorePlain]: treesize reduction 146, result has 42.1 percent of original size [2019-12-07 14:29:53,057 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-12-07 14:29:53,057 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:138, output treesize:106 [2019-12-07 14:29:53,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:53,061 INFO L430 ElimStorePlain]: Different costs {4=[|#memory_$Pointer$.base|], 7=[v_prenex_12]} [2019-12-07 14:29:53,079 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:53,079 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 50 [2019-12-07 14:29:53,079 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:53,107 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:53,141 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:53,141 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 49 treesize of output 75 [2019-12-07 14:29:53,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:53,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:29:53,142 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:53,155 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:53,155 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 14:29:53,155 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:135, output treesize:33 [2019-12-07 14:29:53,254 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 14:29:53,254 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:29:53,368 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 14:29:53,371 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:53,371 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:29:53,371 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:14 [2019-12-07 14:29:53,833 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 14:29:53,857 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:53,858 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 14:29:53,858 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:66, output treesize:82 [2019-12-07 14:29:53,995 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:54,058 INFO L614 ElimStorePlain]: treesize reduction 80, result has 24.5 percent of original size [2019-12-07 14:29:54,058 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 14:29:54,059 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:90, output treesize:22 [2019-12-07 14:29:54,112 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 14:29:54,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548856658] [2019-12-07 14:29:54,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1264691010] [2019-12-07 14:29:54,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/bin/utaipan/cvc4 Starting monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:29:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:29:54,406 INFO L264 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-07 14:29:54,407 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:29:54,410 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 14:29:54,410 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:54,411 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:54,411 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:29:54,412 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-12-07 14:29:54,414 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 14:29:54,414 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:54,418 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:54,418 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:29:54,418 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 14:29:54,433 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:54,434 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 14:29:54,434 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:54,454 INFO L614 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-12-07 14:29:54,454 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:29:54,454 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-12-07 14:29:54,458 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 14:29:54,458 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:54,470 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:54,470 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:29:54,470 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-12-07 14:29:54,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:29:54,475 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 25 treesize of output 13 [2019-12-07 14:29:54,475 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:54,487 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:54,487 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:29:54,487 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:32 [2019-12-07 14:29:54,515 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:54,515 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 72 [2019-12-07 14:29:54,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:29:54,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:54,517 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 14:29:54,564 INFO L614 ElimStorePlain]: treesize reduction 47, result has 50.5 percent of original size [2019-12-07 14:29:54,564 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 14:29:54,564 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:71, output treesize:48 [2019-12-07 14:29:54,591 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:29:54,663 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:54,664 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 105 [2019-12-07 14:29:54,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:29:54,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:54,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:54,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:54,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:54,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:54,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:54,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:54,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:29:54,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:54,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:54,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:54,669 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 14:29:54,734 INFO L614 ElimStorePlain]: treesize reduction 44, result has 53.7 percent of original size [2019-12-07 14:29:54,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:54,735 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:29:54,735 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:51 [2019-12-07 14:29:54,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:54,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:54,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:29:54,787 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-12-07 14:29:54,787 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:54,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:29:54,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:29:54,797 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:29:54,855 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:29:54,855 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 127 [2019-12-07 14:29:54,856 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:29:54,953 INFO L614 ElimStorePlain]: treesize reduction 66, result has 62.3 percent of original size [2019-12-07 14:29:54,954 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-12-07 14:29:54,954 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:106 [2019-12-07 14:29:54,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:29:55,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:29:55,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:29:55,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:29:55,048 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:30:03,252 WARN L192 SmtUtils]: Spent 8.20 s on a formula simplification that was a NOOP. DAG size: 47 [2019-12-07 14:30:03,253 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:03,253 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 146 [2019-12-07 14:30:03,254 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:03,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:03,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:03,270 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2019-12-07 14:30:03,270 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:03,400 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-12-07 14:30:03,400 INFO L614 ElimStorePlain]: treesize reduction 100, result has 51.5 percent of original size [2019-12-07 14:30:03,400 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-12-07 14:30:03,401 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:138, output treesize:106 [2019-12-07 14:30:03,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:03,404 INFO L430 ElimStorePlain]: Different costs {4=[|#memory_$Pointer$.base|], 7=[v_prenex_15]} [2019-12-07 14:30:03,435 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:03,436 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 50 [2019-12-07 14:30:03,436 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:03,464 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:03,499 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:03,499 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 49 treesize of output 75 [2019-12-07 14:30:03,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:30:03,500 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:03,512 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:03,513 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 14:30:03,513 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:135, output treesize:33 [2019-12-07 14:30:03,562 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 14:30:03,563 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:30:03,565 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 14:30:03,568 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:03,568 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:30:03,568 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:14 [2019-12-07 14:30:04,024 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 14:30:04,043 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:04,043 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:30:04,043 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:66, output treesize:84 [2019-12-07 14:30:04,245 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:04,310 INFO L614 ElimStorePlain]: treesize reduction 80, result has 24.5 percent of original size [2019-12-07 14:30:04,310 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 14:30:04,310 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:90, output treesize:26 [2019-12-07 14:30:04,379 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 14:30:04,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479392414] [2019-12-07 14:30:04,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/bin/utaipan/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:30:04,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:30:04,452 INFO L264 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 14:30:04,453 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:30:04,460 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:04,460 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 14:30:04,461 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:04,465 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:04,466 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:30:04,466 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2019-12-07 14:30:04,521 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 14:30:04,522 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:04,533 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:04,533 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:30:04,533 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-12-07 14:30:04,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:04,602 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 25 treesize of output 13 [2019-12-07 14:30:04,602 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:04,612 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:04,612 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:30:04,612 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:25 [2019-12-07 14:30:04,639 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:04,639 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 65 [2019-12-07 14:30:04,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:30:04,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:04,640 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 14:30:04,686 INFO L614 ElimStorePlain]: treesize reduction 47, result has 50.5 percent of original size [2019-12-07 14:30:04,686 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 14:30:04,686 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:48 [2019-12-07 14:30:04,714 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:30:04,784 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:04,784 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 105 [2019-12-07 14:30:04,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:04,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:30:04,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:04,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:04,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:04,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:04,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:30:04,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:04,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:04,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:04,789 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 14:30:04,848 INFO L614 ElimStorePlain]: treesize reduction 44, result has 52.7 percent of original size [2019-12-07 14:30:04,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:04,849 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:30:04,849 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:49 [2019-12-07 14:30:04,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:04,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:04,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:04,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:04,896 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:30:04,952 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:04,952 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 127 [2019-12-07 14:30:04,953 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:04,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:04,963 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-12-07 14:30:04,964 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:05,068 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-12-07 14:30:05,068 INFO L614 ElimStorePlain]: treesize reduction 66, result has 62.3 percent of original size [2019-12-07 14:30:05,069 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-12-07 14:30:05,069 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:106 [2019-12-07 14:30:05,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:05,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:05,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:05,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:05,169 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:30:13,316 WARN L192 SmtUtils]: Spent 8.15 s on a formula simplification that was a NOOP. DAG size: 47 [2019-12-07 14:30:13,317 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:13,317 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 146 [2019-12-07 14:30:13,318 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:13,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:13,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:13,330 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2019-12-07 14:30:13,330 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:13,464 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-12-07 14:30:13,465 INFO L614 ElimStorePlain]: treesize reduction 146, result has 42.1 percent of original size [2019-12-07 14:30:13,465 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-12-07 14:30:13,466 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:138, output treesize:106 [2019-12-07 14:30:13,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:13,469 INFO L430 ElimStorePlain]: Different costs {4=[|#memory_$Pointer$.base|], 7=[v_prenex_18]} [2019-12-07 14:30:13,494 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:13,495 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 50 [2019-12-07 14:30:13,495 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:13,525 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:13,559 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:13,559 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 49 treesize of output 75 [2019-12-07 14:30:13,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:13,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:30:13,561 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:13,572 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:13,573 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 14:30:13,573 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:135, output treesize:35 [2019-12-07 14:30:13,622 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 14:30:13,622 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:30:13,624 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 14:30:13,628 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:13,628 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:30:13,628 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:16 [2019-12-07 14:30:13,731 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 14:30:13,753 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:13,754 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 14:30:13,754 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:66, output treesize:84 [2019-12-07 14:30:14,013 INFO L343 Elim1Store]: treesize reduction 8, result has 95.5 percent of original size [2019-12-07 14:30:14,013 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 96 treesize of output 182 [2019-12-07 14:30:14,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:14,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:14,014 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:14,019 INFO L614 ElimStorePlain]: treesize reduction 158, result has 0.6 percent of original size [2019-12-07 14:30:14,019 INFO L502 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2019-12-07 14:30:14,020 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:30:14,020 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:96, output treesize:1 [2019-12-07 14:30:14,023 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 14:30:14,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:30:14,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 14, 10, 14, 9] total 29 [2019-12-07 14:30:14,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938896856] [2019-12-07 14:30:14,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 14:30:14,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:30:14,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 14:30:14,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2019-12-07 14:30:14,024 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 30 states. [2019-12-07 14:30:18,091 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-12-07 14:30:19,090 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 46 [2019-12-07 14:30:19,685 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-12-07 14:30:20,209 WARN L192 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2019-12-07 14:30:21,159 WARN L192 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 122 [2019-12-07 14:30:21,747 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-07 14:30:24,396 WARN L192 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2019-12-07 14:30:26,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:30:26,363 INFO L93 Difference]: Finished difference Result 132 states and 137 transitions. [2019-12-07 14:30:26,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 14:30:26,364 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 43 [2019-12-07 14:30:26,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:30:26,365 INFO L225 Difference]: With dead ends: 132 [2019-12-07 14:30:26,365 INFO L226 Difference]: Without dead ends: 132 [2019-12-07 14:30:26,365 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 207 SyntacticMatches, 18 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=558, Invalid=2304, Unknown=0, NotChecked=0, Total=2862 [2019-12-07 14:30:26,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-12-07 14:30:26,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 87. [2019-12-07 14:30:26,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-12-07 14:30:26,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2019-12-07 14:30:26,368 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 43 [2019-12-07 14:30:26,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:30:26,368 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2019-12-07 14:30:26,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 14:30:26,368 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2019-12-07 14:30:26,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 14:30:26,368 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:30:26,369 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:30:26,970 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true,27 mathsat -unsat_core_generation=3,28 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:30:26,971 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 14:30:26,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:30:26,972 INFO L82 PathProgramCache]: Analyzing trace with hash 829720555, now seen corresponding path program 1 times [2019-12-07 14:30:26,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:30:26,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208827550] [2019-12-07 14:30:26,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/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 14:30:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:30:27,262 INFO L264 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 43 conjunts are in the unsatisfiable core [2019-12-07 14:30:27,264 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:30:27,292 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:27,292 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 14:30:27,293 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:27,310 INFO L614 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-12-07 14:30:27,310 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 14:30:27,310 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2019-12-07 14:30:27,327 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_103|], 3=[|v_#valid_127|]} [2019-12-07 14:30:27,330 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 14:30:27,330 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:27,343 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:27,367 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:27,367 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 2 case distinctions, treesize of input 17 treesize of output 50 [2019-12-07 14:30:27,367 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:27,402 INFO L614 ElimStorePlain]: treesize reduction 28, result has 52.5 percent of original size [2019-12-07 14:30:27,402 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 14:30:27,402 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:31 [2019-12-07 14:30:27,458 INFO L430 ElimStorePlain]: Different costs {1=[|v_#length_104|], 6=[|v_#valid_128|]} [2019-12-07 14:30:27,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:27,463 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-12-07 14:30:27,463 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:27,485 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:27,521 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:27,521 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 55 [2019-12-07 14:30:27,521 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:27,540 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:27,540 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:30:27,541 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:28 [2019-12-07 14:30:27,571 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 13 treesize of output 9 [2019-12-07 14:30:27,571 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:27,596 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:27,600 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 13 treesize of output 9 [2019-12-07 14:30:27,600 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:27,621 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:27,621 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:30:27,621 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:48 [2019-12-07 14:30:27,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:27,672 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 14:30:27,673 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:27,705 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:27,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:27,710 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 14:30:27,710 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:27,730 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:27,730 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:30:27,730 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-07 14:30:27,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:27,736 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 42 [2019-12-07 14:30:27,737 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:27,763 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:27,766 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 33 treesize of output 26 [2019-12-07 14:30:27,767 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:27,788 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:27,789 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:30:27,789 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:96, output treesize:74 [2019-12-07 14:30:27,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:27,895 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-12-07 14:30:27,895 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:27,930 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:27,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:27,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:27,935 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:27,935 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 50 [2019-12-07 14:30:27,936 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:27,987 INFO L614 ElimStorePlain]: treesize reduction 4, result has 95.6 percent of original size [2019-12-07 14:30:27,987 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:30:27,987 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:86 [2019-12-07 14:30:28,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:28,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:28,065 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:28,065 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 48 [2019-12-07 14:30:28,065 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:28,107 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:28,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:28,113 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:30:28,114 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:28,114 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:30:28,136 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:28,136 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 70 treesize of output 84 [2019-12-07 14:30:28,137 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:28,199 INFO L614 ElimStorePlain]: treesize reduction 48, result has 66.9 percent of original size [2019-12-07 14:30:28,200 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:30:28,200 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:107, output treesize:100 [2019-12-07 14:30:28,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:28,405 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:28,405 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2019-12-07 14:30:28,405 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:28,457 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:28,472 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:28,472 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 79 treesize of output 82 [2019-12-07 14:30:28,473 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:28,521 INFO L614 ElimStorePlain]: treesize reduction 40, result has 68.8 percent of original size [2019-12-07 14:30:28,521 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:30:28,521 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:88 [2019-12-07 14:30:28,538 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:28,538 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 71 treesize of output 57 [2019-12-07 14:30:28,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:28,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:28,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:28,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:28,540 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 14:30:28,582 INFO L614 ElimStorePlain]: treesize reduction 12, result has 82.4 percent of original size [2019-12-07 14:30:28,586 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:28,586 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2019-12-07 14:30:28,586 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:28,595 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:28,596 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:30:28,596 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:99, output treesize:20 [2019-12-07 14:30:28,690 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:30:28,691 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:30:28,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:28,977 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 14:30:28,982 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:30:29,019 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:29,023 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:30:29,028 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:29,042 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:29,042 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-12-07 14:30:29,042 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:103, output treesize:49 [2019-12-07 14:30:30,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:30,233 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:30,239 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:30:30,467 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-12-07 14:30:30,467 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:30,475 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:30:30,480 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:30:30,602 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-12-07 14:30:30,603 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:30,603 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-12-07 14:30:30,603 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:223, output treesize:285 [2019-12-07 14:30:32,296 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:33,266 WARN L192 SmtUtils]: Spent 970.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-12-07 14:30:33,267 INFO L614 ElimStorePlain]: treesize reduction 218, result has 61.6 percent of original size [2019-12-07 14:30:33,289 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:33,960 WARN L192 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-12-07 14:30:33,960 INFO L614 ElimStorePlain]: treesize reduction 165, result has 58.3 percent of original size [2019-12-07 14:30:33,978 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:34,344 WARN L192 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-12-07 14:30:34,344 INFO L614 ElimStorePlain]: treesize reduction 31, result has 82.0 percent of original size [2019-12-07 14:30:34,344 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 14:30:34,345 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:317, output treesize:141 [2019-12-07 14:30:34,732 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-12-07 14:30:34,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:34,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:34,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:34,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:34,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:34,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:34,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:34,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:34,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:34,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:30:34,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:34,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:34,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:34,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:34,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:34,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:35,657 WARN L192 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2019-12-07 14:30:36,081 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-12-07 14:30:36,091 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:30:36,092 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:36,093 INFO L614 ElimStorePlain]: treesize reduction 23, result has 4.2 percent of original size [2019-12-07 14:30:36,093 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 14:30:36,093 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:30:36,093 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:49, output treesize:1 [2019-12-07 14:30:36,103 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 14:30:36,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208827550] [2019-12-07 14:30:36,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1706346402] [2019-12-07 14:30:36,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/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 14:30:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:30:36,721 INFO L264 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 41 conjunts are in the unsatisfiable core [2019-12-07 14:30:36,722 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:30:36,728 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 14:30:36,728 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:36,735 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:36,737 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 14:30:36,737 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:36,743 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:36,743 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:30:36,743 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2019-12-07 14:30:36,931 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:36,932 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 14:30:36,932 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:36,943 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:36,946 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-12-07 14:30:36,946 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:36,957 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:36,958 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:30:36,958 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 [2019-12-07 14:30:37,062 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 14:30:37,062 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:37,082 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:37,086 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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 14:30:37,086 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:37,103 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:37,103 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:30:37,103 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2019-12-07 14:30:37,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:37,228 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 25 treesize of output 13 [2019-12-07 14:30:37,228 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:37,257 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:37,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:37,261 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 25 treesize of output 13 [2019-12-07 14:30:37,262 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:37,279 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:37,279 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:30:37,279 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:74, output treesize:44 [2019-12-07 14:30:37,284 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2019-12-07 14:30:37,285 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:37,307 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:37,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:37,311 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 36 [2019-12-07 14:30:37,311 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:37,329 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:37,329 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:30:37,329 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:70 [2019-12-07 14:30:37,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:37,595 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:30:37,609 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:37,609 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 36 treesize of output 56 [2019-12-07 14:30:37,610 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:37,685 INFO L614 ElimStorePlain]: treesize reduction 18, result has 83.6 percent of original size [2019-12-07 14:30:37,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:37,690 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:30:37,706 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:37,706 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 63 treesize of output 68 [2019-12-07 14:30:37,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:37,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:37,708 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:30:37,774 INFO L614 ElimStorePlain]: treesize reduction 14, result has 84.6 percent of original size [2019-12-07 14:30:37,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:37,774 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:30:37,775 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:96, output treesize:77 [2019-12-07 14:30:37,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:37,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:37,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:37,982 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:30:37,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:38,001 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:30:38,021 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:38,021 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 70 treesize of output 84 [2019-12-07 14:30:38,022 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:38,030 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:38,040 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-12-07 14:30:38,040 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:38,259 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-12-07 14:30:38,259 INFO L614 ElimStorePlain]: treesize reduction 57, result has 75.1 percent of original size [2019-12-07 14:30:38,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:38,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:38,310 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:38,310 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 48 [2019-12-07 14:30:38,310 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:38,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:38,323 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-12-07 14:30:38,323 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:38,401 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:38,402 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 14:30:38,402 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:191, output treesize:167 [2019-12-07 14:30:39,174 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-12-07 14:30:39,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:39,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:39,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:39,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:39,249 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2019-12-07 14:30:39,249 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:39,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:39,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:39,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:39,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:39,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:39,273 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:30:39,273 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:30:39,285 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:39,285 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 91 treesize of output 86 [2019-12-07 14:30:39,286 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:39,572 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-12-07 14:30:39,572 INFO L614 ElimStorePlain]: treesize reduction 50, result has 81.1 percent of original size [2019-12-07 14:30:39,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:39,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:39,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:39,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:39,650 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:39,651 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 57 [2019-12-07 14:30:39,651 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:39,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:39,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:39,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:39,665 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2019-12-07 14:30:39,666 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:39,748 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:39,749 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 14:30:39,749 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:245, output treesize:185 [2019-12-07 14:30:39,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:39,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:39,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:39,761 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:30:39,762 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2019-12-07 14:30:39,762 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:39,841 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:39,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:39,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:39,853 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:30:39,853 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2019-12-07 14:30:39,853 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:39,918 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:39,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:39,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:39,925 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:30:39,925 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:30:39,937 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:39,938 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 6 new quantified variables, introduced 5 case distinctions, treesize of input 85 treesize of output 57 [2019-12-07 14:30:39,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:39,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:39,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:39,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:39,939 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:30:40,033 INFO L614 ElimStorePlain]: treesize reduction 12, result has 88.7 percent of original size [2019-12-07 14:30:40,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:40,042 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:40,042 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 16 [2019-12-07 14:30:40,042 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:40,072 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:40,073 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 14:30:40,073 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:209, output treesize:52 [2019-12-07 14:30:40,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:40,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:40,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:40,439 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 14:30:40,439 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:30:41,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:41,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:41,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:41,063 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 14:30:41,071 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:30:41,081 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:41,084 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:30:41,152 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:41,158 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:30:41,167 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:30:41,172 INFO L534 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:30:41,176 INFO L534 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:30:41,212 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:41,212 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2019-12-07 14:30:41,213 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:241, output treesize:149 [2019-12-07 14:30:43,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:43,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:43,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:43,839 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 14:30:43,876 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:30:43,897 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:30:43,940 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:30:45,102 WARN L192 SmtUtils]: Spent 1.16 s on a formula simplification that was a NOOP. DAG size: 92 [2019-12-07 14:30:45,102 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:45,163 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:45,212 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:30:45,244 INFO L534 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:30:45,388 INFO L534 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:30:47,568 WARN L192 SmtUtils]: Spent 2.18 s on a formula simplification that was a NOOP. DAG size: 112 [2019-12-07 14:30:47,568 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:47,569 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2019-12-07 14:30:47,569 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:601, output treesize:857 [2019-12-07 14:30:51,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:51,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:51,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:51,804 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:51,890 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:51,920 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:52,712 WARN L192 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-12-07 14:30:52,713 INFO L614 ElimStorePlain]: treesize reduction 676, result has 51.8 percent of original size [2019-12-07 14:30:52,744 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:52,769 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:52,778 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:30:52,792 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:52,832 INFO L614 ElimStorePlain]: treesize reduction 33, result has 38.9 percent of original size [2019-12-07 14:30:52,837 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:30:52,841 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:53,123 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2019-12-07 14:30:53,124 INFO L614 ElimStorePlain]: treesize reduction 279, result has 36.9 percent of original size [2019-12-07 14:30:53,124 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-12-07 14:30:53,124 INFO L239 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:953, output treesize:163 [2019-12-07 14:30:53,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:30:53,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:53,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:53,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:53,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:53,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:53,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:53,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:53,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:53,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:53,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:53,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:53,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:53,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:53,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:53,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:53,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:53,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:53,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:54,319 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 14:30:54,320 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:30:54,321 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-12-07 14:30:54,321 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:54,321 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:54,321 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 14:30:54,322 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:30:54,322 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:1 [2019-12-07 14:30:54,332 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 14:30:54,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877059098] [2019-12-07 14:30:54,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/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 14:30:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:30:54,406 INFO L264 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-07 14:30:54,407 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:30:54,411 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 14:30:54,411 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:54,417 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:54,417 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:30:54,417 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-12-07 14:30:54,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:54,566 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-12-07 14:30:54,566 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:54,578 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:54,584 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:54,584 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 14:30:54,584 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:54,594 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:54,595 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:30:54,595 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 [2019-12-07 14:30:54,599 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 14:30:54,599 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:54,621 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:54,624 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 14:30:54,625 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:54,644 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:54,644 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:30:54,644 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2019-12-07 14:30:54,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:54,653 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 25 treesize of output 13 [2019-12-07 14:30:54,653 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:54,684 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:54,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:54,688 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 25 treesize of output 13 [2019-12-07 14:30:54,688 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:54,707 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:54,707 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:30:54,707 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:74, output treesize:44 [2019-12-07 14:30:54,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:54,713 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 40 [2019-12-07 14:30:54,714 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:54,739 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:54,743 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2019-12-07 14:30:54,744 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:54,764 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:54,765 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:30:54,765 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:70 [2019-12-07 14:30:54,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:54,773 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:30:54,789 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:54,789 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 63 treesize of output 68 [2019-12-07 14:30:54,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:54,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:54,790 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 14:30:54,878 INFO L614 ElimStorePlain]: treesize reduction 14, result has 85.3 percent of original size [2019-12-07 14:30:54,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:54,886 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:30:54,900 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:54,901 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 30 treesize of output 50 [2019-12-07 14:30:54,901 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:54,967 INFO L614 ElimStorePlain]: treesize reduction 18, result has 81.1 percent of original size [2019-12-07 14:30:54,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:54,968 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:30:54,968 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:96, output treesize:77 [2019-12-07 14:30:54,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:55,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:55,118 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:30:55,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:55,122 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:30:55,152 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2019-12-07 14:30:55,153 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:55,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:55,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:55,194 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:55,194 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 48 [2019-12-07 14:30:55,195 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:55,309 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-12-07 14:30:55,310 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:55,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:55,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:55,346 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:30:55,350 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:30:55,372 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:55,372 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 70 treesize of output 84 [2019-12-07 14:30:55,372 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:55,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:55,387 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-12-07 14:30:55,387 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:55,557 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-12-07 14:30:55,557 INFO L614 ElimStorePlain]: treesize reduction 48, result has 77.6 percent of original size [2019-12-07 14:30:55,557 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 14:30:55,558 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:191, output treesize:169 [2019-12-07 14:30:55,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:55,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:55,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:55,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:55,810 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2019-12-07 14:30:55,811 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:55,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:55,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:55,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:55,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:55,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:55,837 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:30:55,837 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:30:55,850 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:55,850 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 91 treesize of output 86 [2019-12-07 14:30:55,850 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:56,154 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-12-07 14:30:56,155 INFO L614 ElimStorePlain]: treesize reduction 50, result has 81.1 percent of original size [2019-12-07 14:30:56,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:56,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:56,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:56,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, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2019-12-07 14:30:56,178 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:56,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:56,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:56,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:56,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:56,204 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:56,204 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 57 [2019-12-07 14:30:56,204 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:56,289 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:56,290 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 14:30:56,290 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:245, output treesize:185 [2019-12-07 14:30:56,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:56,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:56,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:56,302 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:30:56,303 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2019-12-07 14:30:56,303 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:56,384 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:56,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:56,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:56,396 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:30:56,397 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2019-12-07 14:30:56,397 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:56,458 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:56,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:56,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:56,464 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:30:56,464 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:30:56,476 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:56,476 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 6 new quantified variables, introduced 5 case distinctions, treesize of input 85 treesize of output 57 [2019-12-07 14:30:56,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:56,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:56,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:56,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:56,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:56,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:56,478 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:30:56,579 INFO L614 ElimStorePlain]: treesize reduction 12, result has 88.7 percent of original size [2019-12-07 14:30:56,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:30:56,584 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:56,585 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 16 [2019-12-07 14:30:56,585 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:56,613 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:56,614 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 14:30:56,614 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:209, output treesize:52 [2019-12-07 14:30:56,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:56,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:56,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:56,670 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 28 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 14:30:56,671 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:30:56,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:56,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:56,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:56,679 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 14:30:56,689 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:30:56,700 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:30:56,706 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:30:56,793 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:56,799 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:30:56,806 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:30:56,811 INFO L534 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:30:56,819 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:56,858 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:30:56,859 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2019-12-07 14:30:56,859 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:241, output treesize:149 [2019-12-07 14:30:57,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:57,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:57,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:59,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:59,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:59,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:30:59,756 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 14:30:59,770 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:30:59,787 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:30:59,793 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:31:00,031 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-12-07 14:31:00,031 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:00,040 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:31:00,053 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:31:00,079 INFO L534 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:31:00,090 INFO L534 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:31:00,576 WARN L192 SmtUtils]: Spent 486.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-12-07 14:31:00,577 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:00,577 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2019-12-07 14:31:00,577 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:361, output treesize:425 [2019-12-07 14:31:02,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:02,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:02,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:02,386 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:02,411 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:02,421 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:03,205 WARN L192 SmtUtils]: Spent 784.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2019-12-07 14:31:03,206 INFO L614 ElimStorePlain]: treesize reduction 186, result has 63.9 percent of original size [2019-12-07 14:31:03,219 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:03,223 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:31:03,224 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:03,235 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:03,238 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:31:03,238 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:03,386 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 22 [2019-12-07 14:31:03,386 INFO L614 ElimStorePlain]: treesize reduction 90, result has 41.2 percent of original size [2019-12-07 14:31:03,386 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-12-07 14:31:03,386 INFO L239 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:473, output treesize:63 [2019-12-07 14:31:03,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:31:03,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:03,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:05,078 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 27 [2019-12-07 14:31:07,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:31:07,681 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:07,682 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 14:31:07,682 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:07,699 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:07,699 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 14:31:07,700 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:07,709 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:31:07,709 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:07,744 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:07,745 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-12-07 14:31:07,745 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:68, output treesize:31 [2019-12-07 14:31:08,129 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 14:31:08,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 14:31:08,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 15, 13, 16, 13] total 56 [2019-12-07 14:31:08,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843057978] [2019-12-07 14:31:08,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-12-07 14:31:08,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 14:31:08,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-12-07 14:31:08,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=2864, Unknown=0, NotChecked=0, Total=3192 [2019-12-07 14:31:08,131 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 57 states. [2019-12-07 14:31:11,498 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 70 [2019-12-07 14:31:12,135 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-12-07 14:31:12,556 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 67 [2019-12-07 14:31:12,976 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 75 [2019-12-07 14:31:13,743 WARN L192 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 80 [2019-12-07 14:31:14,646 WARN L192 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 111 [2019-12-07 14:31:15,961 WARN L192 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 266 DAG size of output: 147 [2019-12-07 14:31:17,574 WARN L192 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 280 DAG size of output: 153 [2019-12-07 14:31:19,076 WARN L192 SmtUtils]: Spent 998.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 124 [2019-12-07 14:31:20,791 WARN L192 SmtUtils]: Spent 807.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 117 [2019-12-07 14:31:22,256 WARN L192 SmtUtils]: Spent 830.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 124 [2019-12-07 14:31:23,033 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 43 [2019-12-07 14:31:24,397 WARN L192 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 101 [2019-12-07 14:31:24,798 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 50 [2019-12-07 14:31:26,400 WARN L192 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 107 [2019-12-07 14:31:27,648 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 41 [2019-12-07 14:31:28,285 WARN L192 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 47 [2019-12-07 14:31:28,595 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 25 [2019-12-07 14:31:29,041 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 31 [2019-12-07 14:31:29,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:31:29,133 INFO L93 Difference]: Finished difference Result 179 states and 186 transitions. [2019-12-07 14:31:29,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 14:31:29,134 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 43 [2019-12-07 14:31:29,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:31:29,135 INFO L225 Difference]: With dead ends: 179 [2019-12-07 14:31:29,135 INFO L226 Difference]: Without dead ends: 179 [2019-12-07 14:31:29,137 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 183 SyntacticMatches, 16 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2635 ImplicationChecksByTransitivity, 41.0s TimeCoverageRelationStatistics Valid=1186, Invalid=5620, Unknown=0, NotChecked=0, Total=6806 [2019-12-07 14:31:29,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-12-07 14:31:29,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 90. [2019-12-07 14:31:29,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-12-07 14:31:29,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2019-12-07 14:31:29,139 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 43 [2019-12-07 14:31:29,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:31:29,139 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2019-12-07 14:31:29,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-12-07 14:31:29,140 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2019-12-07 14:31:29,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 14:31:29,140 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:31:29,140 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:31:29,742 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 14:31:29,742 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 14:31:29,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:31:29,743 INFO L82 PathProgramCache]: Analyzing trace with hash 668273275, now seen corresponding path program 1 times [2019-12-07 14:31:29,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 14:31:29,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1704639793] [2019-12-07 14:31:29,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/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 14:31:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:31:30,174 INFO L264 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 62 conjunts are in the unsatisfiable core [2019-12-07 14:31:30,176 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:31:30,179 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 14:31:30,179 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:30,186 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:30,186 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:31:30,186 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-12-07 14:31:30,214 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:30,214 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 14:31:30,214 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:30,238 INFO L614 ElimStorePlain]: treesize reduction 14, result has 62.2 percent of original size [2019-12-07 14:31:30,238 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:31:30,238 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2019-12-07 14:31:30,336 INFO L343 Elim1Store]: treesize reduction 8, result has 87.3 percent of original size [2019-12-07 14:31:30,336 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 14:31:30,337 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:30,376 INFO L614 ElimStorePlain]: treesize reduction 28, result has 54.1 percent of original size [2019-12-07 14:31:30,377 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:31:30,377 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:33 [2019-12-07 14:31:30,475 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:30,475 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 14:31:30,476 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:30,524 INFO L614 ElimStorePlain]: treesize reduction 28, result has 58.8 percent of original size [2019-12-07 14:31:30,525 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:31:30,525 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:40 [2019-12-07 14:31:30,561 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 14:31:30,561 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:30,585 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:30,585 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:31:30,585 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:49 [2019-12-07 14:31:30,626 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-12-07 14:31:30,626 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:30,648 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:30,649 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 14:31:30,649 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:49 [2019-12-07 14:31:30,751 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:30,751 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 41 [2019-12-07 14:31:30,751 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:30,782 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:30,783 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 14:31:30,783 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:35 [2019-12-07 14:31:30,817 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_267|, |v_#memory_$Pointer$.base_285|], 2=[|v_#memory_int_262|]} [2019-12-07 14:31:30,823 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 13 treesize of output 9 [2019-12-07 14:31:30,823 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:30,883 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:30,889 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 13 treesize of output 9 [2019-12-07 14:31:30,889 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:30,927 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:30,933 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-12-07 14:31:30,933 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:30,961 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:30,961 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:31:30,961 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:80, output treesize:53 [2019-12-07 14:31:31,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:31:31,020 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 14:31:31,021 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:31,066 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:31,073 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 14:31:31,073 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:31,111 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:31,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:31:31,117 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 14:31:31,117 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:31,146 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:31,146 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:31:31,146 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:91, output treesize:57 [2019-12-07 14:31:31,198 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_269|, |v_#memory_$Pointer$.base_287|], 4=[|v_#memory_int_264|]} [2019-12-07 14:31:31,205 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2019-12-07 14:31:31,205 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:31,273 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:31,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:31:31,277 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 57 [2019-12-07 14:31:31,278 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:31,323 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:31,330 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 27 [2019-12-07 14:31:31,330 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:31,360 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:31,360 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:31:31,360 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:142, output treesize:89 [2019-12-07 14:31:31,508 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-12-07 14:31:31,509 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:31,581 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:31,586 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2019-12-07 14:31:31,586 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:31,627 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:31,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:31:31,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:31:31,633 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:31,633 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 54 [2019-12-07 14:31:31,633 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:31,711 INFO L614 ElimStorePlain]: treesize reduction 4, result has 96.3 percent of original size [2019-12-07 14:31:31,712 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:31:31,712 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:134, output treesize:103 [2019-12-07 14:31:31,817 INFO L430 ElimStorePlain]: Different costs {6=[|v_#memory_int_266|], 10=[|v_#memory_$Pointer$.offset_271|, |v_#memory_$Pointer$.base_289|]} [2019-12-07 14:31:31,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:31:31,831 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2019-12-07 14:31:31,831 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:31,925 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:31,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:31:31,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:31:31,935 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2019-12-07 14:31:31,935 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:31,991 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:31,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:31:31,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:31:31,998 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:31:31,999 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:31:32,026 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:32,026 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 80 treesize of output 88 [2019-12-07 14:31:32,027 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:32,164 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-12-07 14:31:32,164 INFO L614 ElimStorePlain]: treesize reduction 62, result has 62.7 percent of original size [2019-12-07 14:31:32,165 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:31:32,165 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:141, output treesize:113 [2019-12-07 14:31:32,470 INFO L430 ElimStorePlain]: Different costs {5=[|v_#memory_int_267|], 10=[|v_#memory_$Pointer$.base_290|, |v_#memory_$Pointer$.offset_272|]} [2019-12-07 14:31:32,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:31:32,490 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2019-12-07 14:31:32,490 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:32,644 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-07 14:31:32,645 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:32,662 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:32,663 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 83 treesize of output 82 [2019-12-07 14:31:32,663 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:32,823 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-12-07 14:31:32,823 INFO L614 ElimStorePlain]: treesize reduction 48, result has 69.6 percent of original size [2019-12-07 14:31:32,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:31:32,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:31:32,831 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2019-12-07 14:31:32,831 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:32,859 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:32,859 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:31:32,859 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:136, output treesize:88 [2019-12-07 14:31:32,970 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:32,971 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 75 treesize of output 57 [2019-12-07 14:31:32,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:32,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:32,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:32,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:32,972 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 14:31:33,025 INFO L614 ElimStorePlain]: treesize reduction 8, result has 87.9 percent of original size [2019-12-07 14:31:33,028 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2019-12-07 14:31:33,029 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:33,042 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:33,042 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:31:33,042 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:99, output treesize:14 [2019-12-07 14:31:33,193 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 14:31:33,194 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:31:33,198 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:33,198 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 14:31:33,199 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-12-07 14:31:33,290 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:31:33,290 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:31:33,554 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 14:31:33,568 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:33,569 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:31:33,573 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:33,573 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 14:31:33,573 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:33 [2019-12-07 14:31:33,928 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 14:31:33,933 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:33,934 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 14:31:33,934 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:64, output treesize:48 [2019-12-07 14:31:34,084 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 14:31:34,094 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:34,094 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-12-07 14:31:34,094 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:89, output treesize:88 [2019-12-07 14:31:34,711 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 14:31:34,790 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:34,790 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-12-07 14:31:34,790 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:149, output treesize:168 [2019-12-07 14:31:35,657 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 14:31:35,806 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-12-07 14:31:35,807 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:35,809 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:31:35,840 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:35,840 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-12-07 14:31:35,841 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:265, output treesize:296 [2019-12-07 14:31:38,674 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 6=[|v_#memory_int_273|]} [2019-12-07 14:31:50,996 WARN L192 SmtUtils]: Spent 12.32 s on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2019-12-07 14:31:50,996 INFO L343 Elim1Store]: treesize reduction 89, result has 39.9 percent of original size [2019-12-07 14:31:50,997 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 248 treesize of output 237 [2019-12-07 14:31:50,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:50,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:50,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:51,023 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:31:51,023 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 237 treesize of output 251 [2019-12-07 14:31:51,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:51,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:51,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:51,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:51,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:51,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:51,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:51,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:51,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:51,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:51,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:51,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:51,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:51,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:51,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:51,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:51,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:51,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:51,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:51,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:51,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:51,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:51,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:51,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:51,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:51,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:51,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:31:51,037 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:31:51,038 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:31:51,038 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_330, v_arrayElimCell_329], 2=[v_arrayElimCell_328]} [2019-12-07 14:31:51,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1704639793] [2019-12-07 14:31:51,081 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@37c5531d [2019-12-07 14:31:51,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [591868027] [2019-12-07 14:31:51,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/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 14:31:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:31:51,496 INFO L264 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 58 conjunts are in the unsatisfiable core [2019-12-07 14:31:51,497 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:31:51,498 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@37c5531d [2019-12-07 14:31:51,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879449856] [2019-12-07 14:31:51,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f487e0e-e1f8-4384-b4a3-23ae3ef2bc21/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 14:31:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:31:51,584 INFO L264 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 57 conjunts are in the unsatisfiable core [2019-12-07 14:31:51,585 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:31:51,585 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@37c5531d [2019-12-07 14:31:51,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:31:51,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 14:31:51,586 ERROR L206 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2019-12-07 14:31:51,586 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:31:52,190 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 14:31:52,207 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 14:31:52,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:31:52 BoogieIcfgContainer [2019-12-07 14:31:52,207 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:31:52,208 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:31:52,208 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:31:52,208 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:31:52,208 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:29:19" (3/4) ... [2019-12-07 14:31:52,210 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 14:31:52,210 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:31:52,211 INFO L168 Benchmark]: Toolchain (without parser) took 153045.64 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 250.1 MB). Free memory was 948.4 MB in the beginning and 913.9 MB in the end (delta: 34.4 MB). Peak memory consumption was 284.5 MB. Max. memory is 11.5 GB. [2019-12-07 14:31:52,211 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 14:31:52,212 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -168.9 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-12-07 14:31:52,212 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.01 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 14:31:52,212 INFO L168 Benchmark]: Boogie Preprocessor took 23.35 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 14:31:52,212 INFO L168 Benchmark]: RCFGBuilder took 387.95 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: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. [2019-12-07 14:31:52,212 INFO L168 Benchmark]: TraceAbstraction took 152260.59 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 114.8 MB). Free memory was 1.1 GB in the beginning and 913.9 MB in the end (delta: 157.3 MB). Peak memory consumption was 272.1 MB. Max. memory is 11.5 GB. [2019-12-07 14:31:52,213 INFO L168 Benchmark]: Witness Printer took 2.95 ms. Allocated memory is still 1.3 GB. Free memory is still 913.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:31:52,214 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 334.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -168.9 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.01 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 23.35 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 387.95 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: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 152260.59 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 114.8 MB). Free memory was 1.1 GB in the beginning and 913.9 MB in the end (delta: 157.3 MB). Peak memory consumption was 272.1 MB. Max. memory is 11.5 GB. * Witness Printer took 2.95 ms. Allocated memory is still 1.3 GB. Free memory is still 913.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 588]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: unable to decide satisfiability of path constraint, overapproximation of memtrack at line 588. Possible FailurePath: [L589] const int len = 5; [L590] const int data_init = 1; [L565] DLL last = (DLL) malloc(sizeof(struct node)); [L566] COND FALSE !(((void *)0) == last) [L569] last->next = last [L570] last->prev = last [L571] last->data = data [L572] DLL head = last; [L573] COND TRUE len > 1 [L574] DLL new_head = (DLL) malloc(sizeof(struct node)); [L575] COND FALSE !(((void *)0) == new_head) [L578] new_head->next = head [L579] new_head->data = data [L580] head->prev = new_head [L581] head = new_head [L582] len-- [L573] COND TRUE len > 1 [L574] DLL new_head = (DLL) malloc(sizeof(struct node)); [L575] COND FALSE !(((void *)0) == new_head) [L578] new_head->next = head [L579] new_head->data = data [L580] head->prev = new_head [L581] head = new_head [L582] len-- [L573] COND TRUE len > 1 [L574] DLL new_head = (DLL) malloc(sizeof(struct node)); [L575] COND FALSE !(((void *)0) == new_head) [L578] new_head->next = head [L579] new_head->data = data [L580] head->prev = new_head [L581] head = new_head [L582] len-- [L573] COND TRUE len > 1 [L574] DLL new_head = (DLL) malloc(sizeof(struct node)); [L575] COND FALSE !(((void *)0) == new_head) [L578] new_head->next = head [L579] new_head->data = data [L580] head->prev = new_head [L581] head = new_head [L582] len-- [L573] COND FALSE !(len > 1) [L584] last->next = head [L585] head->prev = last [L586] return head; [L591] DLL head = dll_circular_create(len, data_init); [L592] DLL ptr = head; [L593] int data_new = 1; [L595] EXPR ptr->data [L595] COND FALSE !(data_init != ptr->data) [L598] ptr->data = data_new [L599] EXPR ptr->next [L599] ptr = ptr->next [L600] data_new++ [L601] COND TRUE ptr != head [L595] EXPR ptr->data [L595] COND TRUE data_init != ptr->data [L614] return 1; - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 73 locations, 32 error locations. Result: UNKNOWN, OverallTime: 152.2s, OverallIterations: 16, TraceHistogramMax: 4, AutomataDifference: 40.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 496 SDtfs, 4388 SDslu, 1378 SDs, 0 SdLazy, 2870 SolverSat, 604 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 15.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1590 GetRequests, 1251 SyntacticMatches, 60 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5183 ImplicationChecksByTransitivity, 56.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=15, 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, 15 MinimizatonAttempts, 318 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 3.9s SatisfiabilityAnalysisTime, 77.4s InterpolantComputationTime, 782 NumberOfCodeBlocks, 782 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1502 ConstructedInterpolants, 202 QuantifiedInterpolants, 824814 SizeOfPredicates, 330 NumberOfNonLiveVariables, 4247 ConjunctsInSsa, 434 ConjunctsInUnsatCore, 62 InterpolantComputations, 18 PerfectInterpolantSequences, 566/936 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...