./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 bebd3708d0e1127b0953933828504d3490382862 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_3fc84fb2-79c1-4d4b-addf-c760d727f52a/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 bebd3708d0e1127b0953933828504d3490382862 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 12:29:31,214 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:29:31,215 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:29:31,224 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:29:31,224 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:29:31,225 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:29:31,226 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:29:31,228 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:29:31,230 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:29:31,231 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:29:31,231 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:29:31,232 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:29:31,232 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:29:31,233 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:29:31,234 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:29:31,234 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:29:31,235 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:29:31,236 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:29:31,237 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:29:31,239 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:29:31,240 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:29:31,241 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:29:31,242 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:29:31,242 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:29:31,244 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:29:31,244 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:29:31,244 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:29:31,245 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:29:31,245 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:29:31,246 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:29:31,246 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:29:31,247 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:29:31,247 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:29:31,248 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:29:31,248 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:29:31,249 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:29:31,249 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:29:31,249 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:29:31,250 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:29:31,250 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:29:31,251 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:29:31,251 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 12:29:31,265 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:29:31,265 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:29:31,266 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 12:29:31,266 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 12:29:31,266 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 12:29:31,266 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 12:29:31,267 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 12:29:31,267 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 12:29:31,267 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 12:29:31,267 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 12:29:31,267 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 12:29:31,267 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 12:29:31,268 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 12:29:31,268 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 12:29:31,268 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 12:29:31,268 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:29:31,269 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:29:31,269 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:29:31,269 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:29:31,269 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 12:29:31,269 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:29:31,270 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:29:31,270 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:29:31,270 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 12:29:31,270 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 12:29:31,270 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 12:29:31,270 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:29:31,271 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:29:31,271 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:29:31,271 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:29:31,271 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:29:31,271 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:29:31,272 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:29:31,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:29:31,272 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:29:31,272 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:29:31,272 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 12:29:31,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:29:31,273 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:29:31,273 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:29:31,273 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_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 -> bebd3708d0e1127b0953933828504d3490382862 [2019-12-07 12:29:31,380 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:29:31,390 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:29:31,392 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:29:31,394 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:29:31,394 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:29:31,394 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/bin/utaipan/../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2019-12-07 12:29:31,430 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/bin/utaipan/data/c20a6618c/248758dda052404c9b3ce69b426c5b76/FLAG6bdb9f47e [2019-12-07 12:29:31,885 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:29:31,886 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2019-12-07 12:29:31,895 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/bin/utaipan/data/c20a6618c/248758dda052404c9b3ce69b426c5b76/FLAG6bdb9f47e [2019-12-07 12:29:31,904 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/bin/utaipan/data/c20a6618c/248758dda052404c9b3ce69b426c5b76 [2019-12-07 12:29:31,905 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:29:31,906 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:29:31,907 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:29:31,907 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:29:31,909 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:29:31,910 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:29:31" (1/1) ... [2019-12-07 12:29:31,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@200f7f72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:29:31, skipping insertion in model container [2019-12-07 12:29:31,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:29:31" (1/1) ... [2019-12-07 12:29:31,916 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:29:31,940 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:29:32,142 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:29:32,148 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:29:32,177 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:29:32,207 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:29:32,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:29:32 WrapperNode [2019-12-07 12:29:32,207 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:29:32,208 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:29:32,208 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:29:32,208 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:29:32,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:29:32" (1/1) ... [2019-12-07 12:29:32,223 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:29:32" (1/1) ... [2019-12-07 12:29:32,238 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:29:32,238 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:29:32,238 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:29:32,238 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:29:32,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:29:32" (1/1) ... [2019-12-07 12:29:32,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:29:32" (1/1) ... [2019-12-07 12:29:32,247 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:29:32" (1/1) ... [2019-12-07 12:29:32,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:29:32" (1/1) ... [2019-12-07 12:29:32,253 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:29:32" (1/1) ... [2019-12-07 12:29:32,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:29:32" (1/1) ... [2019-12-07 12:29:32,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:29:32" (1/1) ... [2019-12-07 12:29:32,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:29:32,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:29:32,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:29:32,260 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:29:32,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:29:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:29:32,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 12:29:32,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:29:32,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 12:29:32,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 12:29:32,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 12:29:32,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:29:32,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:29:32,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:29:32,602 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:29:32,602 INFO L287 CfgBuilder]: Removed 13 assume(true) statements. [2019-12-07 12:29:32,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:29:32 BoogieIcfgContainer [2019-12-07 12:29:32,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:29:32,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:29:32,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:29:32,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:29:32,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:29:31" (1/3) ... [2019-12-07 12:29:32,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@368c11cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:29:32, skipping insertion in model container [2019-12-07 12:29:32,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:29:32" (2/3) ... [2019-12-07 12:29:32,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@368c11cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:29:32, skipping insertion in model container [2019-12-07 12:29:32,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:29:32" (3/3) ... [2019-12-07 12:29:32,607 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-2.i [2019-12-07 12:29:32,614 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:29:32,618 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 35 error locations. [2019-12-07 12:29:32,626 INFO L249 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2019-12-07 12:29:32,638 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:29:32,638 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 12:29:32,638 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:29:32,639 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:29:32,639 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:29:32,639 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:29:32,639 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:29:32,639 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:29:32,649 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2019-12-07 12:29:32,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 12:29:32,654 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:32,654 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 12:29:32,655 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 12:29:32,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:32,658 INFO L82 PathProgramCache]: Analyzing trace with hash 158824, now seen corresponding path program 1 times [2019-12-07 12:29:32,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:29:32,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384556365] [2019-12-07 12:29:32,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:29:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:32,761 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 12:29:32,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384556365] [2019-12-07 12:29:32,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:29:32,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:29:32,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104844391] [2019-12-07 12:29:32,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:29:32,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:29:32,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:29:32,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:29:32,776 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 3 states. [2019-12-07 12:29:32,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:32,848 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2019-12-07 12:29:32,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:29:32,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 12:29:32,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:32,855 INFO L225 Difference]: With dead ends: 80 [2019-12-07 12:29:32,856 INFO L226 Difference]: Without dead ends: 77 [2019-12-07 12:29:32,857 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 12:29:32,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-12-07 12:29:32,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 61. [2019-12-07 12:29:32,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 12:29:32,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2019-12-07 12:29:32,881 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 3 [2019-12-07 12:29:32,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:32,881 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2019-12-07 12:29:32,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:29:32,881 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2019-12-07 12:29:32,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 12:29:32,881 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:32,881 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 12:29:32,881 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 12:29:32,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:32,882 INFO L82 PathProgramCache]: Analyzing trace with hash 158825, now seen corresponding path program 1 times [2019-12-07 12:29:32,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:29:32,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109427209] [2019-12-07 12:29:32,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:29:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:32,914 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 12:29:32,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109427209] [2019-12-07 12:29:32,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:29:32,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:29:32,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080238112] [2019-12-07 12:29:32,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:29:32,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:29:32,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:29:32,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:29:32,916 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 3 states. [2019-12-07 12:29:32,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:32,956 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2019-12-07 12:29:32,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:29:32,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 12:29:32,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:32,957 INFO L225 Difference]: With dead ends: 57 [2019-12-07 12:29:32,958 INFO L226 Difference]: Without dead ends: 57 [2019-12-07 12:29:32,958 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 12:29:32,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-12-07 12:29:32,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-12-07 12:29:32,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-07 12:29:32,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2019-12-07 12:29:32,962 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 3 [2019-12-07 12:29:32,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:32,963 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2019-12-07 12:29:32,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:29:32,963 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2019-12-07 12:29:32,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 12:29:32,963 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:32,963 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:29:32,963 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 12:29:32,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:32,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1386430513, now seen corresponding path program 1 times [2019-12-07 12:29:32,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:29:32,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454239819] [2019-12-07 12:29:32,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:29:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:32,994 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 12:29:32,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454239819] [2019-12-07 12:29:32,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:29:32,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:29:32,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101037952] [2019-12-07 12:29:32,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:29:32,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:29:32,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:29:32,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:29:32,996 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 3 states. [2019-12-07 12:29:33,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:33,005 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2019-12-07 12:29:33,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:29:33,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-07 12:29:33,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:33,006 INFO L225 Difference]: With dead ends: 68 [2019-12-07 12:29:33,006 INFO L226 Difference]: Without dead ends: 68 [2019-12-07 12:29:33,006 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 12:29:33,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-07 12:29:33,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2019-12-07 12:29:33,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-07 12:29:33,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2019-12-07 12:29:33,011 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 8 [2019-12-07 12:29:33,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:33,011 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2019-12-07 12:29:33,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:29:33,011 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2019-12-07 12:29:33,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 12:29:33,011 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:33,011 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:29:33,012 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 12:29:33,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:33,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1386542470, now seen corresponding path program 1 times [2019-12-07 12:29:33,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:29:33,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020277086] [2019-12-07 12:29:33,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:29:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:33,037 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 12:29:33,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020277086] [2019-12-07 12:29:33,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:29:33,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:29:33,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491638591] [2019-12-07 12:29:33,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:29:33,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:29:33,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:29:33,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:29:33,038 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 3 states. [2019-12-07 12:29:33,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:33,080 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2019-12-07 12:29:33,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:29:33,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-07 12:29:33,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:33,082 INFO L225 Difference]: With dead ends: 72 [2019-12-07 12:29:33,082 INFO L226 Difference]: Without dead ends: 72 [2019-12-07 12:29:33,082 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 12:29:33,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-12-07 12:29:33,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 56. [2019-12-07 12:29:33,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 12:29:33,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2019-12-07 12:29:33,087 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 8 [2019-12-07 12:29:33,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:33,088 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2019-12-07 12:29:33,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:29:33,088 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2019-12-07 12:29:33,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 12:29:33,088 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:33,088 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:29:33,089 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 12:29:33,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:33,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1386542469, now seen corresponding path program 1 times [2019-12-07 12:29:33,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:29:33,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925781836] [2019-12-07 12:29:33,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:29:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:33,133 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 12:29:33,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925781836] [2019-12-07 12:29:33,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:29:33,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:29:33,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92995287] [2019-12-07 12:29:33,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:29:33,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:29:33,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:29:33,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:29:33,135 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 3 states. [2019-12-07 12:29:33,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:33,172 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2019-12-07 12:29:33,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:29:33,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-07 12:29:33,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:33,173 INFO L225 Difference]: With dead ends: 54 [2019-12-07 12:29:33,173 INFO L226 Difference]: Without dead ends: 54 [2019-12-07 12:29:33,173 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 12:29:33,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-12-07 12:29:33,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-12-07 12:29:33,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-07 12:29:33,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-12-07 12:29:33,176 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 8 [2019-12-07 12:29:33,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:33,176 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-12-07 12:29:33,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:29:33,176 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-12-07 12:29:33,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 12:29:33,177 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:33,177 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:29:33,177 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 12:29:33,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:33,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1027451619, now seen corresponding path program 1 times [2019-12-07 12:29:33,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:29:33,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877502737] [2019-12-07 12:29:33,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:29:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:33,231 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 12:29:33,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877502737] [2019-12-07 12:29:33,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:29:33,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:29:33,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810458954] [2019-12-07 12:29:33,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:29:33,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:29:33,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:29:33,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:29:33,233 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 5 states. [2019-12-07 12:29:33,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:33,316 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2019-12-07 12:29:33,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:29:33,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-12-07 12:29:33,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:33,317 INFO L225 Difference]: With dead ends: 75 [2019-12-07 12:29:33,317 INFO L226 Difference]: Without dead ends: 75 [2019-12-07 12:29:33,318 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 12:29:33,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-07 12:29:33,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 58. [2019-12-07 12:29:33,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-07 12:29:33,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-12-07 12:29:33,321 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 10 [2019-12-07 12:29:33,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:33,321 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-12-07 12:29:33,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:29:33,321 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-12-07 12:29:33,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 12:29:33,321 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:33,322 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:29:33,322 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 12:29:33,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:33,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1027451618, now seen corresponding path program 1 times [2019-12-07 12:29:33,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:29:33,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394367863] [2019-12-07 12:29:33,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:29:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:33,375 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 12:29:33,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394367863] [2019-12-07 12:29:33,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:29:33,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:29:33,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502935036] [2019-12-07 12:29:33,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:29:33,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:29:33,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:29:33,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:29:33,377 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 6 states. [2019-12-07 12:29:33,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:33,485 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2019-12-07 12:29:33,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:29:33,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-12-07 12:29:33,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:33,486 INFO L225 Difference]: With dead ends: 74 [2019-12-07 12:29:33,486 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 12:29:33,487 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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 12:29:33,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 12:29:33,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 58. [2019-12-07 12:29:33,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-07 12:29:33,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2019-12-07 12:29:33,490 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 10 [2019-12-07 12:29:33,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:33,490 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2019-12-07 12:29:33,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:29:33,490 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2019-12-07 12:29:33,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:29:33,491 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:33,491 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:29:33,491 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 12:29:33,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:33,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1423617691, now seen corresponding path program 1 times [2019-12-07 12:29:33,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:29:33,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816095106] [2019-12-07 12:29:33,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:29:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:33,518 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 12:29:33,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816095106] [2019-12-07 12:29:33,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807472058] [2019-12-07 12:29:33,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:29:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:33,569 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 12:29:33,574 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:29:33,596 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 12:29:33,597 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:29:33,609 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 12:29:33,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1743311313] [2019-12-07 12:29:33,625 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 12:29:33,625 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 12:29:33,629 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 12:29:33,633 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 12:29:33,634 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 12:29:33,729 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:29:33,912 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:29:34,223 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 12:29:34,404 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@7c793565 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 12:29:34,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 12:29:34,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2019-12-07 12:29:34,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748633350] [2019-12-07 12:29:34,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:29:34,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:29:34,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:29:34,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:29:34,407 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 7 states. [2019-12-07 12:29:34,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 12:29:34,608 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:29:34,609 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@7c793565 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 12:29:34,612 INFO L168 Benchmark]: Toolchain (without parser) took 2705.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 934.6 MB in the beginning and 941.1 MB in the end (delta: -6.5 MB). Peak memory consumption was 112.0 MB. Max. memory is 11.5 GB. [2019-12-07 12:29:34,613 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 953.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:29:34,613 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 934.6 MB in the beginning and 1.1 GB in the end (delta: -163.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-12-07 12:29:34,614 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.20 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.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:29:34,614 INFO L168 Benchmark]: Boogie Preprocessor took 21.22 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.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:29:34,615 INFO L168 Benchmark]: RCFGBuilder took 343.47 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: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 11.5 GB. [2019-12-07 12:29:34,615 INFO L168 Benchmark]: TraceAbstraction took 2007.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 941.1 MB in the end (delta: 109.1 MB). Peak memory consumption was 109.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:29:34,619 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 953.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 300.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 934.6 MB in the beginning and 1.1 GB in the end (delta: -163.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.20 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.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.22 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.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 343.47 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: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2007.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 941.1 MB in the end (delta: 109.1 MB). Peak memory consumption was 109.1 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@7c793565 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@7c793565: 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 12:29:36,004 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:29:36,005 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:29:36,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:29:36,014 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:29:36,014 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:29:36,015 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:29:36,017 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:29:36,018 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:29:36,019 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:29:36,019 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:29:36,020 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:29:36,020 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:29:36,021 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:29:36,021 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:29:36,022 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:29:36,023 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:29:36,024 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:29:36,025 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:29:36,027 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:29:36,028 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:29:36,029 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:29:36,030 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:29:36,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:29:36,034 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:29:36,034 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:29:36,034 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:29:36,035 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:29:36,035 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:29:36,036 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:29:36,036 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:29:36,037 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:29:36,037 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:29:36,037 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:29:36,038 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:29:36,038 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:29:36,039 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:29:36,039 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:29:36,039 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:29:36,040 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:29:36,040 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:29:36,041 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-12-07 12:29:36,054 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:29:36,054 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:29:36,055 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 12:29:36,055 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 12:29:36,055 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 12:29:36,055 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 12:29:36,055 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 12:29:36,056 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 12:29:36,056 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 12:29:36,056 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:29:36,057 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:29:36,057 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:29:36,057 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:29:36,057 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 12:29:36,057 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:29:36,058 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:29:36,058 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:29:36,058 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 12:29:36,058 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 12:29:36,058 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 12:29:36,058 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:29:36,059 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:29:36,059 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 12:29:36,059 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 12:29:36,059 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:29:36,059 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:29:36,060 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:29:36,060 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:29:36,060 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:29:36,060 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:29:36,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:29:36,061 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:29:36,061 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:29:36,061 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 12:29:36,061 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 12:29:36,061 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:29:36,062 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:29:36,062 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_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 -> bebd3708d0e1127b0953933828504d3490382862 [2019-12-07 12:29:36,234 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:29:36,245 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:29:36,247 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:29:36,249 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:29:36,249 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:29:36,250 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/bin/utaipan/../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2019-12-07 12:29:36,291 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/bin/utaipan/data/c3edbb5fc/2196686014a1451fbdf6c8f6eb9aa94f/FLAGb5d30a8e9 [2019-12-07 12:29:36,669 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:29:36,669 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2019-12-07 12:29:36,678 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/bin/utaipan/data/c3edbb5fc/2196686014a1451fbdf6c8f6eb9aa94f/FLAGb5d30a8e9 [2019-12-07 12:29:36,686 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/bin/utaipan/data/c3edbb5fc/2196686014a1451fbdf6c8f6eb9aa94f [2019-12-07 12:29:36,688 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:29:36,689 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:29:36,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:29:36,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:29:36,692 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:29:36,692 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:29:36" (1/1) ... [2019-12-07 12:29:36,694 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 12:29:36, skipping insertion in model container [2019-12-07 12:29:36,694 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:29:36" (1/1) ... [2019-12-07 12:29:36,699 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:29:36,722 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:29:36,928 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:29:36,936 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:29:36,966 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:29:37,000 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:29:37,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:29:37 WrapperNode [2019-12-07 12:29:37,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:29:37,001 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:29:37,001 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:29:37,001 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:29:37,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:29:37" (1/1) ... [2019-12-07 12:29:37,018 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:29:37" (1/1) ... [2019-12-07 12:29:37,033 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:29:37,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:29:37,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:29:37,034 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:29:37,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:29:37" (1/1) ... [2019-12-07 12:29:37,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:29:37" (1/1) ... [2019-12-07 12:29:37,042 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:29:37" (1/1) ... [2019-12-07 12:29:37,042 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:29:37" (1/1) ... [2019-12-07 12:29:37,049 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:29:37" (1/1) ... [2019-12-07 12:29:37,052 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:29:37" (1/1) ... [2019-12-07 12:29:37,053 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:29:37" (1/1) ... [2019-12-07 12:29:37,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:29:37,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:29:37,056 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:29:37,056 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:29:37,057 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:29:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:29:37,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 12:29:37,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 12:29:37,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 12:29:37,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 12:29:37,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:29:37,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 12:29:37,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:29:37,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:29:37,466 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:29:37,466 INFO L287 CfgBuilder]: Removed 13 assume(true) statements. [2019-12-07 12:29:37,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:29:37 BoogieIcfgContainer [2019-12-07 12:29:37,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:29:37,469 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:29:37,469 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:29:37,471 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:29:37,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:29:36" (1/3) ... [2019-12-07 12:29:37,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e14159f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:29:37, skipping insertion in model container [2019-12-07 12:29:37,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:29:37" (2/3) ... [2019-12-07 12:29:37,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e14159f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:29:37, skipping insertion in model container [2019-12-07 12:29:37,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:29:37" (3/3) ... [2019-12-07 12:29:37,474 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-2.i [2019-12-07 12:29:37,482 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:29:37,489 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 35 error locations. [2019-12-07 12:29:37,499 INFO L249 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2019-12-07 12:29:37,515 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:29:37,516 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 12:29:37,516 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:29:37,516 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:29:37,516 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:29:37,516 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:29:37,516 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:29:37,516 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:29:37,529 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2019-12-07 12:29:37,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 12:29:37,534 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:37,535 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 12:29:37,535 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 12:29:37,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:37,539 INFO L82 PathProgramCache]: Analyzing trace with hash 925702, now seen corresponding path program 1 times [2019-12-07 12:29:37,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:29:37,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1704607264] [2019-12-07 12:29:37,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:29:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:37,590 INFO L264 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:29:37,593 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:29:37,630 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 12:29:37,630 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:37,635 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:37,636 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:29:37,636 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 12:29:37,642 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 12:29:37,642 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:29:37,646 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 12:29:37,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1704607264] [2019-12-07 12:29:37,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:29:37,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 12:29:37,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579814318] [2019-12-07 12:29:37,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:29:37,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:29:37,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:29:37,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:29:37,662 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 3 states. [2019-12-07 12:29:37,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:37,811 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2019-12-07 12:29:37,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:29:37,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 12:29:37,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:37,820 INFO L225 Difference]: With dead ends: 91 [2019-12-07 12:29:37,820 INFO L226 Difference]: Without dead ends: 87 [2019-12-07 12:29:37,821 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 12:29:37,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-07 12:29:37,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 70. [2019-12-07 12:29:37,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-07 12:29:37,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2019-12-07 12:29:37,850 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 4 [2019-12-07 12:29:37,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:37,850 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2019-12-07 12:29:37,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:29:37,850 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2019-12-07 12:29:37,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 12:29:37,851 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:37,851 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 12:29:38,051 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 12:29:38,052 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 12:29:38,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:38,053 INFO L82 PathProgramCache]: Analyzing trace with hash 925703, now seen corresponding path program 1 times [2019-12-07 12:29:38,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:29:38,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1532167536] [2019-12-07 12:29:38,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:29:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:38,110 INFO L264 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 12:29:38,111 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:29:38,119 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 12:29:38,120 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:38,126 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:38,126 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:29:38,127 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 12:29:38,134 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 12:29:38,134 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:29:38,172 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 12:29:38,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1532167536] [2019-12-07 12:29:38,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:29:38,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 12:29:38,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666042273] [2019-12-07 12:29:38,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:29:38,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:29:38,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:29:38,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:29:38,174 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 4 states. [2019-12-07 12:29:38,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:38,317 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2019-12-07 12:29:38,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:29:38,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-12-07 12:29:38,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:38,320 INFO L225 Difference]: With dead ends: 66 [2019-12-07 12:29:38,320 INFO L226 Difference]: Without dead ends: 66 [2019-12-07 12:29:38,320 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 12:29:38,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-12-07 12:29:38,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-12-07 12:29:38,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 12:29:38,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2019-12-07 12:29:38,327 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 4 [2019-12-07 12:29:38,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:38,328 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2019-12-07 12:29:38,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:29:38,328 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2019-12-07 12:29:38,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 12:29:38,328 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:38,328 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:29:38,529 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 12:29:38,529 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 12:29:38,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:38,530 INFO L82 PathProgramCache]: Analyzing trace with hash 613337907, now seen corresponding path program 1 times [2019-12-07 12:29:38,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:29:38,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2083395525] [2019-12-07 12:29:38,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:29:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:38,588 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:29:38,589 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:29:38,599 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 12:29:38,600 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:29:38,608 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 12:29:38,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2083395525] [2019-12-07 12:29:38,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:29:38,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 12:29:38,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686769648] [2019-12-07 12:29:38,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:29:38,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:29:38,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:29:38,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:29:38,610 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 4 states. [2019-12-07 12:29:38,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:38,627 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-12-07 12:29:38,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:29:38,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 12:29:38,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:38,629 INFO L225 Difference]: With dead ends: 79 [2019-12-07 12:29:38,629 INFO L226 Difference]: Without dead ends: 79 [2019-12-07 12:29:38,629 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 12:29:38,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-12-07 12:29:38,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2019-12-07 12:29:38,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-12-07 12:29:38,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2019-12-07 12:29:38,635 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 10 [2019-12-07 12:29:38,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:38,635 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2019-12-07 12:29:38,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:29:38,635 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2019-12-07 12:29:38,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 12:29:38,636 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:38,636 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:29:38,836 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 12:29:38,837 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 12:29:38,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:38,837 INFO L82 PathProgramCache]: Analyzing trace with hash 613339348, now seen corresponding path program 1 times [2019-12-07 12:29:38,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:29:38,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [667359022] [2019-12-07 12:29:38,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:29:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:38,914 INFO L264 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:29:38,915 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:29:38,919 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 12:29:38,919 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:38,921 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:38,921 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:29:38,921 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 12:29:38,924 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 12:29:38,925 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:29:38,927 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 12:29:38,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [667359022] [2019-12-07 12:29:38,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:29:38,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 12:29:38,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444385234] [2019-12-07 12:29:38,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:29:38,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:29:38,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:29:38,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:29:38,929 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand 3 states. [2019-12-07 12:29:39,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:39,047 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2019-12-07 12:29:39,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:29:39,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-07 12:29:39,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:39,048 INFO L225 Difference]: With dead ends: 88 [2019-12-07 12:29:39,048 INFO L226 Difference]: Without dead ends: 88 [2019-12-07 12:29:39,048 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 12:29:39,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-12-07 12:29:39,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 71. [2019-12-07 12:29:39,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-07 12:29:39,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2019-12-07 12:29:39,053 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 10 [2019-12-07 12:29:39,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:39,053 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2019-12-07 12:29:39,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:29:39,053 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2019-12-07 12:29:39,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 12:29:39,053 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:39,054 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:29:39,254 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 12:29:39,255 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 12:29:39,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:39,256 INFO L82 PathProgramCache]: Analyzing trace with hash 613339349, now seen corresponding path program 1 times [2019-12-07 12:29:39,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:29:39,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [727961732] [2019-12-07 12:29:39,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:29:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:39,329 INFO L264 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 12:29:39,330 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:29:39,335 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 12:29:39,335 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:39,340 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:39,340 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:29:39,340 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 12:29:39,347 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 12:29:39,347 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:29:39,383 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 12:29:39,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [727961732] [2019-12-07 12:29:39,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:29:39,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 12:29:39,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914632309] [2019-12-07 12:29:39,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:29:39,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:29:39,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:29:39,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:29:39,385 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand 4 states. [2019-12-07 12:29:39,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:39,527 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2019-12-07 12:29:39,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:29:39,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 12:29:39,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:39,528 INFO L225 Difference]: With dead ends: 69 [2019-12-07 12:29:39,528 INFO L226 Difference]: Without dead ends: 69 [2019-12-07 12:29:39,529 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 12:29:39,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-07 12:29:39,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-12-07 12:29:39,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-12-07 12:29:39,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2019-12-07 12:29:39,534 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 10 [2019-12-07 12:29:39,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:39,534 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2019-12-07 12:29:39,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:29:39,535 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2019-12-07 12:29:39,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 12:29:39,535 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:39,535 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:29:39,736 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 12:29:39,736 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 12:29:39,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:39,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1008594167, now seen corresponding path program 1 times [2019-12-07 12:29:39,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:29:39,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591257086] [2019-12-07 12:29:39,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:29:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:39,826 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 12:29:39,827 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:29:39,830 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 12:29:39,830 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:39,832 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:39,832 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:29:39,832 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 12:29:39,858 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:39,858 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 12:29:39,859 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:39,872 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 12:29:39,872 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 12:29:39,872 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-12-07 12:29:39,880 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 12:29:39,880 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:29:39,894 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 12:29:39,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [591257086] [2019-12-07 12:29:39,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:29:39,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 12:29:39,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293970204] [2019-12-07 12:29:39,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:29:39,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:29:39,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:29:39,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:29:39,896 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 4 states. [2019-12-07 12:29:40,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:40,066 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2019-12-07 12:29:40,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:29:40,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 12:29:40,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:40,067 INFO L225 Difference]: With dead ends: 87 [2019-12-07 12:29:40,067 INFO L226 Difference]: Without dead ends: 87 [2019-12-07 12:29:40,067 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 12:29:40,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-07 12:29:40,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 69. [2019-12-07 12:29:40,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-12-07 12:29:40,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-12-07 12:29:40,071 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2019-12-07 12:29:40,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:40,071 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-12-07 12:29:40,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:29:40,071 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-12-07 12:29:40,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 12:29:40,072 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:40,072 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:29:40,272 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 12:29:40,273 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 12:29:40,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:40,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1008594168, now seen corresponding path program 1 times [2019-12-07 12:29:40,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:29:40,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [563176140] [2019-12-07 12:29:40,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:29:40,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:40,360 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 12:29:40,361 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:29:40,366 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 12:29:40,366 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:40,372 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:40,374 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 12:29:40,374 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:40,379 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:40,379 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:29:40,379 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 12:29:40,422 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:40,422 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 12:29:40,423 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:40,431 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:40,434 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 12:29:40,435 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:40,443 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:40,443 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 12:29:40,443 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:18 [2019-12-07 12:29:40,465 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 12:29:40,465 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:29:40,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:29:40,653 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 12:29:40,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [563176140] [2019-12-07 12:29:40,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:29:40,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 12:29:40,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557718776] [2019-12-07 12:29:40,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:29:40,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:29:40,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:29:40,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:29:40,655 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 8 states. [2019-12-07 12:29:41,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:41,655 INFO L93 Difference]: Finished difference Result 107 states and 110 transitions. [2019-12-07 12:29:41,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 12:29:41,656 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-12-07 12:29:41,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:41,656 INFO L225 Difference]: With dead ends: 107 [2019-12-07 12:29:41,656 INFO L226 Difference]: Without dead ends: 107 [2019-12-07 12:29:41,657 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 12:29:41,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-12-07 12:29:41,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 69. [2019-12-07 12:29:41,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-12-07 12:29:41,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2019-12-07 12:29:41,660 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 12 [2019-12-07 12:29:41,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:41,660 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2019-12-07 12:29:41,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:29:41,661 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2019-12-07 12:29:41,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 12:29:41,661 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:41,661 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:29:41,861 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 12:29:41,862 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 12:29:41,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:41,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1419674411, now seen corresponding path program 1 times [2019-12-07 12:29:41,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:29:41,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [531606990] [2019-12-07 12:29:41,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:29:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:41,963 INFO L264 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 12:29:41,964 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:29:41,968 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 12:29:41,968 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:41,970 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:41,970 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:29:41,970 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 12:29:41,988 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:41,989 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 12:29:41,989 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:42,000 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 12:29:42,001 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 12:29:42,001 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-12-07 12:29:42,006 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 12:29:42,006 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:29:42,017 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 12:29:42,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [531606990] [2019-12-07 12:29:42,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1611677140] [2019-12-07 12:29:42,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:29:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:42,153 INFO L264 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 12:29:42,154 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:29:42,173 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:42,173 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 12:29:42,174 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:42,184 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 12:29:42,185 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 12:29:42,185 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-12-07 12:29:42,199 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:42,199 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 12:29:42,200 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:42,210 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 12:29:42,211 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 12:29:42,211 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-12-07 12:29:42,216 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 12:29:42,216 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:29:42,226 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 12:29:42,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981903215] [2019-12-07 12:29:42,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:29:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:42,294 INFO L264 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 12:29:42,295 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:29:42,312 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:42,312 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 12:29:42,313 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:42,327 INFO L614 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-12-07 12:29:42,327 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 12:29:42,328 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2019-12-07 12:29:42,342 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 12:29:42,342 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:29:42,371 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 12:29:42,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 12:29:42,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 4, 3, 4, 4] total 7 [2019-12-07 12:29:42,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846756000] [2019-12-07 12:29:42,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:29:42,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:29:42,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:29:42,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:29:42,373 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 8 states. [2019-12-07 12:29:42,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:42,624 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2019-12-07 12:29:42,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:29:42,624 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-12-07 12:29:42,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:42,625 INFO L225 Difference]: With dead ends: 92 [2019-12-07 12:29:42,625 INFO L226 Difference]: Without dead ends: 92 [2019-12-07 12:29:42,625 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 12:29:42,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-12-07 12:29:42,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 67. [2019-12-07 12:29:42,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-12-07 12:29:42,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2019-12-07 12:29:42,629 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 18 [2019-12-07 12:29:42,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:42,629 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2019-12-07 12:29:42,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:29:42,629 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2019-12-07 12:29:42,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 12:29:42,629 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:42,630 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:29:43,231 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 12:29:43,231 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 12:29:43,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:43,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1419674412, now seen corresponding path program 1 times [2019-12-07 12:29:43,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:29:43,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889144101] [2019-12-07 12:29:43,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:29:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:43,339 INFO L264 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 12:29:43,341 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:29:43,347 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 12:29:43,347 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:43,353 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:43,356 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 12:29:43,356 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:43,362 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:43,362 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:29:43,362 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 12:29:43,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:29:43,383 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 12:29:43,384 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:43,392 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:43,399 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:43,400 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 12:29:43,400 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:43,407 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:43,407 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 12:29:43,407 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:18 [2019-12-07 12:29:43,424 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 12:29:43,424 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:29:43,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:29:43,592 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 12:29:43,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1889144101] [2019-12-07 12:29:43,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2007164144] [2019-12-07 12:29:43,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:29:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:43,741 INFO L264 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 12:29:43,742 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:29:43,747 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 12:29:43,748 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:43,754 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:43,756 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 12:29:43,757 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:43,762 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:43,762 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:29:43,762 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 12:29:43,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:29:43,770 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 12:29:43,770 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:43,778 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:43,785 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:43,785 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 12:29:43,785 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:43,792 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:43,793 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 12:29:43,793 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:18 [2019-12-07 12:29:43,796 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 12:29:43,796 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:29:43,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:29:43,880 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 12:29:43,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499993947] [2019-12-07 12:29:43,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:29:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:43,930 INFO L264 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 12:29:43,931 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:29:43,934 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 12:29:43,935 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:43,938 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:43,938 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:29:43,939 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 12:29:43,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:29:43,966 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 12:29:43,966 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:43,974 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:43,980 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:43,980 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 12:29:43,981 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:43,988 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:43,988 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 12:29:43,988 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:18 [2019-12-07 12:29:43,991 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 12:29:43,991 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:29:43,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:29:44,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:29:44,090 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:44,090 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 12:29:44,091 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:44,106 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:44,106 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 12:29:44,106 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:44,131 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:44,131 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 12:29:44,131 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:22 [2019-12-07 12:29:44,197 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 12:29:44,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 12:29:44,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 5, 5] total 9 [2019-12-07 12:29:44,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536424890] [2019-12-07 12:29:44,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 12:29:44,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:29:44,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 12:29:44,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:29:44,199 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 10 states. [2019-12-07 12:29:44,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:44,696 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2019-12-07 12:29:44,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:29:44,696 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-12-07 12:29:44,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:44,697 INFO L225 Difference]: With dead ends: 82 [2019-12-07 12:29:44,697 INFO L226 Difference]: Without dead ends: 82 [2019-12-07 12:29:44,697 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 12:29:44,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-12-07 12:29:44,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 65. [2019-12-07 12:29:44,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-07 12:29:44,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2019-12-07 12:29:44,700 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 18 [2019-12-07 12:29:44,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:44,700 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2019-12-07 12:29:44,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 12:29:44,700 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2019-12-07 12:29:44,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 12:29:44,700 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:44,700 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 12:29:45,301 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 12:29:45,302 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 12:29:45,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:45,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1641358142, now seen corresponding path program 1 times [2019-12-07 12:29:45,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:29:45,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256743714] [2019-12-07 12:29:45,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:29:45,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:45,409 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 12:29:45,411 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:29:45,424 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 12:29:45,424 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:29:45,455 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 12:29:45,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [256743714] [2019-12-07 12:29:45,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1781868842] [2019-12-07 12:29:45,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:29:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:45,587 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 12:29:45,588 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:29:45,594 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 12:29:45,594 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:29:45,597 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 12:29:45,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923447081] [2019-12-07 12:29:45,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:29:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:45,653 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 12:29:45,655 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:29:45,696 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 12:29:45,696 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:29:45,709 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 12:29:45,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 4 imperfect interpolant sequences. [2019-12-07 12:29:45,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5, 5, 5, 5] total 12 [2019-12-07 12:29:45,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179699428] [2019-12-07 12:29:45,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:29:45,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:29:45,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:29:45,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:29:45,710 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 6 states. [2019-12-07 12:29:46,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:46,049 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2019-12-07 12:29:46,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:29:46,049 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 12:29:46,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:46,050 INFO L225 Difference]: With dead ends: 78 [2019-12-07 12:29:46,050 INFO L226 Difference]: Without dead ends: 78 [2019-12-07 12:29:46,050 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 12:29:46,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-07 12:29:46,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 62. [2019-12-07 12:29:46,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 12:29:46,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-12-07 12:29:46,053 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 25 [2019-12-07 12:29:46,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:46,053 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-12-07 12:29:46,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:29:46,054 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-12-07 12:29:46,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 12:29:46,054 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:46,054 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 12:29:46,655 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 12:29:46,657 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 12:29:46,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:46,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1641358141, now seen corresponding path program 1 times [2019-12-07 12:29:46,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:29:46,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [678385798] [2019-12-07 12:29:46,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:29:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:46,745 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 12:29:46,746 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:29:46,759 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 12:29:46,759 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:29:46,791 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 12:29:46,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [678385798] [2019-12-07 12:29:46,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [456922176] [2019-12-07 12:29:46,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:29:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:46,916 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 12:29:46,917 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:29:46,924 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 12:29:46,925 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:29:46,933 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 12:29:46,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181135441] [2019-12-07 12:29:46,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:29:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:46,983 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 12:29:46,984 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:29:46,987 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 12:29:46,988 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:46,991 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:46,991 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:29:46,991 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 12:29:47,045 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 12:29:47,045 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:29:47,308 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 12:29:47,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 4 imperfect interpolant sequences. [2019-12-07 12:29:47,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5, 5, 5, 5] total 16 [2019-12-07 12:29:47,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133303093] [2019-12-07 12:29:47,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 12:29:47,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:29:47,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 12:29:47,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-07 12:29:47,309 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 10 states. [2019-12-07 12:29:47,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:47,959 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-12-07 12:29:47,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:29:47,959 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-12-07 12:29:47,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:47,960 INFO L225 Difference]: With dead ends: 67 [2019-12-07 12:29:47,960 INFO L226 Difference]: Without dead ends: 67 [2019-12-07 12:29:47,960 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-12-07 12:29:47,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-12-07 12:29:47,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2019-12-07 12:29:47,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 12:29:47,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-12-07 12:29:47,962 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 25 [2019-12-07 12:29:47,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:47,962 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-12-07 12:29:47,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 12:29:47,963 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-12-07 12:29:47,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 12:29:47,963 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:47,963 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] [2019-12-07 12:29:48,564 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 12:29:48,565 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 12:29:48,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:48,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1092175619, now seen corresponding path program 1 times [2019-12-07 12:29:48,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:29:48,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1555759134] [2019-12-07 12:29:48,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:29:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:48,648 INFO L264 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 12:29:48,649 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:29:48,660 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 12:29:48,660 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:29:48,689 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 12:29:48,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1555759134] [2019-12-07 12:29:48,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [43887402] [2019-12-07 12:29:48,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:29:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:48,813 INFO L264 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 12:29:48,814 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:29:48,824 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 12:29:48,824 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:29:48,827 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 12:29:48,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363872556] [2019-12-07 12:29:48,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:29:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:29:48,882 INFO L264 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 12:29:48,883 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:29:48,889 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 12:29:48,889 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:29:48,937 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 12:29:48,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 12:29:48,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 6] total 10 [2019-12-07 12:29:48,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069815762] [2019-12-07 12:29:48,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 12:29:48,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:29:48,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 12:29:48,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:29:48,938 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 10 states. [2019-12-07 12:29:49,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:29:49,068 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2019-12-07 12:29:49,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 12:29:49,068 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-12-07 12:29:49,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:29:49,069 INFO L225 Difference]: With dead ends: 88 [2019-12-07 12:29:49,069 INFO L226 Difference]: Without dead ends: 88 [2019-12-07 12:29:49,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 145 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 12:29:49,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-12-07 12:29:49,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-12-07 12:29:49,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-12-07 12:29:49,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2019-12-07 12:29:49,073 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 27 [2019-12-07 12:29:49,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:29:49,073 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2019-12-07 12:29:49,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 12:29:49,073 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2019-12-07 12:29:49,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 12:29:49,074 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:29:49,074 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] [2019-12-07 12:29:49,675 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 12:29:49,676 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 12:29:49,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:29:49,677 INFO L82 PathProgramCache]: Analyzing trace with hash -972323179, now seen corresponding path program 2 times [2019-12-07 12:29:49,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:29:49,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1594900189] [2019-12-07 12:29:49,678 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:29:49,934 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 12:29:49,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:29:49,958 INFO L264 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 12:29:49,959 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:29:50,004 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:50,004 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 12:29:50,004 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:50,023 INFO L614 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-12-07 12:29:50,023 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 12:29:50,024 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:21 [2019-12-07 12:29:50,077 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:50,077 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 12:29:50,078 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:50,108 INFO L614 ElimStorePlain]: treesize reduction 28, result has 48.1 percent of original size [2019-12-07 12:29:50,109 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 12:29:50,109 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:26 [2019-12-07 12:29:50,178 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:50,179 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 12:29:50,179 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:50,195 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:50,196 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 12:29:50,196 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 [2019-12-07 12:29:50,217 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 12:29:50,217 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:50,226 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:50,226 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:29:50,227 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-12-07 12:29:50,251 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 12:29:50,251 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:50,260 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:50,261 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 12:29:50,261 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:18 [2019-12-07 12:29:50,300 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 12:29:50,300 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:50,307 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:50,307 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 12:29:50,307 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:14 [2019-12-07 12:29:50,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:29:50,329 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 12:29:50,329 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:50,334 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:50,334 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:29:50,335 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 12:29:50,375 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 12:29:50,376 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:50,379 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:50,379 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 12:29:50,379 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-12-07 12:29:50,401 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 12:29:50,401 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:29:50,503 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 12:29:50,505 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:50,505 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 12:29:50,506 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:12 [2019-12-07 12:29:50,529 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 12:29:50,532 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:50,532 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 12:29:50,532 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2019-12-07 12:29:50,702 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 12:29:50,707 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:50,707 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 12:29:50,708 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:37 [2019-12-07 12:29:50,851 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:51,088 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 33 [2019-12-07 12:29:51,088 INFO L614 ElimStorePlain]: treesize reduction 125, result has 29.8 percent of original size [2019-12-07 12:29:51,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:29:51,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:29:51,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:29:51,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:29:51,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:29:51,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:29:51,091 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 12:29:51,091 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:69, output treesize:52 [2019-12-07 12:29:51,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:29:51,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:29:51,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:29:51,724 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:51,724 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 12:29:51,724 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:51,739 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:51,740 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 12:29:51,740 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:51,764 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:51,765 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 12:29:51,765 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:54, output treesize:7 [2019-12-07 12:29:51,823 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 12:29:51,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1594900189] [2019-12-07 12:29:51,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1414580969] [2019-12-07 12:29:51,823 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:29:52,108 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 12:29:52,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:29:52,112 INFO L264 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 12:29:52,113 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:29:52,148 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 12:29:52,148 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:52,154 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:52,155 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:29:52,155 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-12-07 12:29:52,241 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:52,241 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 12:29:52,241 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:52,250 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:52,250 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:29:52,251 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:17 [2019-12-07 12:29:52,321 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 12:29:52,321 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:52,330 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:52,331 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:29:52,331 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-12-07 12:29:52,384 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 12:29:52,385 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:52,394 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:52,394 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 12:29:52,395 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:17 [2019-12-07 12:29:52,487 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 12:29:52,488 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:52,493 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:52,494 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 12:29:52,494 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:14 [2019-12-07 12:29:52,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:29:52,498 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 12:29:52,498 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:52,504 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:52,504 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:29:52,504 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 12:29:52,507 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 12:29:52,508 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:52,511 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:52,511 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 12:29:52,511 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-12-07 12:29:52,517 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 12:29:52,517 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:29:52,521 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 12:29:52,523 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:52,524 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 12:29:52,524 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:12 [2019-12-07 12:29:52,550 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 12:29:52,554 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:52,554 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 12:29:52,554 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2019-12-07 12:29:52,799 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 12:29:52,805 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:52,805 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 12:29:52,805 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:37 [2019-12-07 12:29:53,020 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:53,239 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 33 [2019-12-07 12:29:53,240 INFO L614 ElimStorePlain]: treesize reduction 125, result has 29.8 percent of original size [2019-12-07 12:29:53,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:29:53,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:29:53,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:29:53,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:29:53,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:29:53,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:29:53,242 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 12:29:53,242 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:69, output treesize:58 [2019-12-07 12:29:53,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:29:53,576 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 12:29:53,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50077861] [2019-12-07 12:29:53,577 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:29:54,915 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 12:29:54,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 12:29:54,922 INFO L264 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 31 conjunts are in the unsatisfiable core [2019-12-07 12:29:54,923 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:29:55,063 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:55,063 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 12:29:55,063 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:55,081 INFO L614 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2019-12-07 12:29:55,081 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:29:55,081 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2019-12-07 12:29:55,189 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:55,189 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 12:29:55,189 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:55,195 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:55,195 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:29:55,195 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-12-07 12:29:55,356 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:55,356 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 12:29:55,357 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:55,366 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:55,366 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:29:55,366 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:18 [2019-12-07 12:29:55,434 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 12:29:55,434 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:55,444 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:55,445 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:29:55,445 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-12-07 12:29:55,521 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 12:29:55,522 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:55,532 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:55,533 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 12:29:55,533 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:14 [2019-12-07 12:29:55,685 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-12-07 12:29:55,685 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:55,690 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:55,690 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 12:29:55,690 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2019-12-07 12:29:55,765 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:29:55,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, 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 12:29:55,766 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:55,770 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:55,770 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:29:55,770 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:11 [2019-12-07 12:29:55,886 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 12:29:55,886 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:55,888 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:55,888 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 12:29:55,888 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-12-07 12:29:55,892 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 12:29:55,892 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:29:55,894 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 12:29:55,896 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:55,897 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 12:29:55,897 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:12 [2019-12-07 12:29:55,922 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 12:29:55,926 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:55,926 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 12:29:55,926 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:17 [2019-12-07 12:29:56,186 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 12:29:56,191 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:56,191 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 12:29:56,192 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:37 [2019-12-07 12:29:58,562 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:58,630 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:58,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:29:58,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:29:58,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:29:58,631 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-12-07 12:29:58,631 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:69, output treesize:42 [2019-12-07 12:29:58,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:29:58,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:29:58,957 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:58,957 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 12:29:58,958 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:58,964 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:58,964 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 12:29:58,964 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:58,967 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 12:29:58,967 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:58,979 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:58,979 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-12-07 12:29:58,979 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:12 [2019-12-07 12:29:59,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:29:59,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:29:59,614 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:59,614 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 12:29:59,614 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:59,620 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:59,620 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 12:29:59,621 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:29:59,634 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:29:59,634 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-12-07 12:29:59,634 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:8 [2019-12-07 12:29:59,640 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 12:29:59,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 12:29:59,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 13, 13, 17, 16] total 67 [2019-12-07 12:29:59,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742695435] [2019-12-07 12:29:59,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-12-07 12:29:59,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:29:59,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-12-07 12:29:59,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=4071, Unknown=1, NotChecked=0, Total=4422 [2019-12-07 12:29:59,643 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 67 states. [2019-12-07 12:30:02,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:30:02,177 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2019-12-07 12:30:02,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 12:30:02,178 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 39 [2019-12-07 12:30:02,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:30:02,178 INFO L225 Difference]: With dead ends: 103 [2019-12-07 12:30:02,178 INFO L226 Difference]: Without dead ends: 103 [2019-12-07 12:30:02,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 153 SyntacticMatches, 10 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2631 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=837, Invalid=5324, Unknown=1, NotChecked=0, Total=6162 [2019-12-07 12:30:02,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-12-07 12:30:02,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 88. [2019-12-07 12:30:02,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-12-07 12:30:02,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2019-12-07 12:30:02,182 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 39 [2019-12-07 12:30:02,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:30:02,182 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2019-12-07 12:30:02,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-12-07 12:30:02,182 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2019-12-07 12:30:02,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 12:30:02,183 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:30:02,183 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 12:30:02,784 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 12:30:02,785 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 12:30:02,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:30:02,786 INFO L82 PathProgramCache]: Analyzing trace with hash 829720554, now seen corresponding path program 1 times [2019-12-07 12:30:02,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:30:02,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2013473394] [2019-12-07 12:30:02,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:30:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:30:03,056 INFO L264 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-07 12:30:03,057 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:30:03,063 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 12:30:03,063 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:03,066 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:03,066 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:03,066 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 12:30:03,092 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:03,092 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 12:30:03,093 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:03,113 INFO L614 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-12-07 12:30:03,113 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:03,113 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-12-07 12:30:03,128 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 12:30:03,129 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:03,139 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:03,139 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:03,140 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-12-07 12:30:03,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:03,164 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 12:30:03,164 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:03,175 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:03,176 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:03,176 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:32 [2019-12-07 12:30:03,206 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:03,206 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 49 treesize of output 67 [2019-12-07 12:30:03,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:30:03,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:03,207 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 12:30:03,265 INFO L614 ElimStorePlain]: treesize reduction 47, result has 50.5 percent of original size [2019-12-07 12:30:03,266 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 12:30:03,266 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:48 [2019-12-07 12:30:03,338 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:30:03,399 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:03,399 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 12:30:03,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:03,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:03,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:30:03,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:03,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:03,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:30:03,402 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 12:30:03,462 INFO L614 ElimStorePlain]: treesize reduction 44, result has 52.7 percent of original size [2019-12-07 12:30:03,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:03,464 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 12:30:03,464 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:49 [2019-12-07 12:30:03,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:03,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:03,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:03,531 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 12:30:03,531 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:03,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:03,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:03,541 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:30:03,620 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:03,620 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 57 treesize of output 125 [2019-12-07 12:30:03,621 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:03,727 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-12-07 12:30:03,727 INFO L614 ElimStorePlain]: treesize reduction 66, result has 62.7 percent of original size [2019-12-07 12:30:03,728 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 12:30:03,728 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:108 [2019-12-07 12:30:04,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:04,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:04,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:04,063 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 12:30:04,063 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:04,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:04,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:04,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:04,076 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:30:12,292 WARN L192 SmtUtils]: Spent 8.22 s on a formula simplification that was a NOOP. DAG size: 47 [2019-12-07 12:30:12,293 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:12,293 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 12:30:12,294 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:12,434 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-12-07 12:30:12,434 INFO L614 ElimStorePlain]: treesize reduction 100, result has 51.5 percent of original size [2019-12-07 12:30:12,435 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 12:30:12,435 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:138, output treesize:106 [2019-12-07 12:30:12,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:12,502 INFO L430 ElimStorePlain]: Different costs {4=[v_prenex_18], 7=[|#memory_$Pointer$.base|]} [2019-12-07 12:30:12,521 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:12,521 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 75 treesize of output 52 [2019-12-07 12:30:12,522 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:12,549 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:12,583 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:12,583 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 12:30:12,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:30:12,584 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:12,595 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:12,596 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 12:30:12,596 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:137, output treesize:35 [2019-12-07 12:30:12,700 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 12:30:12,700 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:30:12,819 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 12:30:12,821 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:12,822 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 12:30:12,822 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:14 [2019-12-07 12:30:13,290 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 12:30:13,312 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:13,312 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 12:30:13,313 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:66, output treesize:82 [2019-12-07 12:30:13,449 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:13,515 INFO L614 ElimStorePlain]: treesize reduction 80, result has 24.5 percent of original size [2019-12-07 12:30:13,515 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 12:30:13,515 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:90, output treesize:22 [2019-12-07 12:30:13,566 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 12:30:13,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2013473394] [2019-12-07 12:30:13,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [91989808] [2019-12-07 12:30:13,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:30:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:30:13,855 INFO L264 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-07 12:30:13,856 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:30:13,859 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 12:30:13,859 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:13,861 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:13,861 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:13,861 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-12-07 12:30:13,864 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 12:30:13,864 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:13,868 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:13,869 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:13,869 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 12:30:13,884 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:13,885 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 12:30:13,885 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:13,905 INFO L614 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-12-07 12:30:13,905 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:13,905 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-12-07 12:30:13,909 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 12:30:13,909 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:13,920 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:13,920 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:13,920 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-12-07 12:30:13,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:13,925 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 12:30:13,925 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:13,936 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:13,936 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:13,937 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:32 [2019-12-07 12:30:13,965 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:13,965 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 49 treesize of output 67 [2019-12-07 12:30:13,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:30:13,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:13,966 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 12:30:14,013 INFO L614 ElimStorePlain]: treesize reduction 47, result has 50.5 percent of original size [2019-12-07 12:30:14,013 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 12:30:14,013 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:48 [2019-12-07 12:30:14,037 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:30:14,108 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:14,108 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 12:30:14,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:30:14,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:14,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:14,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:14,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:14,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:14,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:14,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:30:14,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:14,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:14,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:14,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:14,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:14,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:14,114 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 12:30:14,186 INFO L614 ElimStorePlain]: treesize reduction 44, result has 52.7 percent of original size [2019-12-07 12:30:14,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:14,186 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 12:30:14,187 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:49 [2019-12-07 12:30:14,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:14,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:14,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:14,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 12:30:14,243 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:14,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:14,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:14,256 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:30:14,315 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:14,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 57 treesize of output 125 [2019-12-07 12:30:14,316 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:14,441 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-12-07 12:30:14,441 INFO L614 ElimStorePlain]: treesize reduction 94, result has 54.1 percent of original size [2019-12-07 12:30:14,441 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 12:30:14,442 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:108 [2019-12-07 12:30:14,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:14,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:14,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:14,528 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 12:30:14,529 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:14,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:14,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:14,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:14,545 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:30:22,740 WARN L192 SmtUtils]: Spent 8.19 s on a formula simplification that was a NOOP. DAG size: 47 [2019-12-07 12:30:22,741 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:22,741 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 12:30:22,743 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:22,880 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-12-07 12:30:22,881 INFO L614 ElimStorePlain]: treesize reduction 100, result has 51.5 percent of original size [2019-12-07 12:30:22,881 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 12:30:22,881 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:138, output treesize:106 [2019-12-07 12:30:22,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:22,949 INFO L430 ElimStorePlain]: Different costs {4=[v_prenex_21], 7=[|#memory_$Pointer$.base|]} [2019-12-07 12:30:22,975 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:22,975 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 12:30:22,976 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:23,004 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:23,039 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:23,040 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 12:30:23,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:30:23,040 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:23,053 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:23,054 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 12:30:23,054 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:135, output treesize:35 [2019-12-07 12:30:23,063 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 12:30:23,063 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:30:23,069 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 12:30:23,071 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:23,072 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 12:30:23,072 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:14 [2019-12-07 12:30:23,513 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 12:30:23,533 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:23,534 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 12:30:23,534 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:66, output treesize:84 [2019-12-07 12:30:23,716 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:23,780 INFO L614 ElimStorePlain]: treesize reduction 80, result has 24.5 percent of original size [2019-12-07 12:30:23,780 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 12:30:23,780 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:90, output treesize:26 [2019-12-07 12:30:23,847 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 12:30:23,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716591345] [2019-12-07 12:30:23,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:30:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:30:23,916 INFO L264 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 12:30:23,917 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:30:23,924 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:23,924 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 12:30:23,924 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:23,929 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:23,929 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:23,929 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2019-12-07 12:30:23,981 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 12:30:23,981 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:23,991 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:23,991 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:23,991 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-12-07 12:30:24,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:24,058 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 12:30:24,058 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:24,068 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:24,068 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:24,068 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:25 [2019-12-07 12:30:24,095 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:24,095 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 49 treesize of output 67 [2019-12-07 12:30:24,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:24,096 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:24,110 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:24,110 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 12:30:24,110 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:48 [2019-12-07 12:30:24,136 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:30:24,202 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:24,202 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 12:30:24,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:30:24,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:24,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:24,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:24,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:24,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:24,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:24,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:30:24,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:24,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:24,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:24,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:24,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:24,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:24,207 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 12:30:24,271 INFO L614 ElimStorePlain]: treesize reduction 44, result has 53.7 percent of original size [2019-12-07 12:30:24,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:24,272 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 12:30:24,272 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:51 [2019-12-07 12:30:24,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:24,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:24,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:24,325 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 12:30:24,326 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:24,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:24,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:24,336 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:30:24,409 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:24,409 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 57 treesize of output 125 [2019-12-07 12:30:24,410 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:24,526 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-12-07 12:30:24,527 INFO L614 ElimStorePlain]: treesize reduction 94, result has 54.1 percent of original size [2019-12-07 12:30:24,527 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 12:30:24,527 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:108 [2019-12-07 12:30:24,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:24,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:24,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:24,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:24,641 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:30:32,852 WARN L192 SmtUtils]: Spent 8.21 s on a formula simplification that was a NOOP. DAG size: 47 [2019-12-07 12:30:32,853 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:32,853 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 12:30:32,854 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:32,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:32,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:32,866 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 12:30:32,866 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:32,982 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-12-07 12:30:32,982 INFO L614 ElimStorePlain]: treesize reduction 100, result has 51.5 percent of original size [2019-12-07 12:30:32,983 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 12:30:32,983 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:138, output treesize:106 [2019-12-07 12:30:33,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:33,042 INFO L430 ElimStorePlain]: Different costs {4=[v_prenex_24], 7=[|#memory_$Pointer$.base|]} [2019-12-07 12:30:33,061 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:33,061 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 12:30:33,061 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:33,089 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:33,122 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:33,122 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 12:30:33,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:30:33,123 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:33,135 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:33,135 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 12:30:33,135 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:135, output treesize:35 [2019-12-07 12:30:33,187 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 12:30:33,187 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:30:33,191 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 12:30:33,193 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:33,193 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 12:30:33,194 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:16 [2019-12-07 12:30:33,284 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 12:30:33,311 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:33,312 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 12:30:33,312 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:66, output treesize:84 [2019-12-07 12:30:33,555 INFO L343 Elim1Store]: treesize reduction 8, result has 95.5 percent of original size [2019-12-07 12:30:33,555 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 12:30:33,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:33,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:33,556 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:33,562 INFO L614 ElimStorePlain]: treesize reduction 158, result has 0.6 percent of original size [2019-12-07 12:30:33,562 INFO L502 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2019-12-07 12:30:33,563 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 12:30:33,563 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:96, output treesize:1 [2019-12-07 12:30:33,566 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 12:30:33,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 12:30:33,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 14, 10, 14, 9] total 29 [2019-12-07 12:30:33,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015988425] [2019-12-07 12:30:33,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 12:30:33,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:30:33,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 12:30:33,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2019-12-07 12:30:33,567 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 30 states. [2019-12-07 12:30:35,739 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-12-07 12:30:36,569 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2019-12-07 12:30:37,217 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-12-07 12:30:37,703 WARN L192 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 91 [2019-12-07 12:30:38,559 WARN L192 SmtUtils]: Spent 708.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 125 [2019-12-07 12:30:39,191 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-07 12:30:39,794 WARN L192 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2019-12-07 12:30:41,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:30:41,606 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2019-12-07 12:30:41,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 12:30:41,607 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 43 [2019-12-07 12:30:41,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:30:41,607 INFO L225 Difference]: With dead ends: 120 [2019-12-07 12:30:41,607 INFO L226 Difference]: Without dead ends: 120 [2019-12-07 12:30:41,608 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 205 SyntacticMatches, 20 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=537, Invalid=2219, Unknown=0, NotChecked=0, Total=2756 [2019-12-07 12:30:41,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-12-07 12:30:41,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 92. [2019-12-07 12:30:41,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-12-07 12:30:41,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2019-12-07 12:30:41,610 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 43 [2019-12-07 12:30:41,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:30:41,610 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2019-12-07 12:30:41,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 12:30:41,610 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2019-12-07 12:30:41,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 12:30:41,611 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:30:41,611 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 12:30:42,212 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 12:30:42,213 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 12:30:42,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:30:42,213 INFO L82 PathProgramCache]: Analyzing trace with hash 829720555, now seen corresponding path program 1 times [2019-12-07 12:30:42,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:30:42,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1901209769] [2019-12-07 12:30:42,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:30:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:30:42,507 INFO L264 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 43 conjunts are in the unsatisfiable core [2019-12-07 12:30:42,508 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:30:42,541 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:42,541 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 12:30:42,542 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:42,559 INFO L614 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-12-07 12:30:42,560 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 12:30:42,560 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2019-12-07 12:30:42,577 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_105|], 3=[|v_#valid_131|]} [2019-12-07 12:30:42,580 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 12:30:42,580 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:42,595 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:42,619 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:42,619 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 12:30:42,620 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:42,658 INFO L614 ElimStorePlain]: treesize reduction 28, result has 52.5 percent of original size [2019-12-07 12:30:42,658 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 12:30:42,658 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:31 [2019-12-07 12:30:42,706 INFO L430 ElimStorePlain]: Different costs {1=[|v_#length_106|], 6=[|v_#valid_132|]} [2019-12-07 12:30:42,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:42,710 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 12:30:42,710 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:42,731 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:42,766 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:42,766 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 12:30:42,766 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:42,785 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:42,785 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 12:30:42,785 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:28 [2019-12-07 12:30:42,815 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 12:30:42,815 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:42,840 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:42,843 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 12:30:42,843 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:42,864 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:42,864 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:42,864 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:48 [2019-12-07 12:30:42,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:42,911 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 12:30:42,911 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:42,944 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:42,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:42,948 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 12:30:42,948 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:42,968 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:42,968 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:42,969 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-07 12:30:42,975 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 12:30:42,975 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:43,002 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:43,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:43,006 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 60 treesize of output 38 [2019-12-07 12:30:43,006 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:43,028 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:43,028 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:43,029 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:96, output treesize:74 [2019-12-07 12:30:43,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:43,159 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 12:30:43,160 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:43,194 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:43,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:43,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:43,199 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:43,199 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 12:30:43,200 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:43,249 INFO L614 ElimStorePlain]: treesize reduction 4, result has 95.6 percent of original size [2019-12-07 12:30:43,249 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:43,249 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:86 [2019-12-07 12:30:43,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:43,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:43,326 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:43,327 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 12:30:43,327 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:43,367 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:43,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:43,373 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:30:43,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:43,374 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:30:43,392 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:43,393 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 12:30:43,393 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:43,451 INFO L614 ElimStorePlain]: treesize reduction 52, result has 65.1 percent of original size [2019-12-07 12:30:43,452 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 12:30:43,452 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:107, output treesize:100 [2019-12-07 12:30:43,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:43,661 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:43,661 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 12:30:43,661 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:43,711 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:43,726 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:43,726 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 12:30:43,727 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:43,774 INFO L614 ElimStorePlain]: treesize reduction 40, result has 68.8 percent of original size [2019-12-07 12:30:43,774 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:43,774 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:88 [2019-12-07 12:30:43,791 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:43,791 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 12:30:43,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:43,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:43,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:43,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:43,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:43,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:43,793 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 12:30:43,834 INFO L614 ElimStorePlain]: treesize reduction 12, result has 82.4 percent of original size [2019-12-07 12:30:43,838 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:43,839 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 12:30:43,839 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:43,848 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:43,848 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 12:30:43,848 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:99, output treesize:20 [2019-12-07 12:30:43,944 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 12:30:43,944 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:30:44,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:44,235 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:44,238 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 12:30:44,273 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:44,276 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 12:30:44,279 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 12:30:44,296 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:44,296 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 12:30:44,296 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:103, output treesize:49 [2019-12-07 12:30:45,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:45,375 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 12:30:45,381 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 12:30:45,611 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-12-07 12:30:45,612 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:45,619 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 12:30:45,640 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:45,829 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-12-07 12:30:45,830 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:45,830 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 12:30:45,830 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:223, output treesize:285 [2019-12-07 12:30:47,420 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:48,501 WARN L192 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-12-07 12:30:48,502 INFO L614 ElimStorePlain]: treesize reduction 31, result has 88.0 percent of original size [2019-12-07 12:30:48,514 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:49,627 WARN L192 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-12-07 12:30:49,628 INFO L614 ElimStorePlain]: treesize reduction 218, result has 54.4 percent of original size [2019-12-07 12:30:49,641 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:50,213 WARN L192 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-12-07 12:30:50,213 INFO L614 ElimStorePlain]: treesize reduction 165, result has 46.1 percent of original size [2019-12-07 12:30:50,214 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 12:30:50,214 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:317, output treesize:141 [2019-12-07 12:30:50,564 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-12-07 12:30:50,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:50,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:50,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:50,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:50,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:50,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:50,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:50,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:50,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:50,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:30:50,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:50,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:50,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:50,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:50,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:50,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:51,239 WARN L192 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2019-12-07 12:30:51,702 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-12-07 12:30:51,713 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:30:51,714 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:51,715 INFO L614 ElimStorePlain]: treesize reduction 23, result has 4.2 percent of original size [2019-12-07 12:30:51,715 INFO L502 ElimStorePlain]: Eliminatee v_prenex_31 vanished before elimination [2019-12-07 12:30:51,716 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 12:30:51,716 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:49, output treesize:1 [2019-12-07 12:30:51,726 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 12:30:51,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1901209769] [2019-12-07 12:30:51,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [915833088] [2019-12-07 12:30:51,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:30:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:30:52,333 INFO L264 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 41 conjunts are in the unsatisfiable core [2019-12-07 12:30:52,334 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:30:52,338 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 12:30:52,338 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:52,345 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:52,347 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 12:30:52,347 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:52,353 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:52,353 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:52,354 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2019-12-07 12:30:52,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:52,522 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 12:30:52,522 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:52,533 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:52,540 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:52,540 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 12:30:52,540 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:52,550 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:52,550 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:52,550 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 [2019-12-07 12:30:52,649 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 12:30:52,649 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:52,673 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:52,677 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 12:30:52,677 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:52,695 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:52,695 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:52,695 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2019-12-07 12:30:52,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:52,817 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 12:30:52,817 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:52,845 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:52,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:52,850 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 12:30:52,850 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:52,866 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:52,866 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:52,866 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:74, output treesize:44 [2019-12-07 12:30:52,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:52,871 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 70 treesize of output 42 [2019-12-07 12:30:52,872 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:52,894 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:52,899 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 12:30:52,899 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:52,920 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:52,920 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:30:52,920 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:92, output treesize:72 [2019-12-07 12:30:53,179 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:30:53,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:53,195 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:53,195 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 12:30:53,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:53,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:53,197 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 12:30:53,284 INFO L614 ElimStorePlain]: treesize reduction 14, result has 85.3 percent of original size [2019-12-07 12:30:53,292 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:30:53,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:53,307 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:53,308 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 12:30:53,308 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:53,381 INFO L614 ElimStorePlain]: treesize reduction 18, result has 81.1 percent of original size [2019-12-07 12:30:53,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:53,381 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 12:30:53,381 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:96, output treesize:77 [2019-12-07 12:30:53,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:53,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:53,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:53,573 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 12:30:53,573 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:53,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:53,584 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:30:53,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:53,595 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:30:53,614 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:53,614 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 12:30:53,615 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:53,840 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-12-07 12:30:53,841 INFO L614 ElimStorePlain]: treesize reduction 57, result has 75.1 percent of original size [2019-12-07 12:30:53,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:53,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:53,872 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:53,872 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 12:30:53,872 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:53,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:53,885 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 12:30:53,886 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:53,967 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:53,967 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 12:30:53,967 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:191, output treesize:167 [2019-12-07 12:30:54,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:54,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:54,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:54,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:54,840 INFO L237 Elim1Store]: Index analysis took 108 ms [2019-12-07 12:30:54,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:54,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:54,861 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:30:54,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:54,865 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:30:54,876 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:54,877 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 12:30:54,877 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:54,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:54,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:54,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:54,903 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 12:30:54,903 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:55,202 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-12-07 12:30:55,203 INFO L614 ElimStorePlain]: treesize reduction 60, result has 78.2 percent of original size [2019-12-07 12:30:55,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:55,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:55,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:55,225 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 12:30:55,226 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:55,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:55,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:55,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:55,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:55,248 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:55,248 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 12:30:55,248 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:55,335 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:55,335 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 12:30:55,335 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:245, output treesize:185 [2019-12-07 12:30:55,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:55,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:55,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:55,349 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:30:55,350 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 12:30:55,350 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:55,430 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:55,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:55,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:55,439 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:30:55,440 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 12:30:55,441 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:55,503 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:55,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:55,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:55,509 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:30:55,509 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:30:55,520 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:55,521 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 12:30:55,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:55,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:55,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:55,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:55,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:55,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:55,523 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 12:30:55,620 INFO L614 ElimStorePlain]: treesize reduction 12, result has 88.7 percent of original size [2019-12-07 12:30:55,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:30:55,626 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:55,626 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 12:30:55,626 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:55,654 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:55,655 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 12:30:55,655 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:209, output treesize:52 [2019-12-07 12:30:55,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:55,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:55,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:56,007 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 12:30:56,007 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:30:56,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:56,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:56,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:56,641 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 12:30:56,650 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 12:30:56,657 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 12:30:56,663 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 12:30:56,737 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:56,745 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 12:30:56,753 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 12:30:56,758 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 12:30:56,763 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 12:30:56,806 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:30:56,806 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 12:30:56,806 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:241, output treesize:149 [2019-12-07 12:30:59,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:59,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:59,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:30:59,297 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 12:30:59,320 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 12:30:59,387 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 12:30:59,408 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 12:31:00,557 WARN L192 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 92 [2019-12-07 12:31:00,557 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:00,579 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 12:31:00,715 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 12:31:00,888 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 12:31:01,016 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:02,473 WARN L192 SmtUtils]: Spent 1.46 s on a formula simplification that was a NOOP. DAG size: 112 [2019-12-07 12:31:02,474 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:02,475 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 12:31:02,475 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:601, output treesize:857 [2019-12-07 12:31:07,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:07,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:07,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:07,185 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:07,253 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:07,288 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:08,172 WARN L192 SmtUtils]: Spent 884.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-12-07 12:31:08,173 INFO L614 ElimStorePlain]: treesize reduction 676, result has 51.8 percent of original size [2019-12-07 12:31:08,221 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:08,258 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:08,267 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:31:08,282 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:08,327 INFO L614 ElimStorePlain]: treesize reduction 33, result has 38.9 percent of original size [2019-12-07 12:31:08,333 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:31:08,338 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:08,626 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2019-12-07 12:31:08,627 INFO L614 ElimStorePlain]: treesize reduction 279, result has 36.9 percent of original size [2019-12-07 12:31:08,627 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-12-07 12:31:08,627 INFO L239 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:953, output treesize:163 [2019-12-07 12:31:08,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 12:31:08,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:08,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:08,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:08,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:08,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:08,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:08,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:08,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:08,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:08,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:08,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:08,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:08,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:08,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:08,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:08,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:08,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:08,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:09,813 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 12:31:09,814 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:31:09,815 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-12-07 12:31:09,815 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:09,816 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:09,816 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 12:31:09,816 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 12:31:09,816 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:1 [2019-12-07 12:31:09,827 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 12:31:09,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575388464] [2019-12-07 12:31:09,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:31:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:31:09,904 INFO L264 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-07 12:31:09,905 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:31:09,908 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 12:31:09,908 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:09,913 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:09,913 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:31:09,913 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-12-07 12:31:10,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:10,050 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 12:31:10,050 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:10,063 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:10,069 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:10,069 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 12:31:10,069 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:10,080 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:10,080 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:31:10,080 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 [2019-12-07 12:31:10,084 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 12:31:10,085 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:10,104 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:10,107 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 12:31:10,107 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:10,123 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:10,124 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:31:10,124 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2019-12-07 12:31:10,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:10,130 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 12:31:10,130 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:10,158 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:10,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:10,161 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 12:31:10,162 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:10,178 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:10,178 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:31:10,178 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:74, output treesize:44 [2019-12-07 12:31:10,184 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 12:31:10,184 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:10,211 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:10,214 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:10,214 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 60 treesize of output 38 [2019-12-07 12:31:10,215 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:10,234 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:10,234 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:31:10,235 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:92, output treesize:72 [2019-12-07 12:31:10,241 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:31:10,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:10,256 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:10,256 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 12:31:10,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:10,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:10,258 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 12:31:10,341 INFO L614 ElimStorePlain]: treesize reduction 14, result has 85.3 percent of original size [2019-12-07 12:31:10,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:10,349 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:31:10,366 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:10,366 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 12:31:10,367 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:10,436 INFO L614 ElimStorePlain]: treesize reduction 18, result has 81.1 percent of original size [2019-12-07 12:31:10,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:10,437 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 12:31:10,437 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:96, output treesize:77 [2019-12-07 12:31:10,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:10,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:10,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:10,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:10,661 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:10,661 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 12:31:10,662 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:10,668 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:31:10,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:10,686 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 12:31:10,686 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:10,803 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-12-07 12:31:10,803 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:10,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:10,834 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 12:31:10,834 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:10,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:10,844 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:31:10,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:10,852 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:31:10,873 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:10,873 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 68 treesize of output 82 [2019-12-07 12:31:10,874 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:11,036 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-12-07 12:31:11,037 INFO L614 ElimStorePlain]: treesize reduction 48, result has 77.8 percent of original size [2019-12-07 12:31:11,037 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 12:31:11,037 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:189, output treesize:171 [2019-12-07 12:31:11,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:11,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:11,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:11,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:11,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:11,311 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:11,311 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 12:31:11,312 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:11,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:11,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:11,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:11,336 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 12:31:11,336 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:11,498 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-12-07 12:31:11,499 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:11,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:11,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:11,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:11,572 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 12:31:11,572 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:11,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:11,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:11,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:11,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:11,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:11,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:11,594 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:31:11,594 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:31:11,607 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:11,607 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 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 12:31:11,608 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:11,798 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-12-07 12:31:11,799 INFO L614 ElimStorePlain]: treesize reduction 60, result has 75.5 percent of original size [2019-12-07 12:31:11,799 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 12:31:11,799 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:245, output treesize:185 [2019-12-07 12:31:11,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:11,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:11,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:11,812 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:31:11,812 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:31:11,824 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:11,824 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 12:31:11,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:11,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:11,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:11,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:11,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:11,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:11,826 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 12:31:12,009 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-12-07 12:31:12,009 INFO L614 ElimStorePlain]: treesize reduction 12, result has 92.7 percent of original size [2019-12-07 12:31:12,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:12,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:12,017 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:31:12,017 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 12:31:12,018 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:12,077 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:12,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:12,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:12,083 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:31:12,084 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 12:31:12,084 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:12,130 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:12,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:12,136 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:12,136 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 12:31:12,136 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:12,170 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:12,170 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 12:31:12,170 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:209, output treesize:52 [2019-12-07 12:31:12,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:12,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:12,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:12,224 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 12:31:12,225 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:31:12,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:12,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:12,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:12,236 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 12:31:12,242 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 12:31:12,251 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 12:31:12,257 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 12:31:12,336 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:12,345 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 12:31:12,349 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 12:31:12,353 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 12:31:12,360 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:12,403 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:12,404 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 12:31:12,404 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:241, output treesize:149 [2019-12-07 12:31:12,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:12,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:12,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:15,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:15,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:15,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:15,259 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 12:31:15,274 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:15,281 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 12:31:15,288 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 12:31:15,532 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-12-07 12:31:15,532 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:15,543 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 12:31:15,553 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 12:31:15,570 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 12:31:15,579 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 12:31:16,189 WARN L192 SmtUtils]: Spent 609.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-12-07 12:31:16,190 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:16,190 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 12:31:16,190 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:361, output treesize:425 [2019-12-07 12:31:18,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:18,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:18,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:18,058 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:18,076 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:18,085 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:20,505 WARN L192 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2019-12-07 12:31:20,505 INFO L614 ElimStorePlain]: treesize reduction 158, result has 69.3 percent of original size [2019-12-07 12:31:20,522 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:20,526 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:31:20,526 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:20,539 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:20,550 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:20,555 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:31:20,555 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:20,714 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-12-07 12:31:20,714 INFO L614 ElimStorePlain]: treesize reduction 91, result has 50.0 percent of original size [2019-12-07 12:31:20,714 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-12-07 12:31:20,714 INFO L239 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:473, output treesize:91 [2019-12-07 12:31:21,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 12:31:21,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:21,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:21,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:21,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:21,854 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 27 [2019-12-07 12:31:22,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:31:22,583 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:22,583 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 12:31:22,583 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:22,596 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:22,596 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 12:31:22,596 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:22,605 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 12:31:22,605 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:22,646 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:22,646 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 12:31:22,646 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:68, output treesize:31 [2019-12-07 12:31:23,045 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 12:31:23,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 12:31:23,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 15, 13, 16, 13] total 56 [2019-12-07 12:31:23,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500568917] [2019-12-07 12:31:23,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-12-07 12:31:23,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 12:31:23,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-12-07 12:31:23,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=2864, Unknown=0, NotChecked=0, Total=3192 [2019-12-07 12:31:23,047 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand 57 states. [2019-12-07 12:31:26,793 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 70 [2019-12-07 12:31:27,520 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-12-07 12:31:28,039 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 67 [2019-12-07 12:31:28,506 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 75 [2019-12-07 12:31:29,428 WARN L192 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 80 [2019-12-07 12:31:30,429 WARN L192 SmtUtils]: Spent 688.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 111 [2019-12-07 12:31:31,842 WARN L192 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 266 DAG size of output: 147 [2019-12-07 12:31:33,482 WARN L192 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 280 DAG size of output: 153 [2019-12-07 12:31:35,012 WARN L192 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 204 DAG size of output: 124 [2019-12-07 12:31:37,378 WARN L192 SmtUtils]: Spent 878.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 124 [2019-12-07 12:31:37,773 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 43 [2019-12-07 12:31:39,153 WARN L192 SmtUtils]: Spent 832.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 117 [2019-12-07 12:31:40,547 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 50 [2019-12-07 12:31:41,430 WARN L192 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 41 [2019-12-07 12:31:43,126 WARN L192 SmtUtils]: Spent 722.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 47 [2019-12-07 12:31:44,368 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 25 [2019-12-07 12:31:44,965 WARN L192 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 31 [2019-12-07 12:31:45,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:31:45,023 INFO L93 Difference]: Finished difference Result 148 states and 154 transitions. [2019-12-07 12:31:45,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 12:31:45,025 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 43 [2019-12-07 12:31:45,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:31:45,025 INFO L225 Difference]: With dead ends: 148 [2019-12-07 12:31:45,025 INFO L226 Difference]: Without dead ends: 148 [2019-12-07 12:31:45,027 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 183 SyntacticMatches, 16 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2563 ImplicationChecksByTransitivity, 37.1s TimeCoverageRelationStatistics Valid=1103, Invalid=5377, Unknown=0, NotChecked=0, Total=6480 [2019-12-07 12:31:45,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-12-07 12:31:45,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 95. [2019-12-07 12:31:45,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-12-07 12:31:45,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2019-12-07 12:31:45,029 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 43 [2019-12-07 12:31:45,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:31:45,029 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2019-12-07 12:31:45,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-12-07 12:31:45,029 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2019-12-07 12:31:45,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 12:31:45,030 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:31:45,030 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] [2019-12-07 12:31:45,632 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 12:31:45,633 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 12:31:45,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:31:45,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1502463451, now seen corresponding path program 1 times [2019-12-07 12:31:45,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 12:31:45,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926225606] [2019-12-07 12:31:45,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:31:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:31:46,036 INFO L264 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 62 conjunts are in the unsatisfiable core [2019-12-07 12:31:46,038 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:31:46,041 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 12:31:46,042 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:46,050 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:46,051 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:31:46,051 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-12-07 12:31:46,079 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:46,079 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 12:31:46,080 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:46,103 INFO L614 ElimStorePlain]: treesize reduction 14, result has 62.2 percent of original size [2019-12-07 12:31:46,103 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:31:46,104 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2019-12-07 12:31:46,199 INFO L343 Elim1Store]: treesize reduction 8, result has 87.3 percent of original size [2019-12-07 12:31:46,199 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 12:31:46,200 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:46,237 INFO L614 ElimStorePlain]: treesize reduction 28, result has 54.1 percent of original size [2019-12-07 12:31:46,237 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:31:46,237 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:33 [2019-12-07 12:31:46,336 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:46,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, 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 12:31:46,336 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:46,385 INFO L614 ElimStorePlain]: treesize reduction 28, result has 58.8 percent of original size [2019-12-07 12:31:46,385 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:31:46,385 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:40 [2019-12-07 12:31:46,422 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 12:31:46,422 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:46,444 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:46,444 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:31:46,444 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:49 [2019-12-07 12:31:46,484 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 12:31:46,485 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:46,508 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:46,508 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 12:31:46,508 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:49 [2019-12-07 12:31:46,606 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:46,606 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 12:31:46,606 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:46,638 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:46,638 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 12:31:46,638 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:35 [2019-12-07 12:31:46,672 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_269|, |v_#memory_$Pointer$.base_287|], 2=[|v_#memory_int_264|]} [2019-12-07 12:31:46,678 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 12:31:46,678 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:46,739 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:46,745 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 12:31:46,745 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:46,783 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:46,789 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 12:31:46,789 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:46,817 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:46,817 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:31:46,818 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:80, output treesize:53 [2019-12-07 12:31:46,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:46,877 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 12:31:46,877 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:46,936 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:46,943 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 12:31:46,943 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:46,992 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:46,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:46,998 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 12:31:46,998 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:47,025 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:47,025 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:31:47,026 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:91, output treesize:57 [2019-12-07 12:31:47,079 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_271|, |v_#memory_$Pointer$.base_289|], 4=[|v_#memory_int_266|]} [2019-12-07 12:31:47,087 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 12:31:47,088 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:47,146 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:47,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:47,151 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 12:31:47,151 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:47,200 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:47,205 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 12:31:47,206 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:47,234 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:47,234 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:31:47,234 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:142, output treesize:89 [2019-12-07 12:31:47,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:47,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:47,374 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:47,374 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 12:31:47,375 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:47,531 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-12-07 12:31:47,531 INFO L614 ElimStorePlain]: treesize reduction 4, result has 96.9 percent of original size [2019-12-07 12:31:47,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:47,548 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 12:31:47,548 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:47,607 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:47,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:47,621 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 12:31:47,622 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:47,661 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:47,662 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:31:47,662 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:134, output treesize:103 [2019-12-07 12:31:47,762 INFO L430 ElimStorePlain]: Different costs {6=[|v_#memory_int_268|], 10=[|v_#memory_$Pointer$.base_291|, |v_#memory_$Pointer$.offset_273|]} [2019-12-07 12:31:47,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:47,772 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 12:31:47,772 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:47,847 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:47,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:47,854 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:31:47,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:47,856 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:31:47,876 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:47,877 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 12:31:47,877 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:47,979 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-12-07 12:31:47,980 INFO L614 ElimStorePlain]: treesize reduction 58, result has 65.1 percent of original size [2019-12-07 12:31:47,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:47,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:47,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:47,990 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 12:31:47,990 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:48,022 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:48,022 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 12:31:48,022 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:141, output treesize:113 [2019-12-07 12:31:48,328 INFO L430 ElimStorePlain]: Different costs {5=[|v_#memory_int_269|], 10=[|v_#memory_$Pointer$.base_292|, |v_#memory_$Pointer$.offset_274|]} [2019-12-07 12:31:48,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:48,346 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 12:31:48,346 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:48,506 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-07 12:31:48,506 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:48,526 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:48,526 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 12:31:48,527 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:48,669 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-12-07 12:31:48,669 INFO L614 ElimStorePlain]: treesize reduction 40, result has 73.3 percent of original size [2019-12-07 12:31:48,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:48,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:31:48,677 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 12:31:48,677 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:48,705 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:48,706 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 12:31:48,706 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:136, output treesize:88 [2019-12-07 12:31:48,806 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:48,806 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 12:31:48,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:48,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:48,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:48,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:48,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:48,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:31:48,808 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 12:31:48,859 INFO L614 ElimStorePlain]: treesize reduction 8, result has 87.9 percent of original size [2019-12-07 12:31:48,863 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 12:31:48,863 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:48,876 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:48,877 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 12:31:48,877 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:99, output treesize:14 [2019-12-07 12:31:48,989 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 12:31:48,990 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:31:48,993 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:48,993 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 12:31:48,993 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-12-07 12:31:49,054 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 12:31:49,054 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:31:49,298 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 12:31:49,315 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:49,316 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 12:31:49,320 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:49,320 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 12:31:49,321 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:33 [2019-12-07 12:31:49,721 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 12:31:49,726 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:49,726 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 12:31:49,727 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:64, output treesize:48 [2019-12-07 12:31:49,889 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 12:31:49,902 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:49,903 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 12:31:49,903 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:89, output treesize:88 [2019-12-07 12:31:50,526 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 12:31:50,571 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:50,571 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 12:31:50,572 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:149, output treesize:168 [2019-12-07 12:31:51,455 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 12:31:51,615 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-12-07 12:31:51,616 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:51,617 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 12:31:51,716 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:31:51,717 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 12:31:51,717 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:265, output treesize:296 [2019-12-07 12:31:55,240 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 6=[|v_#memory_int_275|]} [2019-12-07 12:32:07,536 WARN L192 SmtUtils]: Spent 12.29 s on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2019-12-07 12:32:07,536 INFO L343 Elim1Store]: treesize reduction 89, result has 39.9 percent of original size [2019-12-07 12:32:07,536 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 12:32:07,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:32:07,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:32:07,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:32:07,562 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:32:07,562 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 12:32:07,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:32:07,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:32:07,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:32:07,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:32:07,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:32:07,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:32:07,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:32:07,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:32:07,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:32:07,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:32:07,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:32:07,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:32:07,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:32:07,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:32:07,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:32:07,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:32:07,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:32:07,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:32:07,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:32:07,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:32:07,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:32:07,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:32:07,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:32:07,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:32:07,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:32:07,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:32:07,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:32:07,576 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:32:07,577 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 12:32:07,577 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_342, v_arrayElimCell_341], 2=[v_arrayElimCell_340]} [2019-12-07 12:32:07,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926225606] [2019-12-07 12:32:07,594 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@4f269eb5 [2019-12-07 12:32:07,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [963161493] [2019-12-07 12:32:07,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:32:07,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:32:08,001 INFO L264 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 58 conjunts are in the unsatisfiable core [2019-12-07 12:32:08,002 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:32:08,003 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@4f269eb5 [2019-12-07 12:32:08,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393467694] [2019-12-07 12:32:08,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fc84fb2-79c1-4d4b-addf-c760d727f52a/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 12:32:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:32:08,089 INFO L264 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 57 conjunts are in the unsatisfiable core [2019-12-07 12:32:08,090 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:32:08,090 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@4f269eb5 [2019-12-07 12:32:08,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:32:08,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 12:32:08,091 ERROR L206 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2019-12-07 12:32:08,091 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:32:08,695 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 12:32:08,710 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 12:32:08,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:32:08 BoogieIcfgContainer [2019-12-07 12:32:08,710 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:32:08,710 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:32:08,711 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:32:08,711 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:32:08,711 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:29:37" (3/4) ... [2019-12-07 12:32:08,714 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 12:32:08,714 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:32:08,714 INFO L168 Benchmark]: Toolchain (without parser) took 152025.90 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 249.6 MB). Free memory was 947.0 MB in the beginning and 813.7 MB in the end (delta: 133.3 MB). Peak memory consumption was 382.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:32:08,715 INFO L168 Benchmark]: CDTParser took 0.17 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 12:32:08,715 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -163.9 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2019-12-07 12:32:08,715 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.70 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-12-07 12:32:08,715 INFO L168 Benchmark]: Boogie Preprocessor took 22.12 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 12:32:08,715 INFO L168 Benchmark]: RCFGBuilder took 411.81 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: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:32:08,716 INFO L168 Benchmark]: TraceAbstraction took 151241.57 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 120.1 MB). Free memory was 1.1 GB in the beginning and 813.7 MB in the end (delta: 255.8 MB). Peak memory consumption was 375.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:32:08,716 INFO L168 Benchmark]: Witness Printer took 3.14 ms. Allocated memory is still 1.3 GB. Free memory is still 813.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:32:08,717 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 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 311.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -163.9 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.70 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.12 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 411.81 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: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 151241.57 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 120.1 MB). Free memory was 1.1 GB in the beginning and 813.7 MB in the end (delta: 255.8 MB). Peak memory consumption was 375.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.14 ms. Allocated memory is still 1.3 GB. Free memory is still 813.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 615]: 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. 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] int data_new = 1; [L593] DLL ptr = head; [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 [L615] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 35 error locations. Result: UNKNOWN, OverallTime: 151.1s, OverallIterations: 16, TraceHistogramMax: 4, AutomataDifference: 36.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 535 SDtfs, 3578 SDslu, 1897 SDs, 0 SdLazy, 3882 SolverSat, 521 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1576 GetRequests, 1222 SyntacticMatches, 64 SemanticMatches, 290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6157 ImplicationChecksByTransitivity, 53.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred 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, 253 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 4.1s SatisfiabilityAnalysisTime, 80.2s InterpolantComputationTime, 776 NumberOfCodeBlocks, 776 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1490 ConstructedInterpolants, 211 QuantifiedInterpolants, 835291 SizeOfPredicates, 333 NumberOfNonLiveVariables, 4241 ConjunctsInSsa, 441 ConjunctsInUnsatCore, 62 InterpolantComputations, 18 PerfectInterpolantSequences, 529/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...