./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/getNumbers1-2.c --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_c9720764-799f-403c-80f2-516aa17688bc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c9720764-799f-403c-80f2-516aa17688bc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c9720764-799f-403c-80f2-516aa17688bc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c9720764-799f-403c-80f2-516aa17688bc/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/getNumbers1-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c9720764-799f-403c-80f2-516aa17688bc/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c9720764-799f-403c-80f2-516aa17688bc/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 60fa12f4a8e344f82de5faf31b8f2cbfbaaacd93 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported: (forall ((v_arrayElimCell_11 (_ BitVec 32))) (exists ((v_arrayElimCell_8 (_ BitVec 32))) (let ((.cse0 (bvadd |~#array~0.offset| (_ bv4 32))) (.cse1 (bvadd |~#array~0.offset| (_ bv12 32))) (.cse2 (bvmul getNumbers_~i~0 (_ bv4 32)))) (or (and (bvsle .cse0 v_arrayElimCell_8) (not (bvsle .cse1 v_arrayElimCell_8)) (bvsle (bvadd |~#array~0.offset| (_ bv32 32)) v_arrayElimCell_8)) (not (bvsle .cse0 v_arrayElimCell_11)) (not (bvsle (_ bv0 32) (bvadd |~#array~0.offset| (_ bv8 32)))) (not (bvsle (bvadd .cse2 |~#array~0.offset| (_ bv32 32)) v_arrayElimCell_11)) (bvsle .cse1 v_arrayElimCell_11) (not (bvsle (bvadd .cse2 |~#array~0.offset| (_ bv4 32)) v_arrayElimCell_11)))))) --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 00:47:36,428 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:47:36,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:47:36,443 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:47:36,444 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:47:36,445 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:47:36,446 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:47:36,455 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:47:36,459 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:47:36,463 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:47:36,463 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:47:36,464 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:47:36,465 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:47:36,467 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:47:36,467 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:47:36,468 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:47:36,469 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:47:36,470 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:47:36,472 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:47:36,475 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:47:36,479 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:47:36,480 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:47:36,483 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:47:36,484 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:47:36,487 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:47:36,487 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:47:36,487 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:47:36,488 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:47:36,489 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:47:36,489 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:47:36,490 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:47:36,490 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:47:36,491 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:47:36,492 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:47:36,492 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:47:36,493 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:47:36,493 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:47:36,493 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:47:36,493 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:47:36,494 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:47:36,495 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:47:36,496 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c9720764-799f-403c-80f2-516aa17688bc/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-20 00:47:36,508 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:47:36,508 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:47:36,509 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:47:36,509 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:47:36,509 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 00:47:36,509 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:47:36,509 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 00:47:36,509 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 00:47:36,510 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 00:47:36,510 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 00:47:36,510 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:47:36,510 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-20 00:47:36,510 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-20 00:47:36,510 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-20 00:47:36,510 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 00:47:36,511 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 00:47:36,511 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 00:47:36,511 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 00:47:36,511 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:47:36,511 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:47:36,511 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 00:47:36,512 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 00:47:36,512 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 00:47:36,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:47:36,512 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:47:36,512 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 00:47:36,512 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 00:47:36,513 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 00:47:36,513 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 00:47:36,513 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_c9720764-799f-403c-80f2-516aa17688bc/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 -> 60fa12f4a8e344f82de5faf31b8f2cbfbaaacd93 [2019-11-20 00:47:36,655 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:47:36,666 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:47:36,668 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:47:36,669 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:47:36,670 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:47:36,670 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c9720764-799f-403c-80f2-516aa17688bc/bin/uautomizer/../../sv-benchmarks/c/memsafety-ext3/getNumbers1-2.c [2019-11-20 00:47:36,719 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c9720764-799f-403c-80f2-516aa17688bc/bin/uautomizer/data/6aa8710ce/7e1c86accf074ea59197e11c0766f12b/FLAG7050d9f8a [2019-11-20 00:47:37,092 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:47:37,092 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c9720764-799f-403c-80f2-516aa17688bc/sv-benchmarks/c/memsafety-ext3/getNumbers1-2.c [2019-11-20 00:47:37,097 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c9720764-799f-403c-80f2-516aa17688bc/bin/uautomizer/data/6aa8710ce/7e1c86accf074ea59197e11c0766f12b/FLAG7050d9f8a [2019-11-20 00:47:37,116 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c9720764-799f-403c-80f2-516aa17688bc/bin/uautomizer/data/6aa8710ce/7e1c86accf074ea59197e11c0766f12b [2019-11-20 00:47:37,120 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:47:37,122 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-20 00:47:37,126 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:47:37,126 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:47:37,130 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:47:37,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:47:37" (1/1) ... [2019-11-20 00:47:37,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cfae62e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:37, skipping insertion in model container [2019-11-20 00:47:37,134 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:47:37" (1/1) ... [2019-11-20 00:47:37,142 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:47:37,158 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:47:37,404 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:47:37,423 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:47:37,437 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:47:37,454 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:47:37,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:37 WrapperNode [2019-11-20 00:47:37,455 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:47:37,455 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:47:37,455 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:47:37,456 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:47:37,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:37" (1/1) ... [2019-11-20 00:47:37,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:37" (1/1) ... [2019-11-20 00:47:37,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:37" (1/1) ... [2019-11-20 00:47:37,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:37" (1/1) ... [2019-11-20 00:47:37,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:37" (1/1) ... [2019-11-20 00:47:37,499 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:37" (1/1) ... [2019-11-20 00:47:37,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:37" (1/1) ... [2019-11-20 00:47:37,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:47:37,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:47:37,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:47:37,503 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:47:37,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9720764-799f-403c-80f2-516aa17688bc/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-20 00:47:37,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-20 00:47:37,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:47:37,557 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2019-11-20 00:47:37,557 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-20 00:47:37,558 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-11-20 00:47:37,558 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2019-11-20 00:47:37,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 00:47:37,558 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-20 00:47:37,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 00:47:37,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 00:47:37,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-20 00:47:37,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2019-11-20 00:47:37,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:47:37,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-11-20 00:47:37,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-11-20 00:47:37,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 00:47:37,819 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:47:37,819 INFO L285 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-20 00:47:37,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:47:37 BoogieIcfgContainer [2019-11-20 00:47:37,820 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:47:37,821 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 00:47:37,821 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 00:47:37,824 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 00:47:37,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:47:37" (1/3) ... [2019-11-20 00:47:37,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f1075a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:47:37, skipping insertion in model container [2019-11-20 00:47:37,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:47:37" (2/3) ... [2019-11-20 00:47:37,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f1075a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:47:37, skipping insertion in model container [2019-11-20 00:47:37,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:47:37" (3/3) ... [2019-11-20 00:47:37,827 INFO L109 eAbstractionObserver]: Analyzing ICFG getNumbers1-2.c [2019-11-20 00:47:37,835 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 00:47:37,840 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-20 00:47:37,847 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-20 00:47:37,865 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 00:47:37,865 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-20 00:47:37,865 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 00:47:37,865 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 00:47:37,866 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 00:47:37,866 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 00:47:37,866 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 00:47:37,866 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 00:47:37,879 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-11-20 00:47:37,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 00:47:37,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:47:37,888 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:47:37,888 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-20 00:47:37,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:47:37,894 INFO L82 PathProgramCache]: Analyzing trace with hash 543879226, now seen corresponding path program 1 times [2019-11-20 00:47:37,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:47:37,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1883516689] [2019-11-20 00:47:37,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9720764-799f-403c-80f2-516aa17688bc/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-20 00:47:38,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:38,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 00:47:38,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:47:38,160 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-20 00:47:38,160 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 2 case distinctions, treesize of input 36 treesize of output 54 [2019-11-20 00:47:38,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:47:38,225 INFO L567 ElimStorePlain]: treesize reduction 24, result has 52.9 percent of original size [2019-11-20 00:47:38,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:38,231 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-20 00:47:38,232 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:27 [2019-11-20 00:47:38,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:38,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:38,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:38,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:38,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:38,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:38,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:38,348 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-20 00:47:38,350 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:47:38,429 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-20 00:47:38,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1883516689] [2019-11-20 00:47:38,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:47:38,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 00:47:38,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789086379] [2019-11-20 00:47:38,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:47:38,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:47:38,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:47:38,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:47:38,452 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 4 states. [2019-11-20 00:47:38,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:47:38,500 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-11-20 00:47:38,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:47:38,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-20 00:47:38,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:47:38,509 INFO L225 Difference]: With dead ends: 26 [2019-11-20 00:47:38,509 INFO L226 Difference]: Without dead ends: 21 [2019-11-20 00:47:38,511 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 6 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:47:38,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-20 00:47:38,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-20 00:47:38,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-20 00:47:38,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-11-20 00:47:38,537 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 9 [2019-11-20 00:47:38,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:47:38,538 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-11-20 00:47:38,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:47:38,538 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-11-20 00:47:38,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 00:47:38,539 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:47:38,539 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:47:38,740 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:47:38,741 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-20 00:47:38,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:47:38,741 INFO L82 PathProgramCache]: Analyzing trace with hash 543879227, now seen corresponding path program 1 times [2019-11-20 00:47:38,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:47:38,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1850800568] [2019-11-20 00:47:38,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9720764-799f-403c-80f2-516aa17688bc/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-20 00:47:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:38,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 00:47:38,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:47:38,865 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_15|], 2=[|v_#valid_22|]} [2019-11-20 00:47:38,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:47:38,873 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2019-11-20 00:47:38,873 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:47:38,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:47:38,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:47:38,894 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-11-20 00:47:38,894 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:47:38,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:47:38,910 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-20 00:47:38,910 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:14 [2019-11-20 00:47:38,970 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-20 00:47:38,970 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:47:39,160 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-20 00:47:39,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1850800568] [2019-11-20 00:47:39,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:47:39,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-20 00:47:39,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560740511] [2019-11-20 00:47:39,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 00:47:39,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:47:39,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 00:47:39,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 00:47:39,163 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 6 states. [2019-11-20 00:47:39,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:47:39,365 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2019-11-20 00:47:39,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 00:47:39,365 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-20 00:47:39,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:47:39,368 INFO L225 Difference]: With dead ends: 29 [2019-11-20 00:47:39,368 INFO L226 Difference]: Without dead ends: 29 [2019-11-20 00:47:39,369 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-20 00:47:39,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-20 00:47:39,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2019-11-20 00:47:39,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-20 00:47:39,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-11-20 00:47:39,374 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 9 [2019-11-20 00:47:39,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:47:39,374 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-11-20 00:47:39,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 00:47:39,375 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-11-20 00:47:39,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 00:47:39,375 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:47:39,375 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:47:39,577 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:47:39,577 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-20 00:47:39,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:47:39,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1912985381, now seen corresponding path program 1 times [2019-11-20 00:47:39,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:47:39,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [56748672] [2019-11-20 00:47:39,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9720764-799f-403c-80f2-516aa17688bc/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-20 00:47:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:39,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 00:47:39,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:47:39,716 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_23|], 2=[|v_#valid_30|]} [2019-11-20 00:47:39,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:47:39,728 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-20 00:47:39,728 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:47:39,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:47:39,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:47:39,749 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-11-20 00:47:39,749 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:47:39,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:47:39,759 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-20 00:47:39,759 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:14 [2019-11-20 00:47:39,901 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:47:39,904 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:47:40,487 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:47:40,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [56748672] [2019-11-20 00:47:40,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:47:40,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2019-11-20 00:47:40,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719121097] [2019-11-20 00:47:40,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 00:47:40,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:47:40,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 00:47:40,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-20 00:47:40,490 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 11 states. [2019-11-20 00:47:41,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:47:41,103 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-11-20 00:47:41,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 00:47:41,103 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2019-11-20 00:47:41,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:47:41,104 INFO L225 Difference]: With dead ends: 47 [2019-11-20 00:47:41,105 INFO L226 Difference]: Without dead ends: 47 [2019-11-20 00:47:41,105 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-11-20 00:47:41,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-20 00:47:41,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2019-11-20 00:47:41,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-20 00:47:41,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-11-20 00:47:41,111 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 15 [2019-11-20 00:47:41,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:47:41,111 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-11-20 00:47:41,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 00:47:41,111 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-11-20 00:47:41,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 00:47:41,112 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:47:41,112 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:47:41,313 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:47:41,317 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-20 00:47:41,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:47:41,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1378383288, now seen corresponding path program 1 times [2019-11-20 00:47:41,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:47:41,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [505357656] [2019-11-20 00:47:41,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9720764-799f-403c-80f2-516aa17688bc/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-20 00:47:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:41,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 00:47:41,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:47:41,474 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:47:41,474 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:47:41,579 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:47:41,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [505357656] [2019-11-20 00:47:41,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:47:41,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-20 00:47:41,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797788661] [2019-11-20 00:47:41,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 00:47:41,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:47:41,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 00:47:41,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-20 00:47:41,582 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 10 states. [2019-11-20 00:47:41,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:47:41,857 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2019-11-20 00:47:41,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 00:47:41,858 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-11-20 00:47:41,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:47:41,859 INFO L225 Difference]: With dead ends: 44 [2019-11-20 00:47:41,859 INFO L226 Difference]: Without dead ends: 44 [2019-11-20 00:47:41,860 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-11-20 00:47:41,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-20 00:47:41,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-11-20 00:47:41,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-20 00:47:41,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2019-11-20 00:47:41,865 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 23 [2019-11-20 00:47:41,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:47:41,866 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2019-11-20 00:47:41,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 00:47:41,866 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2019-11-20 00:47:41,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 00:47:41,867 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:47:41,867 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:47:42,069 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:47:42,070 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-20 00:47:42,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:47:42,070 INFO L82 PathProgramCache]: Analyzing trace with hash 193180187, now seen corresponding path program 2 times [2019-11-20 00:47:42,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:47:42,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2098240534] [2019-11-20 00:47:42,071 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9720764-799f-403c-80f2-516aa17688bc/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-20 00:47:42,210 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 00:47:42,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:47:42,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 00:47:42,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:47:42,218 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_34|], 2=[|v_#valid_41|]} [2019-11-20 00:47:42,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:47:42,227 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2019-11-20 00:47:42,227 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:47:42,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:47:42,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:47:42,253 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-11-20 00:47:42,254 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:47:42,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:47:42,263 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-20 00:47:42,263 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:14 [2019-11-20 00:47:42,488 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:47:42,488 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:47:43,637 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:47:43,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2098240534] [2019-11-20 00:47:43,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:47:43,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2019-11-20 00:47:43,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348989520] [2019-11-20 00:47:43,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 00:47:43,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:47:43,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 00:47:43,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-11-20 00:47:43,639 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 18 states. [2019-11-20 00:47:44,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:47:44,618 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2019-11-20 00:47:44,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 00:47:44,619 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2019-11-20 00:47:44,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:47:44,620 INFO L225 Difference]: With dead ends: 56 [2019-11-20 00:47:44,620 INFO L226 Difference]: Without dead ends: 56 [2019-11-20 00:47:44,621 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2019-11-20 00:47:44,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-20 00:47:44,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-11-20 00:47:44,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-20 00:47:44,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2019-11-20 00:47:44,628 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 27 [2019-11-20 00:47:44,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:47:44,629 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2019-11-20 00:47:44,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 00:47:44,629 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2019-11-20 00:47:44,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 00:47:44,631 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:47:44,632 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:47:44,834 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:47:44,834 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-20 00:47:44,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:47:44,834 INFO L82 PathProgramCache]: Analyzing trace with hash -673480641, now seen corresponding path program 2 times [2019-11-20 00:47:44,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:47:44,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1941569379] [2019-11-20 00:47:44,835 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9720764-799f-403c-80f2-516aa17688bc/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-20 00:47:44,899 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-20 00:47:44,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:47:44,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 00:47:44,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:47:44,952 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-20 00:47:44,952 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 2 case distinctions, treesize of input 44 treesize of output 62 [2019-11-20 00:47:44,953 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:47:44,977 INFO L567 ElimStorePlain]: treesize reduction 22, result has 55.1 percent of original size [2019-11-20 00:47:44,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:44,979 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-20 00:47:44,979 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:27 [2019-11-20 00:47:44,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:44,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:44,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:45,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:45,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:45,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:45,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:45,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:45,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:45,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:45,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:45,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:45,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:45,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:45,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:45,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:45,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:45,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:45,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:45,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:45,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:45,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:45,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:45,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:45,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:45,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:45,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:45,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:45,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:45,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:45,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:45,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:45,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:45,390 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-20 00:47:45,390 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:47:45,487 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-20 00:47:45,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1941569379] [2019-11-20 00:47:45,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:47:45,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 00:47:45,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061666083] [2019-11-20 00:47:45,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 00:47:45,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:47:45,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 00:47:45,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-20 00:47:45,489 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 10 states. [2019-11-20 00:47:45,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:47:45,656 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-11-20 00:47:45,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 00:47:45,657 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2019-11-20 00:47:45,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:47:45,658 INFO L225 Difference]: With dead ends: 49 [2019-11-20 00:47:45,658 INFO L226 Difference]: Without dead ends: 49 [2019-11-20 00:47:45,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 37 SyntacticMatches, 30 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-11-20 00:47:45,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-20 00:47:45,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-20 00:47:45,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-20 00:47:45,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2019-11-20 00:47:45,663 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 38 [2019-11-20 00:47:45,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:47:45,664 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2019-11-20 00:47:45,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 00:47:45,664 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2019-11-20 00:47:45,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 00:47:45,665 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:47:45,665 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:47:45,867 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:47:45,867 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-20 00:47:45,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:47:45,867 INFO L82 PathProgramCache]: Analyzing trace with hash -673480640, now seen corresponding path program 1 times [2019-11-20 00:47:45,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:47:45,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [374255622] [2019-11-20 00:47:45,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9720764-799f-403c-80f2-516aa17688bc/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-20 00:47:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:46,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 00:47:46,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:47:46,121 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:47:46,122 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:47:46,400 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:47:46,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [374255622] [2019-11-20 00:47:46,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:47:46,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2019-11-20 00:47:46,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425332529] [2019-11-20 00:47:46,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-20 00:47:46,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:47:46,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-20 00:47:46,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2019-11-20 00:47:46,402 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 20 states. [2019-11-20 00:47:46,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:47:46,692 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2019-11-20 00:47:46,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 00:47:46,694 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-11-20 00:47:46,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:47:46,695 INFO L225 Difference]: With dead ends: 49 [2019-11-20 00:47:46,695 INFO L226 Difference]: Without dead ends: 49 [2019-11-20 00:47:46,696 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2019-11-20 00:47:46,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-20 00:47:46,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-20 00:47:46,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-20 00:47:46,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-11-20 00:47:46,700 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 38 [2019-11-20 00:47:46,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:47:46,700 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-11-20 00:47:46,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-20 00:47:46,701 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-11-20 00:47:46,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 00:47:46,701 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:47:46,702 INFO L410 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:47:46,904 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:47:46,904 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-20 00:47:46,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:47:46,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1120492379, now seen corresponding path program 3 times [2019-11-20 00:47:46,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:47:46,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [896840164] [2019-11-20 00:47:46,905 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9720764-799f-403c-80f2-516aa17688bc/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-20 00:47:47,142 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-11-20 00:47:47,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:47:47,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-20 00:47:47,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:47:47,162 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_50|], 2=[|v_#valid_60|]} [2019-11-20 00:47:47,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:47:47,166 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2019-11-20 00:47:47,167 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:47:47,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:47:47,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:47:47,181 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-11-20 00:47:47,182 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:47:47,188 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:47:47,188 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-20 00:47:47,189 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:14 [2019-11-20 00:47:47,671 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 10 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:47:47,672 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:47:48,083 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2019-11-20 00:47:49,415 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2019-11-20 00:47:51,422 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:47:51,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [896840164] [2019-11-20 00:47:51,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:47:51,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 29 [2019-11-20 00:47:51,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993136494] [2019-11-20 00:47:51,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-20 00:47:51,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:47:51,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-20 00:47:51,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=578, Unknown=0, NotChecked=0, Total=812 [2019-11-20 00:47:51,424 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 29 states. [2019-11-20 00:47:52,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:47:52,208 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-11-20 00:47:52,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 00:47:52,209 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 39 [2019-11-20 00:47:52,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:47:52,210 INFO L225 Difference]: With dead ends: 47 [2019-11-20 00:47:52,210 INFO L226 Difference]: Without dead ends: 47 [2019-11-20 00:47:52,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=234, Invalid=578, Unknown=0, NotChecked=0, Total=812 [2019-11-20 00:47:52,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-20 00:47:52,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-20 00:47:52,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-20 00:47:52,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-11-20 00:47:52,215 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 39 [2019-11-20 00:47:52,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:47:52,215 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-11-20 00:47:52,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-20 00:47:52,215 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-11-20 00:47:52,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 00:47:52,216 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:47:52,216 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:47:52,419 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:47:52,420 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-20 00:47:52,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:47:52,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1709012064, now seen corresponding path program 2 times [2019-11-20 00:47:52,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:47:52,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1608327059] [2019-11-20 00:47:52,421 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9720764-799f-403c-80f2-516aa17688bc/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-20 00:47:52,513 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-20 00:47:52,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:47:52,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 00:47:52,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:47:52,525 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_56|], 2=[|v_#valid_66|]} [2019-11-20 00:47:52,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:47:52,529 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2019-11-20 00:47:52,529 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:47:52,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:47:52,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:47:52,542 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-11-20 00:47:52,542 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:47:52,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:47:52,548 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-20 00:47:52,548 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:14 [2019-11-20 00:47:52,631 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-20 00:47:52,632 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:47:52,931 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-20 00:47:52,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1608327059] [2019-11-20 00:47:52,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:47:52,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 00:47:52,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832576287] [2019-11-20 00:47:52,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 00:47:52,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:47:52,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 00:47:52,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-20 00:47:52,932 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 10 states. [2019-11-20 00:47:53,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:47:53,305 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-11-20 00:47:53,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 00:47:53,306 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2019-11-20 00:47:53,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:47:53,307 INFO L225 Difference]: With dead ends: 53 [2019-11-20 00:47:53,307 INFO L226 Difference]: Without dead ends: 53 [2019-11-20 00:47:53,307 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-20 00:47:53,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-20 00:47:53,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-20 00:47:53,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-20 00:47:53,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-11-20 00:47:53,311 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 44 [2019-11-20 00:47:53,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:47:53,312 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-11-20 00:47:53,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 00:47:53,312 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-11-20 00:47:53,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-20 00:47:53,313 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:47:53,313 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:47:53,513 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:47:53,514 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-11-20 00:47:53,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:47:53,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1959425242, now seen corresponding path program 1 times [2019-11-20 00:47:53,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:47:53,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [326737614] [2019-11-20 00:47:53,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c9720764-799f-403c-80f2-516aa17688bc/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-20 00:47:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:53,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-20 00:47:53,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:47:54,162 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 00:47:54,162 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:47:55,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:47:55,173 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 24 treesize of output 18 [2019-11-20 00:47:55,174 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-20 00:47:55,181 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 22 treesize of output 18 [2019-11-20 00:47:55,181 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-20 00:47:55,206 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 24 treesize of output 20 [2019-11-20 00:47:55,206 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-20 00:47:55,341 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-11-20 00:47:55,341 INFO L567 ElimStorePlain]: treesize reduction 6, result has 89.5 percent of original size [2019-11-20 00:47:55,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-11-20 00:47:55,342 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:71, output treesize:51 [2019-11-20 00:47:56,142 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2019-11-20 00:47:58,448 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 38 treesize of output 30 [2019-11-20 00:47:58,448 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-20 00:47:58,525 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:47:58,726 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:47:58,727 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported: (forall ((v_arrayElimCell_11 (_ BitVec 32))) (exists ((v_arrayElimCell_8 (_ BitVec 32))) (let ((.cse0 (bvadd |~#array~0.offset| (_ bv4 32))) (.cse1 (bvadd |~#array~0.offset| (_ bv12 32))) (.cse2 (bvmul getNumbers_~i~0 (_ bv4 32)))) (or (and (bvsle .cse0 v_arrayElimCell_8) (not (bvsle .cse1 v_arrayElimCell_8)) (bvsle (bvadd |~#array~0.offset| (_ bv32 32)) v_arrayElimCell_8)) (not (bvsle .cse0 v_arrayElimCell_11)) (not (bvsle (_ bv0 32) (bvadd |~#array~0.offset| (_ bv8 32)))) (not (bvsle (bvadd .cse2 |~#array~0.offset| (_ bv32 32)) v_arrayElimCell_11)) (bvsle .cse1 v_arrayElimCell_11) (not (bvsle (bvadd .cse2 |~#array~0.offset| (_ bv4 32)) v_arrayElimCell_11)))))) 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-20 00:47:58,730 INFO L168 Benchmark]: Toolchain (without parser) took 21608.69 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 325.6 MB). Free memory was 948.7 MB in the beginning and 1.3 GB in the end (delta: -371.4 MB). Peak memory consumption was 386.5 MB. Max. memory is 11.5 GB. [2019-11-20 00:47:58,730 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:47:58,731 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 948.7 MB in the beginning and 1.2 GB in the end (delta: -215.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-20 00:47:58,731 INFO L168 Benchmark]: Boogie Preprocessor took 47.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:47:58,731 INFO L168 Benchmark]: RCFGBuilder took 317.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 11.5 GB. [2019-11-20 00:47:58,732 INFO L168 Benchmark]: TraceAbstraction took 20907.97 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 153.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -185.2 MB). Peak memory consumption was 400.2 MB. Max. memory is 11.5 GB. [2019-11-20 00:47:58,733 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 328.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 948.7 MB in the beginning and 1.2 GB in the end (delta: -215.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 317.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20907.97 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 153.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -185.2 MB). Peak memory consumption was 400.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported: (forall ((v_arrayElimCell_11 (_ BitVec 32))) (exists ((v_arrayElimCell_8 (_ BitVec 32))) (let ((.cse0 (bvadd |~#array~0.offset| (_ bv4 32))) (.cse1 (bvadd |~#array~0.offset| (_ bv12 32))) (.cse2 (bvmul getNumbers_~i~0 (_ bv4 32)))) (or (and (bvsle .cse0 v_arrayElimCell_8) (not (bvsle .cse1 v_arrayElimCell_8)) (bvsle (bvadd |~#array~0.offset| (_ bv32 32)) v_arrayElimCell_8)) (not (bvsle .cse0 v_arrayElimCell_11)) (not (bvsle (_ bv0 32) (bvadd |~#array~0.offset| (_ bv8 32)))) (not (bvsle (bvadd .cse2 |~#array~0.offset| (_ bv32 32)) v_arrayElimCell_11)) (bvsle .cse1 v_arrayElimCell_11) (not (bvsle (bvadd .cse2 |~#array~0.offset| (_ bv4 32)) v_arrayElimCell_11)))))) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: (forall ((v_arrayElimCell_11 (_ BitVec 32))) (exists ((v_arrayElimCell_8 (_ BitVec 32))) (let ((.cse0 (bvadd |~#array~0.offset| (_ bv4 32))) (.cse1 (bvadd |~#array~0.offset| (_ bv12 32))) (.cse2 (bvmul getNumbers_~i~0 (_ bv4 32)))) (or (and (bvsle .cse0 v_arrayElimCell_8) (not (bvsle .cse1 v_arrayElimCell_8)) (bvsle (bvadd |~#array~0.offset| (_ bv32 32)) v_arrayElimCell_8)) (not (bvsle .cse0 v_arrayElimCell_11)) (not (bvsle (_ bv0 32) (bvadd |~#array~0.offset| (_ bv8 32)))) (not (bvsle (bvadd .cse2 |~#array~0.offset| (_ bv32 32)) v_arrayElimCell_11)) (bvsle .cse1 v_arrayElimCell_11) (not (bvsle (bvadd .cse2 |~#array~0.offset| (_ bv4 32)) v_arrayElimCell_11)))))): 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...