./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 678e0110 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_41be8b59-771b-42a8-9fcc-5b215e996269/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_41be8b59-771b-42a8-9fcc-5b215e996269/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_41be8b59-771b-42a8-9fcc-5b215e996269/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_41be8b59-771b-42a8-9fcc-5b215e996269/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i -s /tmp/vcloud-vcloud-master/worker/run_dir_41be8b59-771b-42a8-9fcc-5b215e996269/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_41be8b59-771b-42a8-9fcc-5b215e996269/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cfdde8b1798318c3bb26b76a748741913b280952 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported: (exists ((v_DerPreprocessor_35 (_ BitVec 32)) (v_dll_update_at_~head.offset_79 (_ BitVec 32))) (forall ((v_DerPreprocessor_36 (_ BitVec 32)) (dll_update_at_~head.offset (_ BitVec 32))) (let ((.cse0 (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))) (or (not (= (select (select (store |#memory_$Pointer$.base| dll_update_at_~head.base (store (select |#memory_$Pointer$.base| dll_update_at_~head.base) dll_update_at_~head.offset v_DerPreprocessor_36)) |dll_update_at_#in~head.base|) .cse0) (_ bv0 32))) (= (_ bv0 32) (select (select (let ((.cse1 (select (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) .cse0))) (store |old(#memory_$Pointer$.base)| .cse1 (store (select |old(#memory_$Pointer$.base)| .cse1) v_dll_update_at_~head.offset_79 v_DerPreprocessor_35))) |dll_update_at_#in~head.base|) .cse0)))))) --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-19 23:10:01,484 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 23:10:01,486 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 23:10:01,496 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 23:10:01,497 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 23:10:01,498 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 23:10:01,499 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 23:10:01,502 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 23:10:01,504 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 23:10:01,505 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 23:10:01,506 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 23:10:01,507 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 23:10:01,508 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 23:10:01,509 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 23:10:01,510 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 23:10:01,511 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 23:10:01,512 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 23:10:01,513 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 23:10:01,515 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 23:10:01,517 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 23:10:01,521 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 23:10:01,525 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 23:10:01,528 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 23:10:01,532 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 23:10:01,535 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 23:10:01,538 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 23:10:01,538 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 23:10:01,539 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 23:10:01,541 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 23:10:01,542 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 23:10:01,543 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 23:10:01,544 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 23:10:01,545 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 23:10:01,547 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 23:10:01,548 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 23:10:01,549 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 23:10:01,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 23:10:01,550 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 23:10:01,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 23:10:01,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 23:10:01,552 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 23:10:01,553 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_41be8b59-771b-42a8-9fcc-5b215e996269/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-19 23:10:01,579 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 23:10:01,579 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 23:10:01,580 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 23:10:01,581 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 23:10:01,581 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 23:10:01,581 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 23:10:01,581 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 23:10:01,582 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 23:10:01,582 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 23:10:01,582 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 23:10:01,583 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 23:10:01,584 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-19 23:10:01,584 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-19 23:10:01,584 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-19 23:10:01,584 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 23:10:01,584 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-19 23:10:01,585 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-19 23:10:01,585 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 23:10:01,585 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 23:10:01,585 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 23:10:01,586 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 23:10:01,586 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 23:10:01,586 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 23:10:01,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 23:10:01,587 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 23:10:01,587 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 23:10:01,587 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-19 23:10:01,587 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-19 23:10:01,587 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-19 23:10:01,588 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_41be8b59-771b-42a8-9fcc-5b215e996269/bin/uautomizer 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 -> Automizer 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 -> cfdde8b1798318c3bb26b76a748741913b280952 [2019-11-19 23:10:01,741 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 23:10:01,751 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 23:10:01,755 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 23:10:01,756 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 23:10:01,757 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 23:10:01,757 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_41be8b59-771b-42a8-9fcc-5b215e996269/bin/uautomizer/../../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2019-11-19 23:10:01,799 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_41be8b59-771b-42a8-9fcc-5b215e996269/bin/uautomizer/data/e59dde8b2/f42b04f4eb454587991eff81a565c47f/FLAG75119cfbd [2019-11-19 23:10:02,264 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 23:10:02,264 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_41be8b59-771b-42a8-9fcc-5b215e996269/sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2019-11-19 23:10:02,277 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_41be8b59-771b-42a8-9fcc-5b215e996269/bin/uautomizer/data/e59dde8b2/f42b04f4eb454587991eff81a565c47f/FLAG75119cfbd [2019-11-19 23:10:02,527 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_41be8b59-771b-42a8-9fcc-5b215e996269/bin/uautomizer/data/e59dde8b2/f42b04f4eb454587991eff81a565c47f [2019-11-19 23:10:02,530 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 23:10:02,531 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-19 23:10:02,532 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 23:10:02,532 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 23:10:02,535 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 23:10:02,535 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:10:02" (1/1) ... [2019-11-19 23:10:02,537 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a6572dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:10:02, skipping insertion in model container [2019-11-19 23:10:02,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:10:02" (1/1) ... [2019-11-19 23:10:02,543 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 23:10:02,581 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 23:10:03,011 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:10:03,023 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 23:10:03,065 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:10:03,110 INFO L192 MainTranslator]: Completed translation [2019-11-19 23:10:03,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:10:03 WrapperNode [2019-11-19 23:10:03,111 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 23:10:03,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 23:10:03,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 23:10:03,112 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 23:10:03,125 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:10:03" (1/1) ... [2019-11-19 23:10:03,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:10:03" (1/1) ... [2019-11-19 23:10:03,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:10:03" (1/1) ... [2019-11-19 23:10:03,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:10:03" (1/1) ... [2019-11-19 23:10:03,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:10:03" (1/1) ... [2019-11-19 23:10:03,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:10:03" (1/1) ... [2019-11-19 23:10:03,172 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:10:03" (1/1) ... [2019-11-19 23:10:03,179 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 23:10:03,179 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 23:10:03,180 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 23:10:03,180 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 23:10:03,181 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:10:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41be8b59-771b-42a8-9fcc-5b215e996269/bin/uautomizer/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-11-19 23:10:03,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-19 23:10:03,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 23:10:03,249 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-19 23:10:03,249 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-19 23:10:03,250 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-19 23:10:03,250 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-19 23:10:03,250 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2019-11-19 23:10:03,250 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2019-11-19 23:10:03,251 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_get_data_at [2019-11-19 23:10:03,251 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_update_at [2019-11-19 23:10:03,252 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-19 23:10:03,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-19 23:10:03,252 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-19 23:10:03,252 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-19 23:10:03,252 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-19 23:10:03,253 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-19 23:10:03,253 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-19 23:10:03,254 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-19 23:10:03,254 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-19 23:10:03,254 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-19 23:10:03,254 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-19 23:10:03,254 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-19 23:10:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-19 23:10:03,255 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-19 23:10:03,256 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-19 23:10:03,256 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-19 23:10:03,256 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-19 23:10:03,256 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-19 23:10:03,257 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-19 23:10:03,257 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-19 23:10:03,257 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-19 23:10:03,257 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-19 23:10:03,257 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-19 23:10:03,257 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-19 23:10:03,258 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-19 23:10:03,258 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-19 23:10:03,258 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-19 23:10:03,258 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-19 23:10:03,258 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-19 23:10:03,258 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-19 23:10:03,259 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-19 23:10:03,259 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-19 23:10:03,259 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-19 23:10:03,259 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-19 23:10:03,259 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-19 23:10:03,260 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-19 23:10:03,261 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-19 23:10:03,261 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-19 23:10:03,261 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-19 23:10:03,261 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-19 23:10:03,261 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-19 23:10:03,261 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-19 23:10:03,262 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-19 23:10:03,262 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-19 23:10:03,262 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-19 23:10:03,262 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-19 23:10:03,262 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-19 23:10:03,262 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-19 23:10:03,263 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-19 23:10:03,263 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-19 23:10:03,263 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-19 23:10:03,263 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-19 23:10:03,264 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-19 23:10:03,264 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-19 23:10:03,264 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-19 23:10:03,264 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-19 23:10:03,264 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-19 23:10:03,265 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-19 23:10:03,265 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-19 23:10:03,265 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-19 23:10:03,266 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-19 23:10:03,266 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-19 23:10:03,266 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-19 23:10:03,267 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-19 23:10:03,267 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-19 23:10:03,268 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-19 23:10:03,268 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-19 23:10:03,268 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-19 23:10:03,269 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-19 23:10:03,269 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-19 23:10:03,269 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-19 23:10:03,269 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-19 23:10:03,269 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-19 23:10:03,269 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-19 23:10:03,269 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-19 23:10:03,270 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-19 23:10:03,270 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-19 23:10:03,270 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-19 23:10:03,270 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-19 23:10:03,270 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-19 23:10:03,270 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-19 23:10:03,271 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-19 23:10:03,271 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-19 23:10:03,271 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-19 23:10:03,271 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-19 23:10:03,271 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-19 23:10:03,271 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-19 23:10:03,272 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-19 23:10:03,272 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-19 23:10:03,272 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-19 23:10:03,272 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-19 23:10:03,272 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-19 23:10:03,272 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-19 23:10:03,273 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-19 23:10:03,273 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-19 23:10:03,273 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-19 23:10:03,273 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-19 23:10:03,273 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-19 23:10:03,273 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-19 23:10:03,274 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-19 23:10:03,274 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-19 23:10:03,274 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-19 23:10:03,274 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-19 23:10:03,274 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-19 23:10:03,274 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-19 23:10:03,275 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-19 23:10:03,275 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-19 23:10:03,275 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-19 23:10:03,276 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-19 23:10:03,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-19 23:10:03,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-19 23:10:03,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-19 23:10:03,277 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2019-11-19 23:10:03,277 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2019-11-19 23:10:03,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-19 23:10:03,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 23:10:03,277 INFO L130 BoogieDeclarations]: Found specification of procedure dll_get_data_at [2019-11-19 23:10:03,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-19 23:10:03,278 INFO L130 BoogieDeclarations]: Found specification of procedure dll_update_at [2019-11-19 23:10:03,278 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-19 23:10:03,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-19 23:10:03,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 23:10:03,800 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-19 23:10:04,169 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 23:10:04,169 INFO L285 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-19 23:10:04,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:10:04 BoogieIcfgContainer [2019-11-19 23:10:04,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 23:10:04,171 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 23:10:04,171 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 23:10:04,174 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 23:10:04,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:10:02" (1/3) ... [2019-11-19 23:10:04,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78355113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:10:04, skipping insertion in model container [2019-11-19 23:10:04,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:10:03" (2/3) ... [2019-11-19 23:10:04,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78355113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:10:04, skipping insertion in model container [2019-11-19 23:10:04,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:10:04" (3/3) ... [2019-11-19 23:10:04,178 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_reverse.i [2019-11-19 23:10:04,187 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 23:10:04,194 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 28 error locations. [2019-11-19 23:10:04,205 INFO L249 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2019-11-19 23:10:04,223 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 23:10:04,223 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-19 23:10:04,223 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 23:10:04,223 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 23:10:04,223 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 23:10:04,224 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 23:10:04,224 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 23:10:04,224 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 23:10:04,245 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2019-11-19 23:10:04,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-19 23:10:04,254 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:10:04,254 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:10:04,255 INFO L410 AbstractCegarLoop]: === Iteration 1 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 23:10:04,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:10:04,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1949078934, now seen corresponding path program 1 times [2019-11-19 23:10:04,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:10:04,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1390469396] [2019-11-19 23:10:04,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41be8b59-771b-42a8-9fcc-5b215e996269/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:10:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:10:04,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 23:10:04,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:10:04,613 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-11-19 23:10:04,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:04,621 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:04,621 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:10:04,622 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-19 23:10:04,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:10:04,650 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:10:04,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:10:04,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1390469396] [2019-11-19 23:10:04,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:10:04,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-19 23:10:04,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731611713] [2019-11-19 23:10:04,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:10:04,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:10:04,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:10:04,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:10:04,685 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 3 states. [2019-11-19 23:10:04,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:10:04,841 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2019-11-19 23:10:04,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:10:04,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-19 23:10:04,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:10:04,851 INFO L225 Difference]: With dead ends: 85 [2019-11-19 23:10:04,852 INFO L226 Difference]: Without dead ends: 78 [2019-11-19 23:10:04,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-11-19 23:10:04,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-19 23:10:04,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2019-11-19 23:10:04,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-19 23:10:04,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2019-11-19 23:10:04,886 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 11 [2019-11-19 23:10:04,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:10:04,886 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2019-11-19 23:10:04,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:10:04,886 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2019-11-19 23:10:04,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-19 23:10:04,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:10:04,887 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:10:05,087 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:10:05,095 INFO L410 AbstractCegarLoop]: === Iteration 2 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 23:10:05,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:10:05,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1949078933, now seen corresponding path program 1 times [2019-11-19 23:10:05,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:10:05,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2043555066] [2019-11-19 23:10:05,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41be8b59-771b-42a8-9fcc-5b215e996269/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:10:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:10:05,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 23:10:05,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:10:05,293 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-11-19 23:10:05,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:05,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:05,305 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:10:05,305 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-19 23:10:05,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:10:05,321 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:10:05,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:10:05,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2043555066] [2019-11-19 23:10:05,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:10:05,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-19 23:10:05,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007825648] [2019-11-19 23:10:05,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:10:05,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:10:05,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:10:05,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:10:05,375 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 4 states. [2019-11-19 23:10:05,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:10:05,574 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2019-11-19 23:10:05,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:10:05,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-19 23:10:05,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:10:05,579 INFO L225 Difference]: With dead ends: 75 [2019-11-19 23:10:05,579 INFO L226 Difference]: Without dead ends: 75 [2019-11-19 23:10:05,580 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 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-11-19 23:10:05,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-19 23:10:05,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2019-11-19 23:10:05,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-19 23:10:05,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2019-11-19 23:10:05,591 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 11 [2019-11-19 23:10:05,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:10:05,592 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2019-11-19 23:10:05,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:10:05,592 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2019-11-19 23:10:05,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-19 23:10:05,598 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:10:05,599 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:10:05,804 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:10:05,805 INFO L410 AbstractCegarLoop]: === Iteration 3 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 23:10:05,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:10:05,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1176553966, now seen corresponding path program 1 times [2019-11-19 23:10:05,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:10:05,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [37127901] [2019-11-19 23:10:05,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41be8b59-771b-42a8-9fcc-5b215e996269/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:10:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:10:06,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 23:10:06,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:10:06,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:10:06,021 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:10:06,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:10:06,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [37127901] [2019-11-19 23:10:06,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:10:06,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-19 23:10:06,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706013277] [2019-11-19 23:10:06,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:10:06,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:10:06,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:10:06,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:10:06,036 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 3 states. [2019-11-19 23:10:06,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:10:06,104 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2019-11-19 23:10:06,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:10:06,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-19 23:10:06,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:10:06,109 INFO L225 Difference]: With dead ends: 81 [2019-11-19 23:10:06,109 INFO L226 Difference]: Without dead ends: 81 [2019-11-19 23:10:06,109 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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-11-19 23:10:06,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-19 23:10:06,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2019-11-19 23:10:06,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-19 23:10:06,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2019-11-19 23:10:06,129 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 15 [2019-11-19 23:10:06,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:10:06,130 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2019-11-19 23:10:06,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:10:06,130 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2019-11-19 23:10:06,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-19 23:10:06,131 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:10:06,131 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:10:06,334 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:10:06,336 INFO L410 AbstractCegarLoop]: === Iteration 4 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 23:10:06,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:10:06,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1455041163, now seen corresponding path program 1 times [2019-11-19 23:10:06,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:10:06,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1366350789] [2019-11-19 23:10:06,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41be8b59-771b-42a8-9fcc-5b215e996269/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:10:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:10:06,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 23:10:06,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:10:06,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:10:06,570 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:10:06,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:10:06,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1366350789] [2019-11-19 23:10:06,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:10:06,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-11-19 23:10:06,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955343893] [2019-11-19 23:10:06,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 23:10:06,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:10:06,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 23:10:06,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:10:06,653 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 7 states. [2019-11-19 23:10:06,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:10:06,745 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2019-11-19 23:10:06,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 23:10:06,746 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-19 23:10:06,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:10:06,747 INFO L225 Difference]: With dead ends: 81 [2019-11-19 23:10:06,747 INFO L226 Difference]: Without dead ends: 78 [2019-11-19 23:10:06,748 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-19 23:10:06,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-19 23:10:06,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-11-19 23:10:06,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-19 23:10:06,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2019-11-19 23:10:06,755 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 18 [2019-11-19 23:10:06,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:10:06,755 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2019-11-19 23:10:06,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 23:10:06,755 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2019-11-19 23:10:06,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 23:10:06,756 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:10:06,756 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:10:06,957 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:10:06,957 INFO L410 AbstractCegarLoop]: === Iteration 5 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 23:10:06,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:10:06,957 INFO L82 PathProgramCache]: Analyzing trace with hash -2030798451, now seen corresponding path program 1 times [2019-11-19 23:10:06,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:10:06,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1582921933] [2019-11-19 23:10:06,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41be8b59-771b-42a8-9fcc-5b215e996269/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:10:07,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:10:07,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 23:10:07,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:10:07,174 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-11-19 23:10:07,174 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:07,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:07,177 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:10:07,177 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-19 23:10:07,219 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:07,220 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-11-19 23:10:07,220 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:07,242 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-19 23:10:07,243 INFO L496 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-11-19 23:10:07,243 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-11-19 23:10:07,258 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:10:07,259 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:10:07,281 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:10:07,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1582921933] [2019-11-19 23:10:07,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:10:07,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-11-19 23:10:07,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969215680] [2019-11-19 23:10:07,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:10:07,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:10:07,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:10:07,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:10:07,283 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 4 states. [2019-11-19 23:10:07,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:10:07,507 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2019-11-19 23:10:07,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:10:07,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-11-19 23:10:07,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:10:07,508 INFO L225 Difference]: With dead ends: 77 [2019-11-19 23:10:07,509 INFO L226 Difference]: Without dead ends: 77 [2019-11-19 23:10:07,509 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:10:07,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-19 23:10:07,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-11-19 23:10:07,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-19 23:10:07,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2019-11-19 23:10:07,515 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 22 [2019-11-19 23:10:07,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:10:07,515 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2019-11-19 23:10:07,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:10:07,515 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2019-11-19 23:10:07,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 23:10:07,519 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:10:07,519 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:10:07,719 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:10:07,720 INFO L410 AbstractCegarLoop]: === Iteration 6 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 23:10:07,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:10:07,720 INFO L82 PathProgramCache]: Analyzing trace with hash -2030798450, now seen corresponding path program 1 times [2019-11-19 23:10:07,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:10:07,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [704131547] [2019-11-19 23:10:07,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41be8b59-771b-42a8-9fcc-5b215e996269/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:10:07,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:10:07,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 23:10:07,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:10:07,974 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-11-19 23:10:07,974 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:07,981 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:07,985 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-11-19 23:10:07,985 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:08,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:08,000 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:10:08,000 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-19 23:10:08,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:10:08,052 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-19 23:10:08,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:08,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:08,088 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:08,089 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-11-19 23:10:08,089 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:08,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:08,100 INFO L496 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-11-19 23:10:08,101 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2019-11-19 23:10:08,136 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:10:08,136 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:10:08,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:10:08,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:10:08,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [704131547] [2019-11-19 23:10:08,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:10:08,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-11-19 23:10:08,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213881023] [2019-11-19 23:10:08,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 23:10:08,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:10:08,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 23:10:08,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-19 23:10:08,483 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 8 states. [2019-11-19 23:10:08,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:10:08,992 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2019-11-19 23:10:08,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 23:10:08,993 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-11-19 23:10:08,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:10:08,994 INFO L225 Difference]: With dead ends: 80 [2019-11-19 23:10:08,994 INFO L226 Difference]: Without dead ends: 80 [2019-11-19 23:10:08,995 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-19 23:10:08,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-19 23:10:09,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2019-11-19 23:10:09,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-19 23:10:09,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2019-11-19 23:10:09,001 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 22 [2019-11-19 23:10:09,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:10:09,002 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2019-11-19 23:10:09,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 23:10:09,002 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2019-11-19 23:10:09,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-19 23:10:09,003 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:10:09,003 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:10:09,206 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:10:09,206 INFO L410 AbstractCegarLoop]: === Iteration 7 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 23:10:09,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:10:09,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1356620428, now seen corresponding path program 1 times [2019-11-19 23:10:09,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:10:09,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [163529175] [2019-11-19 23:10:09,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41be8b59-771b-42a8-9fcc-5b215e996269/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:10:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:10:09,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 23:10:09,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:10:09,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:10:09,434 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:10:09,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:10:09,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [163529175] [2019-11-19 23:10:09,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:10:09,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-11-19 23:10:09,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459918781] [2019-11-19 23:10:09,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 23:10:09,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:10:09,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 23:10:09,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-19 23:10:09,570 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 9 states. [2019-11-19 23:10:09,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:10:09,709 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2019-11-19 23:10:09,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 23:10:09,709 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-11-19 23:10:09,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:10:09,711 INFO L225 Difference]: With dead ends: 87 [2019-11-19 23:10:09,711 INFO L226 Difference]: Without dead ends: 84 [2019-11-19 23:10:09,711 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-19 23:10:09,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-19 23:10:09,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2019-11-19 23:10:09,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-19 23:10:09,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2019-11-19 23:10:09,723 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 25 [2019-11-19 23:10:09,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:10:09,724 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2019-11-19 23:10:09,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 23:10:09,724 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2019-11-19 23:10:09,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-19 23:10:09,726 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:10:09,726 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:10:09,929 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:10:09,932 INFO L410 AbstractCegarLoop]: === Iteration 8 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 23:10:09,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:10:09,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1238608021, now seen corresponding path program 2 times [2019-11-19 23:10:09,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:10:09,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1064597165] [2019-11-19 23:10:09,933 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41be8b59-771b-42a8-9fcc-5b215e996269/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:10:10,135 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 23:10:10,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:10:10,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 23:10:10,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:10:10,160 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:10:10,160 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:10:10,179 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:10:10,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1064597165] [2019-11-19 23:10:10,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:10:10,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-19 23:10:10,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228477572] [2019-11-19 23:10:10,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:10:10,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:10:10,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:10:10,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:10:10,181 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 4 states. [2019-11-19 23:10:10,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:10:10,267 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2019-11-19 23:10:10,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:10:10,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-11-19 23:10:10,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:10:10,268 INFO L225 Difference]: With dead ends: 77 [2019-11-19 23:10:10,268 INFO L226 Difference]: Without dead ends: 77 [2019-11-19 23:10:10,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:10:10,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-19 23:10:10,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-11-19 23:10:10,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-19 23:10:10,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-11-19 23:10:10,274 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 32 [2019-11-19 23:10:10,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:10:10,274 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-11-19 23:10:10,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:10:10,274 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-11-19 23:10:10,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-19 23:10:10,275 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:10:10,275 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:10:10,476 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:10:10,476 INFO L410 AbstractCegarLoop]: === Iteration 9 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 23:10:10,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:10:10,476 INFO L82 PathProgramCache]: Analyzing trace with hash -551368800, now seen corresponding path program 1 times [2019-11-19 23:10:10,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:10:10,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1490256353] [2019-11-19 23:10:10,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41be8b59-771b-42a8-9fcc-5b215e996269/bin/uautomizer/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-11-19 23:10:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:10:10,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 23:10:10,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:10:10,793 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:10,793 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-11-19 23:10:10,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:10,813 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-19 23:10:10,814 INFO L496 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-11-19 23:10:10,814 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-19 23:10:10,892 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:10:10,892 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:10:10,981 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 23:10:10,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1490256353] [2019-11-19 23:10:10,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:10:10,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 9 [2019-11-19 23:10:10,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912094017] [2019-11-19 23:10:10,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 23:10:10,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:10:10,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 23:10:10,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-19 23:10:10,983 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 10 states. [2019-11-19 23:10:11,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:10:11,500 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2019-11-19 23:10:11,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 23:10:11,500 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2019-11-19 23:10:11,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:10:11,501 INFO L225 Difference]: With dead ends: 91 [2019-11-19 23:10:11,502 INFO L226 Difference]: Without dead ends: 91 [2019-11-19 23:10:11,502 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-19 23:10:11,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-19 23:10:11,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 80. [2019-11-19 23:10:11,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-19 23:10:11,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2019-11-19 23:10:11,508 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 33 [2019-11-19 23:10:11,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:10:11,508 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2019-11-19 23:10:11,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 23:10:11,508 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2019-11-19 23:10:11,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-19 23:10:11,509 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:10:11,509 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:10:11,712 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:10:11,713 INFO L410 AbstractCegarLoop]: === Iteration 10 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 23:10:11,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:10:11,713 INFO L82 PathProgramCache]: Analyzing trace with hash -551368799, now seen corresponding path program 1 times [2019-11-19 23:10:11,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:10:11,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [112114015] [2019-11-19 23:10:11,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41be8b59-771b-42a8-9fcc-5b215e996269/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:10:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:10:11,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-19 23:10:11,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:10:11,961 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-11-19 23:10:11,961 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:11,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:11,968 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:10:11,968 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-19 23:10:12,099 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 23:10:12,099 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:10:12,884 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 23:10:12,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [112114015] [2019-11-19 23:10:12,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:10:12,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-11-19 23:10:12,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151843152] [2019-11-19 23:10:12,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-19 23:10:12,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:10:12,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-19 23:10:12,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-11-19 23:10:12,887 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 16 states. [2019-11-19 23:10:14,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:10:14,147 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2019-11-19 23:10:14,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 23:10:14,148 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2019-11-19 23:10:14,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:10:14,149 INFO L225 Difference]: With dead ends: 83 [2019-11-19 23:10:14,149 INFO L226 Difference]: Without dead ends: 83 [2019-11-19 23:10:14,150 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2019-11-19 23:10:14,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-19 23:10:14,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2019-11-19 23:10:14,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-19 23:10:14,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2019-11-19 23:10:14,155 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 33 [2019-11-19 23:10:14,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:10:14,155 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2019-11-19 23:10:14,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-19 23:10:14,155 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2019-11-19 23:10:14,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-19 23:10:14,156 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:10:14,156 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:10:14,360 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:10:14,361 INFO L410 AbstractCegarLoop]: === Iteration 11 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 23:10:14,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:10:14,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1165986280, now seen corresponding path program 1 times [2019-11-19 23:10:14,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:10:14,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [431828418] [2019-11-19 23:10:14,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41be8b59-771b-42a8-9fcc-5b215e996269/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:10:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:10:14,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 23:10:14,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:10:14,622 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-19 23:10:14,622 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:10:14,654 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-19 23:10:14,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [431828418] [2019-11-19 23:10:14,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:10:14,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-19 23:10:14,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197662986] [2019-11-19 23:10:14,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 23:10:14,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:10:14,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 23:10:14,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 23:10:14,656 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand 6 states. [2019-11-19 23:10:14,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:10:14,718 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2019-11-19 23:10:14,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 23:10:14,720 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-11-19 23:10:14,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:10:14,722 INFO L225 Difference]: With dead ends: 69 [2019-11-19 23:10:14,722 INFO L226 Difference]: Without dead ends: 69 [2019-11-19 23:10:14,723 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-19 23:10:14,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-19 23:10:14,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-11-19 23:10:14,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-19 23:10:14,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2019-11-19 23:10:14,729 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 35 [2019-11-19 23:10:14,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:10:14,729 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2019-11-19 23:10:14,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 23:10:14,729 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2019-11-19 23:10:14,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-19 23:10:14,731 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:10:14,731 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:10:14,932 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:10:14,932 INFO L410 AbstractCegarLoop]: === Iteration 12 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 23:10:14,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:10:14,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1872926408, now seen corresponding path program 1 times [2019-11-19 23:10:14,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:10:14,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [440408484] [2019-11-19 23:10:14,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41be8b59-771b-42a8-9fcc-5b215e996269/bin/uautomizer/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-11-19 23:10:15,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:10:15,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 23:10:15,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:10:15,213 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-19 23:10:15,213 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:10:15,327 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-19 23:10:15,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [440408484] [2019-11-19 23:10:15,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:10:15,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-19 23:10:15,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285532023] [2019-11-19 23:10:15,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 23:10:15,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:10:15,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 23:10:15,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-19 23:10:15,329 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 12 states. [2019-11-19 23:10:15,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:10:15,628 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2019-11-19 23:10:15,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-19 23:10:15,629 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2019-11-19 23:10:15,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:10:15,630 INFO L225 Difference]: With dead ends: 94 [2019-11-19 23:10:15,630 INFO L226 Difference]: Without dead ends: 94 [2019-11-19 23:10:15,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-11-19 23:10:15,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-19 23:10:15,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 87. [2019-11-19 23:10:15,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-19 23:10:15,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2019-11-19 23:10:15,636 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 36 [2019-11-19 23:10:15,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:10:15,636 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2019-11-19 23:10:15,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 23:10:15,637 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2019-11-19 23:10:15,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-19 23:10:15,638 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:10:15,638 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:10:15,842 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:10:15,842 INFO L410 AbstractCegarLoop]: === Iteration 13 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 23:10:15,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:10:15,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1872926463, now seen corresponding path program 1 times [2019-11-19 23:10:15,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:10:15,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1644271925] [2019-11-19 23:10:15,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41be8b59-771b-42a8-9fcc-5b215e996269/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:10:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:10:16,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-19 23:10:16,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:10:16,133 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-11-19 23:10:16,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:16,136 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:16,136 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:10:16,136 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-19 23:10:16,184 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:16,185 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-11-19 23:10:16,185 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:16,205 INFO L567 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-11-19 23:10:16,206 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:10:16,206 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2019-11-19 23:10:16,234 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-11-19 23:10:16,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:16,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:16,246 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:10:16,246 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-11-19 23:10:16,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:10:16,286 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 23 treesize of output 22 [2019-11-19 23:10:16,287 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:16,315 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:16,316 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:10:16,316 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2019-11-19 23:10:16,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:10:16,489 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-19 23:10:16,490 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:16,491 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 58 treesize of output 113 [2019-11-19 23:10:16,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:10:16,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:16,577 INFO L567 ElimStorePlain]: treesize reduction 46, result has 55.8 percent of original size [2019-11-19 23:10:16,578 INFO L496 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-11-19 23:10:16,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:58 [2019-11-19 23:10:17,199 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:17,200 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 52 [2019-11-19 23:10:17,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:17,227 INFO L567 ElimStorePlain]: treesize reduction 14, result has 57.6 percent of original size [2019-11-19 23:10:17,228 INFO L496 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-11-19 23:10:17,228 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:19 [2019-11-19 23:10:17,371 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:10:17,371 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:10:17,929 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-11-19 23:10:18,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:18,777 INFO L567 ElimStorePlain]: treesize reduction 31, result has 13.9 percent of original size [2019-11-19 23:10:18,777 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:10:18,777 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:5 [2019-11-19 23:10:18,913 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:10:18,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1644271925] [2019-11-19 23:10:18,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:10:18,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2019-11-19 23:10:18,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40433933] [2019-11-19 23:10:18,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-19 23:10:18,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:10:18,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-19 23:10:18,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2019-11-19 23:10:18,916 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand 28 states. [2019-11-19 23:10:21,197 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-11-19 23:10:21,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:10:21,678 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2019-11-19 23:10:21,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-19 23:10:21,679 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 36 [2019-11-19 23:10:21,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:10:21,680 INFO L225 Difference]: With dead ends: 95 [2019-11-19 23:10:21,680 INFO L226 Difference]: Without dead ends: 95 [2019-11-19 23:10:21,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=233, Invalid=1327, Unknown=0, NotChecked=0, Total=1560 [2019-11-19 23:10:21,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-19 23:10:21,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2019-11-19 23:10:21,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-19 23:10:21,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2019-11-19 23:10:21,685 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 36 [2019-11-19 23:10:21,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:10:21,686 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2019-11-19 23:10:21,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-19 23:10:21,686 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2019-11-19 23:10:21,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-19 23:10:21,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:10:21,687 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:10:21,887 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:10:21,888 INFO L410 AbstractCegarLoop]: === Iteration 14 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 23:10:21,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:10:21,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1872926462, now seen corresponding path program 1 times [2019-11-19 23:10:21,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:10:21,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1643641748] [2019-11-19 23:10:21,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41be8b59-771b-42a8-9fcc-5b215e996269/bin/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:10:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:10:22,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-19 23:10:22,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:10:22,234 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-11-19 23:10:22,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:22,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:22,244 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-11-19 23:10:22,245 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:22,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:22,254 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:10:22,254 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-19 23:10:22,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:10:22,285 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-19 23:10:22,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:22,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:22,307 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:22,307 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-11-19 23:10:22,308 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:22,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:22,319 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:10:22,319 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-11-19 23:10:22,350 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-11-19 23:10:22,350 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:22,383 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:22,388 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-11-19 23:10:22,389 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:22,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:22,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:10:22,410 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2019-11-19 23:10:22,445 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:10:22,446 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 23 treesize of output 22 [2019-11-19 23:10:22,447 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:22,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:22,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:10:22,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-19 23:10:22,484 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:22,508 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:22,508 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:10:22,508 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:59 [2019-11-19 23:10:22,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:10:22,558 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 42 treesize of output 38 [2019-11-19 23:10:22,558 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:22,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:22,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:10:22,594 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 23:10:22,610 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:22,610 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 1 case distinctions, treesize of input 69 treesize of output 68 [2019-11-19 23:10:22,611 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:22,679 INFO L567 ElimStorePlain]: treesize reduction 30, result has 73.5 percent of original size [2019-11-19 23:10:22,679 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:10:22,679 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:105, output treesize:83 [2019-11-19 23:10:23,117 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:23,117 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 37 [2019-11-19 23:10:23,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:23,153 INFO L567 ElimStorePlain]: treesize reduction 8, result has 84.3 percent of original size [2019-11-19 23:10:23,157 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-19 23:10:23,157 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:23,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:23,169 INFO L496 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-11-19 23:10:23,169 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:18 [2019-11-19 23:10:23,315 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:10:23,315 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:10:24,876 WARN L191 SmtUtils]: Spent 767.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-19 23:10:25,221 WARN L191 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-19 23:10:25,541 WARN L191 SmtUtils]: Spent 319.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-19 23:10:25,795 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-19 23:10:27,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:27,681 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-19 23:10:27,681 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:27,699 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:27,849 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-19 23:10:27,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:27,859 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:31,566 WARN L191 SmtUtils]: Spent 3.71 s on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2019-11-19 23:10:31,566 INFO L567 ElimStorePlain]: treesize reduction 69, result has 61.9 percent of original size [2019-11-19 23:10:31,572 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:31,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:31,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-19 23:10:31,661 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:196, output treesize:109 [2019-11-19 23:10:32,015 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-11-19 23:10:32,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:10:32,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:10:32,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:10:32,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:10:32,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:10:32,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:10:32,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:10:32,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:10:32,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:10:32,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:10:32,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:10:32,562 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-11-19 23:10:33,174 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:10:33,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1643641748] [2019-11-19 23:10:33,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:10:33,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2019-11-19 23:10:33,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879769336] [2019-11-19 23:10:33,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-19 23:10:33,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:10:33,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-19 23:10:33,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2019-11-19 23:10:33,176 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 29 states. [2019-11-19 23:10:35,566 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-11-19 23:10:36,309 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-11-19 23:10:36,805 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-11-19 23:10:37,615 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-11-19 23:10:38,398 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-11-19 23:10:39,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:10:39,748 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2019-11-19 23:10:39,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-19 23:10:39,750 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 36 [2019-11-19 23:10:39,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:10:39,753 INFO L225 Difference]: With dead ends: 128 [2019-11-19 23:10:39,753 INFO L226 Difference]: Without dead ends: 128 [2019-11-19 23:10:39,754 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=272, Invalid=1534, Unknown=0, NotChecked=0, Total=1806 [2019-11-19 23:10:39,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-19 23:10:39,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 100. [2019-11-19 23:10:39,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-19 23:10:39,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 112 transitions. [2019-11-19 23:10:39,768 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 112 transitions. Word has length 36 [2019-11-19 23:10:39,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:10:39,770 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 112 transitions. [2019-11-19 23:10:39,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-19 23:10:39,771 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2019-11-19 23:10:39,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-19 23:10:39,778 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:10:39,778 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:10:39,978 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:10:39,979 INFO L410 AbstractCegarLoop]: === Iteration 15 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 23:10:39,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:10:39,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1806256267, now seen corresponding path program 1 times [2019-11-19 23:10:39,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:10:39,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1418579978] [2019-11-19 23:10:39,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41be8b59-771b-42a8-9fcc-5b215e996269/bin/uautomizer/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-11-19 23:10:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:10:40,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 23:10:40,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:10:40,286 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-19 23:10:40,286 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:10:40,381 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-19 23:10:40,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1418579978] [2019-11-19 23:10:40,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:10:40,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-19 23:10:40,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273237904] [2019-11-19 23:10:40,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 23:10:40,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:10:40,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 23:10:40,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-19 23:10:40,382 INFO L87 Difference]: Start difference. First operand 100 states and 112 transitions. Second operand 12 states. [2019-11-19 23:10:40,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:10:40,542 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2019-11-19 23:10:40,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 23:10:40,543 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2019-11-19 23:10:40,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:10:40,544 INFO L225 Difference]: With dead ends: 74 [2019-11-19 23:10:40,544 INFO L226 Difference]: Without dead ends: 74 [2019-11-19 23:10:40,544 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-11-19 23:10:40,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-19 23:10:40,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2019-11-19 23:10:40,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-19 23:10:40,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2019-11-19 23:10:40,547 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 47 [2019-11-19 23:10:40,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:10:40,547 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2019-11-19 23:10:40,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 23:10:40,548 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2019-11-19 23:10:40,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-19 23:10:40,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:10:40,549 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:10:40,749 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:10:40,749 INFO L410 AbstractCegarLoop]: === Iteration 16 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 23:10:40,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:10:40,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1638577000, now seen corresponding path program 1 times [2019-11-19 23:10:40,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:10:40,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [162379873] [2019-11-19 23:10:40,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41be8b59-771b-42a8-9fcc-5b215e996269/bin/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:10:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:10:41,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 23:10:41,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:10:41,045 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:41,046 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-11-19 23:10:41,046 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:41,060 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-19 23:10:41,060 INFO L496 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-11-19 23:10:41,061 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-19 23:10:41,236 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-19 23:10:41,236 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:10:41,357 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-19 23:10:41,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [162379873] [2019-11-19 23:10:41,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:10:41,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 9 [2019-11-19 23:10:41,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561912580] [2019-11-19 23:10:41,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 23:10:41,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:10:41,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 23:10:41,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-19 23:10:41,359 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 10 states. [2019-11-19 23:10:41,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:10:41,941 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2019-11-19 23:10:41,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 23:10:41,942 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-11-19 23:10:41,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:10:41,942 INFO L225 Difference]: With dead ends: 81 [2019-11-19 23:10:41,942 INFO L226 Difference]: Without dead ends: 81 [2019-11-19 23:10:41,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 95 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-19 23:10:41,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-19 23:10:41,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2019-11-19 23:10:41,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-19 23:10:41,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-11-19 23:10:41,946 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 54 [2019-11-19 23:10:41,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:10:41,946 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-11-19 23:10:41,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 23:10:41,946 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-11-19 23:10:41,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-19 23:10:41,947 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:10:41,947 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:10:42,148 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:10:42,148 INFO L410 AbstractCegarLoop]: === Iteration 17 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 23:10:42,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:10:42,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1638576999, now seen corresponding path program 1 times [2019-11-19 23:10:42,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:10:42,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [860395630] [2019-11-19 23:10:42,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41be8b59-771b-42a8-9fcc-5b215e996269/bin/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:10:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:10:42,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-19 23:10:42,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:10:42,443 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-11-19 23:10:42,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:42,448 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:42,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:10:42,449 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-19 23:10:42,634 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-19 23:10:42,634 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:10:43,238 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-19 23:10:43,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [860395630] [2019-11-19 23:10:43,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:10:43,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 16 [2019-11-19 23:10:43,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869872215] [2019-11-19 23:10:43,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-19 23:10:43,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:10:43,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-19 23:10:43,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-11-19 23:10:43,240 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 17 states. [2019-11-19 23:10:44,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:10:44,450 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-11-19 23:10:44,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 23:10:44,451 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-11-19 23:10:44,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:10:44,452 INFO L225 Difference]: With dead ends: 76 [2019-11-19 23:10:44,452 INFO L226 Difference]: Without dead ends: 76 [2019-11-19 23:10:44,453 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2019-11-19 23:10:44,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-19 23:10:44,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2019-11-19 23:10:44,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-19 23:10:44,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2019-11-19 23:10:44,456 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 54 [2019-11-19 23:10:44,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:10:44,456 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2019-11-19 23:10:44,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-19 23:10:44,457 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2019-11-19 23:10:44,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-19 23:10:44,457 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:10:44,457 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:10:44,662 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:10:44,662 INFO L410 AbstractCegarLoop]: === Iteration 18 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 23:10:44,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:10:44,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1749578557, now seen corresponding path program 1 times [2019-11-19 23:10:44,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:10:44,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1624202187] [2019-11-19 23:10:44,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41be8b59-771b-42a8-9fcc-5b215e996269/bin/uautomizer/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-11-19 23:10:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:10:44,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-19 23:10:44,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:10:44,919 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-19 23:10:44,919 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:10:45,051 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-19 23:10:45,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1624202187] [2019-11-19 23:10:45,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:10:45,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 10 [2019-11-19 23:10:45,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917767171] [2019-11-19 23:10:45,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 23:10:45,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:10:45,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 23:10:45,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-19 23:10:45,053 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 10 states. [2019-11-19 23:10:45,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:10:45,374 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2019-11-19 23:10:45,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 23:10:45,375 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-11-19 23:10:45,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:10:45,376 INFO L225 Difference]: With dead ends: 76 [2019-11-19 23:10:45,376 INFO L226 Difference]: Without dead ends: 74 [2019-11-19 23:10:45,376 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-11-19 23:10:45,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-19 23:10:45,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2019-11-19 23:10:45,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-19 23:10:45,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2019-11-19 23:10:45,379 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 57 [2019-11-19 23:10:45,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:10:45,379 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2019-11-19 23:10:45,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 23:10:45,379 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2019-11-19 23:10:45,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-19 23:10:45,380 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:10:45,380 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:10:45,583 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:10:45,583 INFO L410 AbstractCegarLoop]: === Iteration 19 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 23:10:45,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:10:45,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1750862519, now seen corresponding path program 1 times [2019-11-19 23:10:45,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:10:45,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1371778357] [2019-11-19 23:10:45,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41be8b59-771b-42a8-9fcc-5b215e996269/bin/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:10:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:10:45,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 23:10:45,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:10:46,060 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-19 23:10:46,060 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:10:46,219 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-19 23:10:46,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1371778357] [2019-11-19 23:10:46,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:10:46,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 16 [2019-11-19 23:10:46,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698373727] [2019-11-19 23:10:46,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-19 23:10:46,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:10:46,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-19 23:10:46,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-11-19 23:10:46,221 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 17 states. [2019-11-19 23:10:46,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:10:46,762 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2019-11-19 23:10:46,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 23:10:46,763 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2019-11-19 23:10:46,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:10:46,764 INFO L225 Difference]: With dead ends: 72 [2019-11-19 23:10:46,764 INFO L226 Difference]: Without dead ends: 72 [2019-11-19 23:10:46,764 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2019-11-19 23:10:46,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-19 23:10:46,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-11-19 23:10:46,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-19 23:10:46,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2019-11-19 23:10:46,768 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 57 [2019-11-19 23:10:46,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:10:46,768 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2019-11-19 23:10:46,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-19 23:10:46,768 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2019-11-19 23:10:46,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-19 23:10:46,769 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:10:46,769 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:10:46,979 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:10:46,980 INFO L410 AbstractCegarLoop]: === Iteration 20 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 23:10:46,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:10:46,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1862509245, now seen corresponding path program 1 times [2019-11-19 23:10:46,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:10:46,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [185065347] [2019-11-19 23:10:46,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41be8b59-771b-42a8-9fcc-5b215e996269/bin/uautomizer/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:10:47,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:10:47,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-19 23:10:47,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:10:47,462 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-11-19 23:10:47,463 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:47,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:47,469 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:10:47,469 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-19 23:10:47,509 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:47,510 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-11-19 23:10:47,510 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:47,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:47,515 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:10:47,515 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-11-19 23:10:47,528 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-11-19 23:10:47,528 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:47,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:47,538 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:10:47,538 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-11-19 23:10:47,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:10:47,559 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 23 treesize of output 22 [2019-11-19 23:10:47,559 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:10:47,570 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:47,570 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:10:47,570 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-11-19 23:10:47,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:10:47,657 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:47,658 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 3 case distinctions, treesize of input 56 treesize of output 111 [2019-11-19 23:10:47,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:10:47,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:10:47,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-19 23:10:47,723 INFO L567 ElimStorePlain]: treesize reduction 168, result has 23.6 percent of original size [2019-11-19 23:10:47,724 INFO L496 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-11-19 23:10:47,724 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2019-11-19 23:10:48,016 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:10:48,016 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 40 treesize of output 49 [2019-11-19 23:10:48,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:10:48,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:10:48,018 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:10:48,033 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-19 23:10:48,034 INFO L496 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-11-19 23:10:48,034 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:11 [2019-11-19 23:11:06,422 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 25 [2019-11-19 23:11:06,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:11:06,627 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-19 23:11:06,627 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:11:06,627 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 6 case distinctions, treesize of input 81 treesize of output 185 [2019-11-19 23:11:06,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:11:06,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:11:06,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:11:06,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:11:06,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:11:06,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:11:06,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:11:06,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:11:06,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:11:06,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:11:06,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:11:06,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:11:06,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:11:06,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:11:06,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:11:06,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:11:06,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:11:06,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:11:06,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:11:06,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:11:06,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:11:06,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:11:06,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:11:06,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:11:06,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:11:06,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:11:06,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:11:06,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:11:06,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:11:06,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:11:06,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:11:06,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:11:06,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:11:06,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:11:06,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:11:06,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:11:06,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:11:06,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:11:06,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:11:06,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:11:06,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:11:06,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:11:06,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:11:06,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:11:06,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:11:06,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:11:06,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:11:06,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:11:06,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:11:06,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:11:06,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:11:06,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:11:06,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 19 xjuncts. [2019-11-19 23:11:39,777 WARN L191 SmtUtils]: Spent 33.11 s on a formula simplification. DAG size of input: 89 DAG size of output: 41 [2019-11-19 23:11:39,778 INFO L567 ElimStorePlain]: treesize reduction 5605, result has 2.8 percent of original size [2019-11-19 23:11:39,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:11:39,779 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-19 23:11:39,779 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:91, output treesize:125 [2019-11-19 23:11:39,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:11:41,925 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:11:41,926 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2019-11-19 23:11:41,927 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:11:41,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:11:41,938 INFO L496 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-11-19 23:11:41,939 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:11 [2019-11-19 23:11:44,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:11:44,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:11:44,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:11:44,121 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:11:44,121 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 1 case distinctions, treesize of input 48 treesize of output 33 [2019-11-19 23:11:44,122 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:11:44,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:11:44,146 INFO L496 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-11-19 23:11:44,146 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:43 [2019-11-19 23:11:50,411 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:11:50,411 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2019-11-19 23:11:50,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:11:50,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:11:50,417 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:11:50,417 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:10 [2019-11-19 23:11:54,563 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-19 23:11:54,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:11:54,574 INFO L567 ElimStorePlain]: treesize reduction 4, result has 76.5 percent of original size [2019-11-19 23:11:54,574 INFO L496 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-11-19 23:11:54,574 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:13 [2019-11-19 23:11:56,662 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 15 refuted. 2 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-19 23:11:56,662 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:12:07,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:12:07,145 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:12:07,148 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:12:07,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:12:07,155 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-19 23:12:07,155 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:28 [2019-11-19 23:12:11,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:12:11,386 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:12:11,394 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:12:11,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:12:11,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-19 23:12:11,465 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:102, output treesize:86 [2019-11-19 23:12:15,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:12:15,861 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:12:15,864 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:12:15,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:12:15,879 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-19 23:12:15,879 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:64 [2019-11-19 23:12:18,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:12:18,082 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:12:18,085 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:12:18,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:12:18,131 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-19 23:12:18,132 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:88 [2019-11-19 23:12:19,532 WARN L191 SmtUtils]: Spent 1.21 s on a formula simplification that was a NOOP. DAG size: 40 [2019-11-19 23:12:21,404 WARN L191 SmtUtils]: Spent 1.71 s on a formula simplification that was a NOOP. DAG size: 39 [2019-11-19 23:12:23,300 WARN L191 SmtUtils]: Spent 1.69 s on a formula simplification that was a NOOP. DAG size: 43 [2019-11-19 23:12:25,964 WARN L191 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-11-19 23:12:26,192 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-19 23:12:26,324 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-19 23:12:32,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:12:32,665 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 27 treesize of output 25 [2019-11-19 23:12:32,666 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:12:32,686 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:12:32,687 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 30 treesize of output 34 [2019-11-19 23:12:32,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:12:32,687 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:12:32,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:12:32,698 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-19 23:12:32,698 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:40 [2019-11-19 23:12:35,299 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-19 23:12:35,322 INFO L567 ElimStorePlain]: treesize reduction 65, result has 5.8 percent of original size [2019-11-19 23:12:35,322 INFO L464 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2019-11-19 23:12:35,322 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:12:35,322 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:80, output treesize:4 [2019-11-19 23:12:37,432 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-19 23:12:37,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [185065347] [2019-11-19 23:12:37,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:12:37,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 38 [2019-11-19 23:12:37,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327037137] [2019-11-19 23:12:37,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-11-19 23:12:37,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:12:37,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-11-19 23:12:37,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1340, Unknown=21, NotChecked=0, Total=1482 [2019-11-19 23:12:37,434 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 39 states. [2019-11-19 23:13:35,192 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-19 23:14:17,509 WARN L191 SmtUtils]: Spent 12.16 s on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-11-19 23:14:44,347 WARN L191 SmtUtils]: Spent 16.33 s on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-11-19 23:15:00,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:15:00,511 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2019-11-19 23:15:00,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-19 23:15:00,512 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 60 [2019-11-19 23:15:00,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:15:00,513 INFO L225 Difference]: With dead ends: 91 [2019-11-19 23:15:00,513 INFO L226 Difference]: Without dead ends: 91 [2019-11-19 23:15:00,514 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 73 SyntacticMatches, 9 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 132.4s TimeCoverageRelationStatistics Valid=354, Invalid=3164, Unknown=22, NotChecked=0, Total=3540 [2019-11-19 23:15:00,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-19 23:15:00,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 75. [2019-11-19 23:15:00,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-19 23:15:00,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-11-19 23:15:00,517 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 60 [2019-11-19 23:15:00,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:15:00,517 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2019-11-19 23:15:00,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-11-19 23:15:00,517 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2019-11-19 23:15:00,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-19 23:15:00,518 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:15:00,518 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:15:00,723 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:15:00,723 INFO L410 AbstractCegarLoop]: === Iteration 21 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 23:15:00,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:15:00,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1862509246, now seen corresponding path program 1 times [2019-11-19 23:15:00,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:15:00,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1674652728] [2019-11-19 23:15:00,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41be8b59-771b-42a8-9fcc-5b215e996269/bin/uautomizer/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-11-19 23:15:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:15:01,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 61 conjunts are in the unsatisfiable core [2019-11-19 23:15:01,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:15:01,211 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-11-19 23:15:01,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:15:01,219 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:15:01,222 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-19 23:15:01,222 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:15:01,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:15:01,229 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:15:01,229 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-19 23:15:01,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:15:01,255 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-19 23:15:01,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:15:01,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:15:01,277 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:15:01,277 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-11-19 23:15:01,278 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:15:01,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:15:01,289 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:15:01,289 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-11-19 23:15:01,311 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-11-19 23:15:01,312 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:15:01,334 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:15:01,338 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-11-19 23:15:01,339 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:15:01,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:15:01,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:15:01,359 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2019-11-19 23:15:01,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:15:01,396 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 23 treesize of output 22 [2019-11-19 23:15:01,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:15:01,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:15:01,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:15:01,438 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 23 treesize of output 22 [2019-11-19 23:15:01,439 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:15:01,480 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:15:01,481 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:15:01,481 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:59 [2019-11-19 23:15:01,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:15:01,547 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 23:15:01,564 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:15:01,564 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 1 case distinctions, treesize of input 79 treesize of output 72 [2019-11-19 23:15:01,565 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:15:01,638 INFO L567 ElimStorePlain]: treesize reduction 30, result has 75.6 percent of original size [2019-11-19 23:15:01,645 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:15:01,646 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 42 treesize of output 38 [2019-11-19 23:15:01,647 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:15:01,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:15:01,676 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:15:01,676 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:105, output treesize:83 [2019-11-19 23:15:02,254 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:15:02,254 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 34 [2019-11-19 23:15:02,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:15:02,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:15:02,256 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:15:02,328 INFO L567 ElimStorePlain]: treesize reduction 8, result has 84.6 percent of original size [2019-11-19 23:15:02,333 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-19 23:15:02,334 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:15:02,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:15:02,366 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 23:15:02,367 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:23 [2019-11-19 23:15:02,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:15:02,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:15:02,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:15:02,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:15:02,936 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 23:15:02,944 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:15:02,944 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 147 treesize of output 109 [2019-11-19 23:15:02,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:15:03,114 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-11-19 23:15:03,114 INFO L567 ElimStorePlain]: treesize reduction 20, result has 87.8 percent of original size [2019-11-19 23:15:03,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:15:03,139 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:15:03,139 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 99 [2019-11-19 23:15:03,140 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:15:03,226 INFO L567 ElimStorePlain]: treesize reduction 50, result has 66.4 percent of original size [2019-11-19 23:15:03,227 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 23:15:03,227 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:189, output treesize:99 [2019-11-19 23:15:03,312 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-11-19 23:15:03,312 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:15:03,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:15:03,354 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:15:03,354 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 29 [2019-11-19 23:15:03,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:15:03,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:15:03,356 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:15:03,399 INFO L567 ElimStorePlain]: treesize reduction 8, result has 72.4 percent of original size [2019-11-19 23:15:03,400 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 23:15:03,400 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:74, output treesize:21 [2019-11-19 23:15:03,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:15:03,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:15:03,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:15:03,634 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 47 treesize of output 41 [2019-11-19 23:15:03,634 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:15:03,694 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:15:03,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:15:03,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:15:03,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:15:03,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:15:03,704 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 23:15:03,711 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:15:03,711 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 59 [2019-11-19 23:15:03,712 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:15:03,793 INFO L567 ElimStorePlain]: treesize reduction 20, result has 83.2 percent of original size [2019-11-19 23:15:03,793 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 23:15:03,794 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:129, output treesize:99 [2019-11-19 23:15:04,088 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:15:04,088 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 37 [2019-11-19 23:15:04,089 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:15:04,145 INFO L567 ElimStorePlain]: treesize reduction 8, result has 84.3 percent of original size [2019-11-19 23:15:04,149 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-19 23:15:04,149 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:15:04,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:15:04,158 INFO L496 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-11-19 23:15:04,159 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:18 [2019-11-19 23:15:04,453 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-19 23:15:04,454 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:15:06,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:15:06,025 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:15:06,031 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:15:06,035 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:15:06,091 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:15:06,096 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:15:06,101 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:15:06,105 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:15:06,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:15:06,125 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-19 23:15:06,125 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:149, output treesize:65 [2019-11-19 23:15:06,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:15:06,799 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:15:06,826 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:15:06,834 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:15:07,000 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-19 23:15:07,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:15:07,009 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:15:07,017 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:15:07,027 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:15:07,240 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-19 23:15:07,241 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:15:07,241 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-19 23:15:07,242 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:305, output treesize:249 [2019-11-19 23:15:07,949 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-19 23:15:08,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:15:08,567 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:15:08,574 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:15:08,604 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:15:08,789 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-19 23:15:08,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:15:08,798 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 23:15:08,809 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-19 23:15:08,815 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:15:08,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:15:08,905 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-19 23:15:08,905 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:329, output treesize:180 [2019-11-19 23:15:10,998 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-19 23:15:11,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:15:11,031 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:15:11,057 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:15:11,071 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:15:11,707 WARN L191 SmtUtils]: Spent 635.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-19 23:15:11,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:15:11,754 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 23:15:11,791 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-19 23:15:11,809 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:15:12,219 WARN L191 SmtUtils]: Spent 410.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-11-19 23:15:12,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:15:12,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-19 23:15:12,221 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:695, output treesize:639 [2019-11-19 23:15:13,775 WARN L191 SmtUtils]: Spent 372.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-19 23:15:16,561 WARN L191 SmtUtils]: Spent 1.24 s on a formula simplification that was a NOOP. DAG size: 90 [2019-11-19 23:15:16,576 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 64 [2019-11-19 23:15:21,658 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 158 [2019-11-19 23:15:21,670 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 64 [2019-11-19 23:15:36,265 WARN L191 SmtUtils]: Spent 11.29 s on a formula simplification. DAG size of input: 224 DAG size of output: 93 [2019-11-19 23:15:43,914 WARN L191 SmtUtils]: Spent 2.35 s on a formula simplification that was a NOOP. DAG size: 92 [2019-11-19 23:15:45,623 WARN L191 SmtUtils]: Spent 1.13 s on a formula simplification that was a NOOP. DAG size: 81 [2019-11-19 23:15:45,897 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-19 23:15:46,242 WARN L191 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-19 23:15:46,561 WARN L191 SmtUtils]: Spent 318.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-19 23:15:48,468 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-19 23:15:53,365 INFO L392 ElimStorePlain]: Different costs {2=[v_prenex_22, v_prenex_20], 5=[v_prenex_23, |#memory_$Pointer$.base|, v_prenex_21, |#memory_$Pointer$.offset|]} [2019-11-19 23:15:53,521 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:15:59,002 WARN L191 SmtUtils]: Spent 5.48 s on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-11-19 23:15:59,003 INFO L567 ElimStorePlain]: treesize reduction 183, result has 79.6 percent of original size [2019-11-19 23:15:59,058 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:16:00,910 WARN L191 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-11-19 23:16:00,910 INFO L567 ElimStorePlain]: treesize reduction 106, result has 85.2 percent of original size [2019-11-19 23:16:01,020 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:16:05,356 WARN L191 SmtUtils]: Spent 4.33 s on a formula simplification. DAG size of input: 102 DAG size of output: 82 [2019-11-19 23:16:05,356 INFO L567 ElimStorePlain]: treesize reduction 346, result has 60.1 percent of original size [2019-11-19 23:16:05,392 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 23:16:10,588 WARN L191 SmtUtils]: Spent 5.20 s on a formula simplification. DAG size of input: 111 DAG size of output: 75 [2019-11-19 23:16:10,588 INFO L567 ElimStorePlain]: treesize reduction 1804, result has 18.4 percent of original size [2019-11-19 23:16:10,634 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-19 23:16:12,550 WARN L191 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 91 DAG size of output: 70 [2019-11-19 23:16:12,550 INFO L567 ElimStorePlain]: treesize reduction 336, result has 53.8 percent of original size [2019-11-19 23:16:12,564 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 23:16:12,570 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-19 23:16:13,873 WARN L191 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 108 DAG size of output: 58 [2019-11-19 23:16:13,873 INFO L567 ElimStorePlain]: treesize reduction 600, result has 25.2 percent of original size [2019-11-19 23:16:13,876 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2019-11-19 23:16:13,876 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:930, output treesize:157 [2019-11-19 23:16:14,679 WARN L191 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-11-19 23:16:14,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 23:16:14,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:16:14,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:16:14,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:16:14,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:16:14,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:16:14,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:16:14,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:16:16,492 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2019-11-19 23:16:21,155 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 23:16:21,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1674652728] [2019-11-19 23:16:21,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:16:21,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 45 [2019-11-19 23:16:21,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462121390] [2019-11-19 23:16:21,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-11-19 23:16:21,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:16:21,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-11-19 23:16:21,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1897, Unknown=3, NotChecked=0, Total=2070 [2019-11-19 23:16:21,157 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 46 states. [2019-11-19 23:16:35,942 WARN L191 SmtUtils]: Spent 11.75 s on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2019-11-19 23:16:43,928 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 71 [2019-11-19 23:16:45,110 WARN L191 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 98 [2019-11-19 23:16:46,813 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-11-19 23:16:47,817 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-19 23:16:49,483 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2019-11-19 23:16:59,467 WARN L191 SmtUtils]: Spent 3.27 s on a formula simplification. DAG size of input: 175 DAG size of output: 87 [2019-11-19 23:17:07,783 WARN L191 SmtUtils]: Spent 3.44 s on a formula simplification. DAG size of input: 160 DAG size of output: 117 [2019-11-19 23:17:09,465 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-11-19 23:17:10,488 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-11-19 23:17:11,194 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-11-19 23:17:12,468 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2019-11-19 23:17:14,892 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-11-19 23:17:15,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:17:15,609 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2019-11-19 23:17:15,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-19 23:17:15,610 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 60 [2019-11-19 23:17:15,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:17:15,611 INFO L225 Difference]: With dead ends: 89 [2019-11-19 23:17:15,611 INFO L226 Difference]: Without dead ends: 89 [2019-11-19 23:17:15,613 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 69 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 86.0s TimeCoverageRelationStatistics Valid=493, Invalid=4060, Unknown=3, NotChecked=0, Total=4556 [2019-11-19 23:17:15,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-19 23:17:15,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 77. [2019-11-19 23:17:15,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-19 23:17:15,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2019-11-19 23:17:15,616 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 60 [2019-11-19 23:17:15,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:17:15,616 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2019-11-19 23:17:15,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-11-19 23:17:15,616 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2019-11-19 23:17:15,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-19 23:17:15,617 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:17:15,617 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:17:15,821 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:17:15,822 INFO L410 AbstractCegarLoop]: === Iteration 22 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-19 23:17:15,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:17:15,822 INFO L82 PathProgramCache]: Analyzing trace with hash -670880008, now seen corresponding path program 1 times [2019-11-19 23:17:15,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:17:15,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [172116663] [2019-11-19 23:17:15,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41be8b59-771b-42a8-9fcc-5b215e996269/bin/uautomizer/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:17:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:17:16,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-19 23:17:16,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:17:16,278 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-19 23:17:16,278 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:17:16,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:17:16,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:17:16,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2019-11-19 23:17:16,303 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:17:16,303 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 11 treesize of output 15 [2019-11-19 23:17:16,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:17:16,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:17:16,310 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:17:16,310 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2019-11-19 23:17:16,330 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-11-19 23:17:16,331 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:17:16,347 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:17:16,347 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:17:16,347 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-19 23:17:16,369 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:17:16,369 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 23 treesize of output 22 [2019-11-19 23:17:16,370 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:17:16,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:17:16,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:17:16,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-11-19 23:17:16,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:17:16,487 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:17:16,487 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 3 case distinctions, treesize of input 55 treesize of output 110 [2019-11-19 23:17:16,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:17:16,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:17:16,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:17:16,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:17:16,539 INFO L567 ElimStorePlain]: treesize reduction 101, result has 32.7 percent of original size [2019-11-19 23:17:16,539 INFO L496 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-11-19 23:17:16,540 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:48 [2019-11-19 23:17:19,026 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_update_at_~head.offset (_ BitVec 32))) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base|) (bvadd |c_dll_update_at_#in~head.offset| (_ bv4 32))))) (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) dll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| .cse0) dll_update_at_~head.offset)))) |c_#memory_$Pointer$.base|)) is different from true [2019-11-19 23:17:19,034 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 23:17:19,263 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-19 23:17:19,264 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:17:19,264 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 235 [2019-11-19 23:17:19,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:17:19,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:17:19,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:17:19,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:17:19,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:17:19,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:17:19,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:17:19,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:17:19,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:17:19,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:17:19,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:17:19,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:17:19,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:17:19,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:17:19,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:17:19,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:17:19,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:17:19,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:17:19,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:17:19,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:17:19,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:17:19,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:17:19,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:17:19,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:17:19,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:17:19,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:17:19,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:17:19,279 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 11 xjuncts. [2019-11-19 23:17:33,914 WARN L191 SmtUtils]: Spent 14.63 s on a formula simplification. DAG size of input: 69 DAG size of output: 31 [2019-11-19 23:17:33,914 INFO L567 ElimStorePlain]: treesize reduction 2649, result has 4.3 percent of original size [2019-11-19 23:17:33,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:17:33,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 23:17:33,915 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:73, output treesize:78 [2019-11-19 23:17:33,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:17:34,082 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:17:34,082 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 1 case distinctions, treesize of input 39 treesize of output 26 [2019-11-19 23:17:34,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:17:34,091 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:17:34,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:17:34,092 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:27 [2019-11-19 23:17:34,529 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2019-11-19 23:17:34,529 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:17:35,053 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:17:35,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:17:35,056 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:17:35,056 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:13 [2019-11-19 23:17:35,189 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:17:35,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:17:35,199 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:17:35,199 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:28 [2019-11-19 23:17:35,443 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:17:35,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:17:35,447 INFO L496 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-11-19 23:17:35,447 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:30 [2019-11-19 23:17:35,727 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:17:35,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:17:35,965 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:17:35,965 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported: (exists ((v_DerPreprocessor_35 (_ BitVec 32)) (v_dll_update_at_~head.offset_79 (_ BitVec 32))) (forall ((v_DerPreprocessor_36 (_ BitVec 32)) (dll_update_at_~head.offset (_ BitVec 32))) (let ((.cse0 (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))) (or (not (= (select (select (store |#memory_$Pointer$.base| dll_update_at_~head.base (store (select |#memory_$Pointer$.base| dll_update_at_~head.base) dll_update_at_~head.offset v_DerPreprocessor_36)) |dll_update_at_#in~head.base|) .cse0) (_ bv0 32))) (= (_ bv0 32) (select (select (let ((.cse1 (select (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) .cse0))) (store |old(#memory_$Pointer$.base)| .cse1 (store (select |old(#memory_$Pointer$.base)| .cse1) v_dll_update_at_~head.offset_79 v_DerPreprocessor_35))) |dll_update_at_#in~head.base|) .cse0)))))) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:667) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:493) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) 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.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) 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.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-11-19 23:17:35,968 INFO L168 Benchmark]: Toolchain (without parser) took 453437.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -127.0 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. [2019-11-19 23:17:35,969 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:17:35,969 INFO L168 Benchmark]: CACSL2BoogieTranslator took 579.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-19 23:17:35,969 INFO L168 Benchmark]: Boogie Preprocessor took 67.88 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-19 23:17:35,969 INFO L168 Benchmark]: RCFGBuilder took 991.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. [2019-11-19 23:17:35,969 INFO L168 Benchmark]: TraceAbstraction took 451796.24 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 35.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -29.9 MB). Peak memory consumption was 5.7 MB. Max. memory is 11.5 GB. [2019-11-19 23:17:35,971 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 579.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.88 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 991.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 451796.24 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 35.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -29.9 MB). Peak memory consumption was 5.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported: (exists ((v_DerPreprocessor_35 (_ BitVec 32)) (v_dll_update_at_~head.offset_79 (_ BitVec 32))) (forall ((v_DerPreprocessor_36 (_ BitVec 32)) (dll_update_at_~head.offset (_ BitVec 32))) (let ((.cse0 (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))) (or (not (= (select (select (store |#memory_$Pointer$.base| dll_update_at_~head.base (store (select |#memory_$Pointer$.base| dll_update_at_~head.base) dll_update_at_~head.offset v_DerPreprocessor_36)) |dll_update_at_#in~head.base|) .cse0) (_ bv0 32))) (= (_ bv0 32) (select (select (let ((.cse1 (select (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) .cse0))) (store |old(#memory_$Pointer$.base)| .cse1 (store (select |old(#memory_$Pointer$.base)| .cse1) v_dll_update_at_~head.offset_79 v_DerPreprocessor_35))) |dll_update_at_#in~head.base|) .cse0)))))) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: (exists ((v_DerPreprocessor_35 (_ BitVec 32)) (v_dll_update_at_~head.offset_79 (_ BitVec 32))) (forall ((v_DerPreprocessor_36 (_ BitVec 32)) (dll_update_at_~head.offset (_ BitVec 32))) (let ((.cse0 (bvadd |dll_update_at_#in~head.offset| (_ bv4 32)))) (or (not (= (select (select (store |#memory_$Pointer$.base| dll_update_at_~head.base (store (select |#memory_$Pointer$.base| dll_update_at_~head.base) dll_update_at_~head.offset v_DerPreprocessor_36)) |dll_update_at_#in~head.base|) .cse0) (_ bv0 32))) (= (_ bv0 32) (select (select (let ((.cse1 (select (select |old(#memory_$Pointer$.base)| |dll_update_at_#in~head.base|) .cse0))) (store |old(#memory_$Pointer$.base)| .cse1 (store (select |old(#memory_$Pointer$.base)| .cse1) v_dll_update_at_~head.offset_79 v_DerPreprocessor_35))) |dll_update_at_#in~head.base|) .cse0)))))): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:667) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...