./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/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 2ef789dd0026a0c0ee3639964867439e8d9c0358 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/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 2ef789dd0026a0c0ee3639964867439e8d9c0358 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported: (forall ((|v_main_~#b~0.offset_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#b~0.base_BEFORE_CALL_8| (_ BitVec 32)) (v_prenex_9 (_ BitVec 32)) (v_foo_~n_19 (_ BitVec 32))) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32)) (v_foo_~n_22 (_ BitVec 32))) (let ((.cse0 (bvadd |v_main_~#b~0.offset_BEFORE_CALL_5| (_ bv4 32)))) (or (= |v_main_~#b~0.base_BEFORE_CALL_8| |foo_~#a~0.base|) (bvsle .cse0 (select (store |#length| v_prenex_9 (bvmul v_foo_~n_19 (_ bv4 32))) |v_main_~#b~0.base_BEFORE_CALL_8|)) (not (bvsle |v_main_~#b~0.offset_BEFORE_CALL_5| .cse0)) (and (not (= v_prenex_15 |v_main_~#b~0.base_BEFORE_CALL_8|)) (not (bvsle .cse0 (select (store (store |old(#length)| v_prenex_12 (bvmul v_foo_~n_22 (_ bv4 32))) v_prenex_15 (bvmul v_prenex_16 (_ bv4 32))) |v_main_~#b~0.base_BEFORE_CALL_8|))) (not (= v_prenex_12 |v_main_~#b~0.base_BEFORE_CALL_8|))) (not (bvsle (_ bv0 32) |v_main_~#b~0.offset_BEFORE_CALL_5|)) (= v_prenex_9 |v_main_~#b~0.base_BEFORE_CALL_8|))))) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:48:50,428 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:48:50,430 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:48:50,445 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:48:50,446 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:48:50,447 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:48:50,449 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:48:50,458 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:48:50,463 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:48:50,467 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:48:50,468 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:48:50,470 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:48:50,471 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:48:50,472 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:48:50,473 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:48:50,474 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:48:50,475 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:48:50,476 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:48:50,478 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:48:50,482 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:48:50,485 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:48:50,487 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:48:50,490 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:48:50,490 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:48:50,493 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:48:50,493 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:48:50,493 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:48:50,495 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:48:50,495 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:48:50,496 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:48:50,496 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:48:50,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:48:50,497 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:48:50,498 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:48:50,500 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:48:50,500 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:48:50,501 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:48:50,501 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:48:50,501 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:48:50,502 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:48:50,502 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:48:50,504 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 23:48:50,528 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:48:50,538 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:48:50,539 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:48:50,540 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:48:50,540 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:48:50,540 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:48:50,540 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:48:50,541 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:48:50,541 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:48:50,541 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:48:50,541 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:48:50,542 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 23:48:50,542 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 23:48:50,542 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 23:48:50,542 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:48:50,544 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:48:50,544 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:48:50,544 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:48:50,544 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:48:50,545 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:48:50,545 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:48:50,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:48:50,545 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:48:50,546 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:48:50,546 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:48:50,546 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:48:50,547 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/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 -> 2ef789dd0026a0c0ee3639964867439e8d9c0358 [2019-11-15 23:48:50,572 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:48:50,582 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:48:50,585 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:48:50,587 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:48:50,587 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:48:50,588 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2.c [2019-11-15 23:48:50,639 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/data/5c10e0980/08ff79364e514762854d264188f3c8fb/FLAGa413cd998 [2019-11-15 23:48:51,056 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:48:51,057 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2.c [2019-11-15 23:48:51,062 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/data/5c10e0980/08ff79364e514762854d264188f3c8fb/FLAGa413cd998 [2019-11-15 23:48:51,077 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/data/5c10e0980/08ff79364e514762854d264188f3c8fb [2019-11-15 23:48:51,080 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:48:51,081 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 23:48:51,085 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:48:51,085 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:48:51,088 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:48:51,089 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:48:51" (1/1) ... [2019-11-15 23:48:51,091 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4635f55d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:48:51, skipping insertion in model container [2019-11-15 23:48:51,092 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:48:51" (1/1) ... [2019-11-15 23:48:51,099 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:48:51,117 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:48:51,350 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:48:51,358 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:48:51,374 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:48:51,386 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:48:51,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:48:51 WrapperNode [2019-11-15 23:48:51,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:48:51,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:48:51,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:48:51,387 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:48:51,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:48:51" (1/1) ... [2019-11-15 23:48:51,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:48:51" (1/1) ... [2019-11-15 23:48:51,407 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:48:51" (1/1) ... [2019-11-15 23:48:51,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:48:51" (1/1) ... [2019-11-15 23:48:51,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:48:51" (1/1) ... [2019-11-15 23:48:51,425 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:48:51" (1/1) ... [2019-11-15 23:48:51,427 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:48:51" (1/1) ... [2019-11-15 23:48:51,435 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:48:51,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:48:51,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:48:51,438 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:48:51,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:48:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/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-15 23:48:51,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 23:48:51,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:48:51,490 INFO L138 BoogieDeclarations]: Found implementation of procedure bar [2019-11-15 23:48:51,490 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-11-15 23:48:51,490 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 23:48:51,490 INFO L130 BoogieDeclarations]: Found specification of procedure bar [2019-11-15 23:48:51,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:48:51,490 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-11-15 23:48:51,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:48:51,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:48:51,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:48:51,491 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 23:48:51,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 23:48:51,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:48:51,939 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:48:51,939 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 23:48:51,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:48:51 BoogieIcfgContainer [2019-11-15 23:48:51,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:48:51,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:48:51,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:48:51,945 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:48:51,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:48:51" (1/3) ... [2019-11-15 23:48:51,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c370aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:48:51, skipping insertion in model container [2019-11-15 23:48:51,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:48:51" (2/3) ... [2019-11-15 23:48:51,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c370aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:48:51, skipping insertion in model container [2019-11-15 23:48:51,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:48:51" (3/3) ... [2019-11-15 23:48:51,948 INFO L109 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2.c [2019-11-15 23:48:51,957 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:48:51,963 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2019-11-15 23:48:51,971 INFO L249 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2019-11-15 23:48:51,992 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:48:51,993 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 23:48:51,993 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:48:51,994 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:48:51,994 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:48:51,995 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:48:51,995 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:48:51,995 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:48:52,013 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2019-11-15 23:48:52,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 23:48:52,022 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:52,022 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:52,024 INFO L410 AbstractCegarLoop]: === Iteration 1 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-15 23:48:52,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:52,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1403638412, now seen corresponding path program 1 times [2019-11-15 23:48:52,037 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:52,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928584004] [2019-11-15 23:48:52,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:52,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:52,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:52,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-15 23:48:52,160 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928584004] [2019-11-15 23:48:52,161 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:52,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:48:52,162 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557561059] [2019-11-15 23:48:52,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:48:52,166 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:52,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:48:52,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:48:52,178 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 3 states. [2019-11-15 23:48:52,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:52,310 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2019-11-15 23:48:52,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:48:52,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-15 23:48:52,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:52,324 INFO L225 Difference]: With dead ends: 52 [2019-11-15 23:48:52,324 INFO L226 Difference]: Without dead ends: 49 [2019-11-15 23:48:52,326 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:48:52,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-15 23:48:52,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-15 23:48:52,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-15 23:48:52,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2019-11-15 23:48:52,374 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 10 [2019-11-15 23:48:52,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:52,375 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2019-11-15 23:48:52,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:48:52,375 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2019-11-15 23:48:52,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 23:48:52,376 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:52,376 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:52,377 INFO L410 AbstractCegarLoop]: === Iteration 2 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-15 23:48:52,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:52,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1403995904, now seen corresponding path program 1 times [2019-11-15 23:48:52,378 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:52,378 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877116265] [2019-11-15 23:48:52,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:52,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:52,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:52,447 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-15 23:48:52,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877116265] [2019-11-15 23:48:52,448 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:52,448 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:48:52,448 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122587776] [2019-11-15 23:48:52,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:48:52,449 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:52,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:48:52,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:48:52,450 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 4 states. [2019-11-15 23:48:52,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:52,584 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2019-11-15 23:48:52,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:48:52,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-15 23:48:52,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:52,587 INFO L225 Difference]: With dead ends: 56 [2019-11-15 23:48:52,588 INFO L226 Difference]: Without dead ends: 56 [2019-11-15 23:48:52,588 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:48:52,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-15 23:48:52,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2019-11-15 23:48:52,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-15 23:48:52,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-11-15 23:48:52,599 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 10 [2019-11-15 23:48:52,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:52,600 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-11-15 23:48:52,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:48:52,600 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-11-15 23:48:52,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 23:48:52,601 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:52,601 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:52,601 INFO L410 AbstractCegarLoop]: === Iteration 3 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-15 23:48:52,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:52,602 INFO L82 PathProgramCache]: Analyzing trace with hash -571487811, now seen corresponding path program 1 times [2019-11-15 23:48:52,602 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:52,602 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733777309] [2019-11-15 23:48:52,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:52,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:52,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:52,698 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-15 23:48:52,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733777309] [2019-11-15 23:48:52,698 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:52,698 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:48:52,699 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741566792] [2019-11-15 23:48:52,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:48:52,699 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:52,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:48:52,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:48:52,700 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 6 states. [2019-11-15 23:48:52,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:52,917 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2019-11-15 23:48:52,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:48:52,918 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-11-15 23:48:52,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:52,920 INFO L225 Difference]: With dead ends: 63 [2019-11-15 23:48:52,920 INFO L226 Difference]: Without dead ends: 63 [2019-11-15 23:48:52,920 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:48:52,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-15 23:48:52,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2019-11-15 23:48:52,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-15 23:48:52,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2019-11-15 23:48:52,932 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 11 [2019-11-15 23:48:52,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:52,932 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2019-11-15 23:48:52,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:48:52,933 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2019-11-15 23:48:52,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 23:48:52,933 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:52,933 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:52,934 INFO L410 AbstractCegarLoop]: === Iteration 4 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-15 23:48:52,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:52,934 INFO L82 PathProgramCache]: Analyzing trace with hash 57103265, now seen corresponding path program 1 times [2019-11-15 23:48:52,935 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:52,935 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575325348] [2019-11-15 23:48:52,935 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:52,936 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:52,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:53,010 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-15 23:48:53,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575325348] [2019-11-15 23:48:53,011 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:53,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:48:53,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812279128] [2019-11-15 23:48:53,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:48:53,012 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:53,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:48:53,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:48:53,012 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 6 states. [2019-11-15 23:48:53,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:53,159 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2019-11-15 23:48:53,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:48:53,160 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-15 23:48:53,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:53,163 INFO L225 Difference]: With dead ends: 55 [2019-11-15 23:48:53,163 INFO L226 Difference]: Without dead ends: 55 [2019-11-15 23:48:53,163 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:48:53,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-15 23:48:53,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-11-15 23:48:53,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-15 23:48:53,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2019-11-15 23:48:53,170 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 14 [2019-11-15 23:48:53,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:53,170 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2019-11-15 23:48:53,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:48:53,171 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2019-11-15 23:48:53,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 23:48:53,171 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:53,171 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:53,171 INFO L410 AbstractCegarLoop]: === Iteration 5 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-15 23:48:53,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:53,172 INFO L82 PathProgramCache]: Analyzing trace with hash 57103266, now seen corresponding path program 1 times [2019-11-15 23:48:53,172 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:53,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97838773] [2019-11-15 23:48:53,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:53,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:53,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:53,315 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-15 23:48:53,315 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97838773] [2019-11-15 23:48:53,316 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:53,316 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:48:53,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487511401] [2019-11-15 23:48:53,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:48:53,317 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:53,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:48:53,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:48:53,317 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 8 states. [2019-11-15 23:48:53,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:53,589 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2019-11-15 23:48:53,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:48:53,589 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-15 23:48:53,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:53,591 INFO L225 Difference]: With dead ends: 66 [2019-11-15 23:48:53,591 INFO L226 Difference]: Without dead ends: 66 [2019-11-15 23:48:53,591 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:48:53,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-15 23:48:53,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2019-11-15 23:48:53,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-15 23:48:53,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2019-11-15 23:48:53,597 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 14 [2019-11-15 23:48:53,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:53,598 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2019-11-15 23:48:53,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:48:53,598 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2019-11-15 23:48:53,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 23:48:53,599 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:53,599 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:53,599 INFO L410 AbstractCegarLoop]: === Iteration 6 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-15 23:48:53,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:53,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1301246681, now seen corresponding path program 1 times [2019-11-15 23:48:53,600 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:53,600 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743190713] [2019-11-15 23:48:53,600 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:53,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:53,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:53,781 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-15 23:48:53,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743190713] [2019-11-15 23:48:53,781 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:53,781 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:48:53,782 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784148351] [2019-11-15 23:48:53,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:48:53,782 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:53,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:48:53,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:48:53,783 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 7 states. [2019-11-15 23:48:53,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:53,984 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-11-15 23:48:53,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:48:53,985 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-11-15 23:48:53,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:53,986 INFO L225 Difference]: With dead ends: 58 [2019-11-15 23:48:53,986 INFO L226 Difference]: Without dead ends: 58 [2019-11-15 23:48:53,986 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:48:53,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-15 23:48:53,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-11-15 23:48:53,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-15 23:48:53,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2019-11-15 23:48:53,992 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 22 [2019-11-15 23:48:53,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:53,992 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2019-11-15 23:48:53,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:48:53,993 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2019-11-15 23:48:53,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 23:48:53,993 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:53,994 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:53,994 INFO L410 AbstractCegarLoop]: === Iteration 7 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-15 23:48:53,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:53,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1301246682, now seen corresponding path program 1 times [2019-11-15 23:48:53,996 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:53,997 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195030169] [2019-11-15 23:48:53,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:53,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:53,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:54,206 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-15 23:48:54,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195030169] [2019-11-15 23:48:54,207 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:48:54,207 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:48:54,207 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032960076] [2019-11-15 23:48:54,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:48:54,208 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:54,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:48:54,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:48:54,208 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 8 states. [2019-11-15 23:48:54,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:54,452 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2019-11-15 23:48:54,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:48:54,453 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-11-15 23:48:54,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:54,454 INFO L225 Difference]: With dead ends: 62 [2019-11-15 23:48:54,454 INFO L226 Difference]: Without dead ends: 62 [2019-11-15 23:48:54,454 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:48:54,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-15 23:48:54,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2019-11-15 23:48:54,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-15 23:48:54,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2019-11-15 23:48:54,459 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 22 [2019-11-15 23:48:54,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:54,460 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2019-11-15 23:48:54,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:48:54,460 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2019-11-15 23:48:54,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 23:48:54,461 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:54,461 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:54,461 INFO L410 AbstractCegarLoop]: === Iteration 8 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-15 23:48:54,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:54,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1160832587, now seen corresponding path program 1 times [2019-11-15 23:48:54,461 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:54,462 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620238414] [2019-11-15 23:48:54,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:54,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:54,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:54,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:54,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620238414] [2019-11-15 23:48:54,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654656129] [2019-11-15 23:48:54,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:54,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:48:54,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:48:54,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:54,631 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:48:54,631 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-11-15 23:48:54,631 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127109060] [2019-11-15 23:48:54,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:48:54,632 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:54,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:48:54,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:48:54,632 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 7 states. [2019-11-15 23:48:54,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:54,771 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2019-11-15 23:48:54,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:48:54,771 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-11-15 23:48:54,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:54,772 INFO L225 Difference]: With dead ends: 69 [2019-11-15 23:48:54,772 INFO L226 Difference]: Without dead ends: 69 [2019-11-15 23:48:54,773 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:48:54,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-15 23:48:54,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2019-11-15 23:48:54,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-15 23:48:54,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2019-11-15 23:48:54,778 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 28 [2019-11-15 23:48:54,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:54,779 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2019-11-15 23:48:54,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:48:54,779 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2019-11-15 23:48:54,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 23:48:54,780 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:54,780 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:54,980 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:54,981 INFO L410 AbstractCegarLoop]: === Iteration 9 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-15 23:48:54,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:54,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1628784051, now seen corresponding path program 1 times [2019-11-15 23:48:54,981 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:54,981 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549073152] [2019-11-15 23:48:54,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:54,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:54,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:55,052 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:55,052 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549073152] [2019-11-15 23:48:55,052 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480943597] [2019-11-15 23:48:55,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:55,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 23:48:55,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:48:55,162 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:55,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 23:48:55,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:55,182 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-15 23:48:55,183 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-15 23:48:55,184 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2019-11-15 23:48:55,206 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:55,206 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:48:55,207 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2019-11-15 23:48:55,207 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325454227] [2019-11-15 23:48:55,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:48:55,207 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:55,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:48:55,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:48:55,208 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 5 states. [2019-11-15 23:48:55,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:55,276 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2019-11-15 23:48:55,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:48:55,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-15 23:48:55,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:55,278 INFO L225 Difference]: With dead ends: 62 [2019-11-15 23:48:55,278 INFO L226 Difference]: Without dead ends: 62 [2019-11-15 23:48:55,278 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:48:55,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-15 23:48:55,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-15 23:48:55,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-15 23:48:55,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2019-11-15 23:48:55,283 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 29 [2019-11-15 23:48:55,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:55,284 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2019-11-15 23:48:55,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:48:55,284 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2019-11-15 23:48:55,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 23:48:55,284 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:55,285 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:55,488 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:55,488 INFO L410 AbstractCegarLoop]: === Iteration 10 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-15 23:48:55,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:55,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1628784052, now seen corresponding path program 1 times [2019-11-15 23:48:55,489 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:55,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071701316] [2019-11-15 23:48:55,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:55,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:55,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:55,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:55,664 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071701316] [2019-11-15 23:48:55,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078275063] [2019-11-15 23:48:55,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:55,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-15 23:48:55,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:48:55,735 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 23:48:55,735 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:55,742 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:55,746 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 23:48:55,746 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:55,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:55,752 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:55,753 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-15 23:48:55,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-15 23:48:55,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:55,825 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:55,827 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-15 23:48:55,827 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:55,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:55,832 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:48:55,832 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:9 [2019-11-15 23:48:55,906 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:55,907 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 23:48:55,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:55,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:55,925 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-15 23:48:55,926 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:55,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:55,935 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:48:55,935 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:22 [2019-11-15 23:48:56,060 INFO L392 ElimStorePlain]: Different costs {1=[|v_#valid_36|], 3=[|v_#length_21|]} [2019-11-15 23:48:56,071 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:56,072 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 23:48:56,072 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:56,088 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:56,104 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:56,104 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 44 [2019-11-15 23:48:56,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:48:56,108 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:56,140 INFO L567 ElimStorePlain]: treesize reduction 16, result has 69.2 percent of original size [2019-11-15 23:48:56,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:48:56,141 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:38 [2019-11-15 23:48:56,198 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:56,199 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:48:56,199 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2019-11-15 23:48:56,199 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251869501] [2019-11-15 23:48:56,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 23:48:56,199 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:56,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 23:48:56,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-11-15 23:48:56,200 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 18 states. [2019-11-15 23:48:57,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:57,150 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2019-11-15 23:48:57,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 23:48:57,151 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2019-11-15 23:48:57,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:57,152 INFO L225 Difference]: With dead ends: 72 [2019-11-15 23:48:57,152 INFO L226 Difference]: Without dead ends: 72 [2019-11-15 23:48:57,153 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=147, Invalid=783, Unknown=0, NotChecked=0, Total=930 [2019-11-15 23:48:57,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-15 23:48:57,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2019-11-15 23:48:57,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-15 23:48:57,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2019-11-15 23:48:57,158 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 29 [2019-11-15 23:48:57,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:57,158 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2019-11-15 23:48:57,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 23:48:57,159 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2019-11-15 23:48:57,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 23:48:57,160 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:57,160 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:57,360 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:57,360 INFO L410 AbstractCegarLoop]: === Iteration 11 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-15 23:48:57,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:57,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1047301966, now seen corresponding path program 1 times [2019-11-15 23:48:57,361 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:57,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675296804] [2019-11-15 23:48:57,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:57,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:57,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:57,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 23:48:57,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675296804] [2019-11-15 23:48:57,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416093218] [2019-11-15 23:48:57,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:57,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 23:48:57,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:48:57,671 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-15 23:48:57,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:57,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:57,679 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:57,680 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:24 [2019-11-15 23:48:57,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:57,710 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:48:57,710 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2019-11-15 23:48:57,710 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042704292] [2019-11-15 23:48:57,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:48:57,711 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:57,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:48:57,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:48:57,712 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 6 states. [2019-11-15 23:48:57,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:57,820 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2019-11-15 23:48:57,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:48:57,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-11-15 23:48:57,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:57,822 INFO L225 Difference]: With dead ends: 69 [2019-11-15 23:48:57,822 INFO L226 Difference]: Without dead ends: 69 [2019-11-15 23:48:57,822 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:48:57,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-15 23:48:57,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2019-11-15 23:48:57,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-15 23:48:57,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2019-11-15 23:48:57,828 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 30 [2019-11-15 23:48:57,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:57,828 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2019-11-15 23:48:57,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:48:57,828 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2019-11-15 23:48:57,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 23:48:57,829 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:57,829 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:58,032 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:58,033 INFO L410 AbstractCegarLoop]: === Iteration 12 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-15 23:48:58,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:58,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1434727444, now seen corresponding path program 1 times [2019-11-15 23:48:58,033 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:58,033 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282379356] [2019-11-15 23:48:58,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:58,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:58,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:58,127 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:58,127 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282379356] [2019-11-15 23:48:58,128 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028351771] [2019-11-15 23:48:58,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:58,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:48:58,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:48:58,234 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:58,234 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:48:58,234 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2019-11-15 23:48:58,234 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238642011] [2019-11-15 23:48:58,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:48:58,235 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:58,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:48:58,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:48:58,236 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 6 states. [2019-11-15 23:48:58,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:58,322 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2019-11-15 23:48:58,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:48:58,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-15 23:48:58,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:58,323 INFO L225 Difference]: With dead ends: 66 [2019-11-15 23:48:58,323 INFO L226 Difference]: Without dead ends: 66 [2019-11-15 23:48:58,323 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:48:58,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-15 23:48:58,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-11-15 23:48:58,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-15 23:48:58,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2019-11-15 23:48:58,327 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 32 [2019-11-15 23:48:58,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:58,327 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2019-11-15 23:48:58,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:48:58,327 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2019-11-15 23:48:58,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 23:48:58,328 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:58,328 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:58,531 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:58,531 INFO L410 AbstractCegarLoop]: === Iteration 13 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-15 23:48:58,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:58,532 INFO L82 PathProgramCache]: Analyzing trace with hash -199425899, now seen corresponding path program 1 times [2019-11-15 23:48:58,532 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:58,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502971619] [2019-11-15 23:48:58,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:58,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:58,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:58,678 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:58,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502971619] [2019-11-15 23:48:58,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090833086] [2019-11-15 23:48:58,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:58,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:48:58,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:48:58,842 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:58,842 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:48:58,842 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2019-11-15 23:48:58,842 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648850732] [2019-11-15 23:48:58,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 23:48:58,843 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:58,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 23:48:58,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:48:58,843 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 15 states. [2019-11-15 23:48:59,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:48:59,234 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2019-11-15 23:48:59,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:48:59,235 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2019-11-15 23:48:59,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:48:59,236 INFO L225 Difference]: With dead ends: 82 [2019-11-15 23:48:59,236 INFO L226 Difference]: Without dead ends: 82 [2019-11-15 23:48:59,236 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-11-15 23:48:59,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-15 23:48:59,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2019-11-15 23:48:59,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-15 23:48:59,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2019-11-15 23:48:59,241 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 34 [2019-11-15 23:48:59,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:48:59,241 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2019-11-15 23:48:59,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 23:48:59,242 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2019-11-15 23:48:59,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 23:48:59,248 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:48:59,249 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:48:59,460 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:59,461 INFO L410 AbstractCegarLoop]: === Iteration 14 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-15 23:48:59,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:48:59,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1157097109, now seen corresponding path program 1 times [2019-11-15 23:48:59,461 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:48:59,461 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749303970] [2019-11-15 23:48:59,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:59,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:48:59,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:48:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:59,646 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:48:59,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749303970] [2019-11-15 23:48:59,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500176495] [2019-11-15 23:48:59,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:48:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:48:59,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 23:48:59,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:48:59,801 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-15 23:48:59,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:48:59,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:48:59,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:48:59,813 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:21 [2019-11-15 23:48:59,939 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:48:59,940 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:48:59,940 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 18 [2019-11-15 23:48:59,940 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680437035] [2019-11-15 23:48:59,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:48:59,941 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:48:59,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:48:59,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-11-15 23:48:59,941 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 8 states. [2019-11-15 23:49:00,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:00,181 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2019-11-15 23:49:00,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:49:00,183 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2019-11-15 23:49:00,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:49:00,184 INFO L225 Difference]: With dead ends: 84 [2019-11-15 23:49:00,184 INFO L226 Difference]: Without dead ends: 84 [2019-11-15 23:49:00,184 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2019-11-15 23:49:00,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-15 23:49:00,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2019-11-15 23:49:00,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-15 23:49:00,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2019-11-15 23:49:00,189 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 37 [2019-11-15 23:49:00,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:49:00,189 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2019-11-15 23:49:00,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:49:00,189 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2019-11-15 23:49:00,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 23:49:00,197 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:49:00,197 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:49:00,397 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:49:00,398 INFO L410 AbstractCegarLoop]: === Iteration 15 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-15 23:49:00,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:00,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1562437358, now seen corresponding path program 1 times [2019-11-15 23:49:00,398 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:00,398 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871571905] [2019-11-15 23:49:00,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:00,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:00,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:00,537 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:49:00,537 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871571905] [2019-11-15 23:49:00,537 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183792893] [2019-11-15 23:49:00,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:49:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:00,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 23:49:00,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:49:00,698 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:49:00,699 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:49:00,699 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 [2019-11-15 23:49:00,699 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320978219] [2019-11-15 23:49:00,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 23:49:00,700 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:00,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 23:49:00,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-11-15 23:49:00,700 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 17 states. [2019-11-15 23:49:01,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:01,198 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2019-11-15 23:49:01,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 23:49:01,199 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2019-11-15 23:49:01,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:49:01,200 INFO L225 Difference]: With dead ends: 96 [2019-11-15 23:49:01,200 INFO L226 Difference]: Without dead ends: 96 [2019-11-15 23:49:01,201 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2019-11-15 23:49:01,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-15 23:49:01,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2019-11-15 23:49:01,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-15 23:49:01,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2019-11-15 23:49:01,205 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 41 [2019-11-15 23:49:01,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:49:01,205 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2019-11-15 23:49:01,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 23:49:01,205 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2019-11-15 23:49:01,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 23:49:01,214 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:49:01,215 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:49:01,419 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:49:01,423 INFO L410 AbstractCegarLoop]: === Iteration 16 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-15 23:49:01,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:01,424 INFO L82 PathProgramCache]: Analyzing trace with hash 2018926499, now seen corresponding path program 1 times [2019-11-15 23:49:01,424 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:01,424 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797382742] [2019-11-15 23:49:01,424 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:01,424 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:01,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:01,551 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 23:49:01,551 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797382742] [2019-11-15 23:49:01,551 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428433627] [2019-11-15 23:49:01,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:49:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:01,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:49:01,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:49:01,688 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 23:49:01,689 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:49:01,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 14 [2019-11-15 23:49:01,689 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400797034] [2019-11-15 23:49:01,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:49:01,689 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:01,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:49:01,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:49:01,690 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 8 states. [2019-11-15 23:49:01,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:01,808 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2019-11-15 23:49:01,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:49:01,809 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-11-15 23:49:01,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:49:01,810 INFO L225 Difference]: With dead ends: 104 [2019-11-15 23:49:01,810 INFO L226 Difference]: Without dead ends: 90 [2019-11-15 23:49:01,810 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:49:01,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-15 23:49:01,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-11-15 23:49:01,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-15 23:49:01,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2019-11-15 23:49:01,814 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 45 [2019-11-15 23:49:01,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:49:01,815 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2019-11-15 23:49:01,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:49:01,815 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2019-11-15 23:49:01,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 23:49:01,816 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:49:01,816 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:49:02,017 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:49:02,017 INFO L410 AbstractCegarLoop]: === Iteration 17 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-15 23:49:02,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:02,017 INFO L82 PathProgramCache]: Analyzing trace with hash 777452070, now seen corresponding path program 1 times [2019-11-15 23:49:02,017 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:02,017 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506979543] [2019-11-15 23:49:02,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:02,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:02,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:02,340 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 23:49:02,340 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506979543] [2019-11-15 23:49:02,340 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190532402] [2019-11-15 23:49:02,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:49:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:02,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-15 23:49:02,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:49:02,440 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 23:49:02,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:02,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:02,458 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 23:49:02,458 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:02,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:02,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:49:02,468 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2019-11-15 23:49:02,515 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-15 23:49:02,515 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:02,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:02,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-15 23:49:02,523 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:02,525 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:02,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:49:02,526 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:9 [2019-11-15 23:49:02,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:02,603 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-15 23:49:02,603 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:02,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:02,626 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:02,627 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 23:49:02,627 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:02,637 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:02,638 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:49:02,638 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:25 [2019-11-15 23:49:02,754 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-15 23:49:02,754 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:02,756 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:02,759 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-15 23:49:02,759 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:02,761 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:02,762 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:49:02,762 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:9 [2019-11-15 23:49:02,806 INFO L392 ElimStorePlain]: Different costs {1=[|v_#valid_BEFORE_CALL_8|], 3=[|v_old(#length)_AFTER_CALL_12|]} [2019-11-15 23:49:02,820 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:02,820 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 23:49:02,821 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:02,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:02,848 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:02,849 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 44 [2019-11-15 23:49:02,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:02,850 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:02,888 INFO L567 ElimStorePlain]: treesize reduction 16, result has 69.2 percent of original size [2019-11-15 23:49:02,889 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:49:02,889 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:38 [2019-11-15 23:49:02,937 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 23:49:02,938 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:49:02,938 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 22 [2019-11-15 23:49:02,938 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393229685] [2019-11-15 23:49:02,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-15 23:49:02,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:02,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-15 23:49:02,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2019-11-15 23:49:02,940 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 23 states. [2019-11-15 23:49:03,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:03,794 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2019-11-15 23:49:03,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 23:49:03,794 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 49 [2019-11-15 23:49:03,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:49:03,795 INFO L225 Difference]: With dead ends: 106 [2019-11-15 23:49:03,795 INFO L226 Difference]: Without dead ends: 106 [2019-11-15 23:49:03,796 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=179, Invalid=1011, Unknown=0, NotChecked=0, Total=1190 [2019-11-15 23:49:03,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-15 23:49:03,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 90. [2019-11-15 23:49:03,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-15 23:49:03,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2019-11-15 23:49:03,801 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 49 [2019-11-15 23:49:03,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:49:03,801 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2019-11-15 23:49:03,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-15 23:49:03,801 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2019-11-15 23:49:03,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-15 23:49:03,808 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:49:03,808 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:49:04,008 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:49:04,009 INFO L410 AbstractCegarLoop]: === Iteration 18 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-15 23:49:04,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:04,009 INFO L82 PathProgramCache]: Analyzing trace with hash 621660426, now seen corresponding path program 1 times [2019-11-15 23:49:04,009 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:04,009 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374294710] [2019-11-15 23:49:04,010 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:04,010 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:04,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:04,088 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 23:49:04,088 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374294710] [2019-11-15 23:49:04,089 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060749663] [2019-11-15 23:49:04,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:49:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:04,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:49:04,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:49:04,179 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 23:49:04,181 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:49:04,182 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2019-11-15 23:49:04,182 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119354156] [2019-11-15 23:49:04,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:49:04,183 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:04,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:49:04,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:49:04,184 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand 8 states. [2019-11-15 23:49:04,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:04,320 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2019-11-15 23:49:04,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:49:04,320 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-11-15 23:49:04,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:49:04,322 INFO L225 Difference]: With dead ends: 99 [2019-11-15 23:49:04,322 INFO L226 Difference]: Without dead ends: 99 [2019-11-15 23:49:04,322 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:49:04,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-15 23:49:04,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2019-11-15 23:49:04,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-15 23:49:04,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2019-11-15 23:49:04,327 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 58 [2019-11-15 23:49:04,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:49:04,327 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2019-11-15 23:49:04,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:49:04,327 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2019-11-15 23:49:04,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 23:49:04,328 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:49:04,328 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:49:04,536 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:49:04,536 INFO L410 AbstractCegarLoop]: === Iteration 19 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-15 23:49:04,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:04,536 INFO L82 PathProgramCache]: Analyzing trace with hash -910690847, now seen corresponding path program 1 times [2019-11-15 23:49:04,537 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:04,537 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505356146] [2019-11-15 23:49:04,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:04,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:04,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:04,994 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 23:49:04,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505356146] [2019-11-15 23:49:04,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532016387] [2019-11-15 23:49:04,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:49:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:05,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-15 23:49:05,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:49:05,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:49:05,170 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-11-15 23:49:05,171 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:05,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:05,188 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:05,188 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 23:49:05,188 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:05,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:05,197 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:49:05,197 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:32 [2019-11-15 23:49:05,304 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 23:49:05,305 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:49:05,305 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7] total 24 [2019-11-15 23:49:05,305 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324723921] [2019-11-15 23:49:05,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-15 23:49:05,306 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:05,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-15 23:49:05,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2019-11-15 23:49:05,307 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand 25 states. [2019-11-15 23:49:07,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:07,290 INFO L93 Difference]: Finished difference Result 135 states and 150 transitions. [2019-11-15 23:49:07,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-15 23:49:07,291 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 61 [2019-11-15 23:49:07,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:49:07,292 INFO L225 Difference]: With dead ends: 135 [2019-11-15 23:49:07,292 INFO L226 Difference]: Without dead ends: 135 [2019-11-15 23:49:07,293 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=273, Invalid=2177, Unknown=0, NotChecked=0, Total=2450 [2019-11-15 23:49:07,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-15 23:49:07,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 112. [2019-11-15 23:49:07,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-15 23:49:07,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2019-11-15 23:49:07,299 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 61 [2019-11-15 23:49:07,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:49:07,299 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2019-11-15 23:49:07,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-15 23:49:07,299 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2019-11-15 23:49:07,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-15 23:49:07,300 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:49:07,300 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:49:07,500 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:49:07,501 INFO L410 AbstractCegarLoop]: === Iteration 20 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-15 23:49:07,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:07,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1833354789, now seen corresponding path program 1 times [2019-11-15 23:49:07,501 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:07,501 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149219985] [2019-11-15 23:49:07,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:07,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:07,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:07,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:07,756 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-15 23:49:07,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149219985] [2019-11-15 23:49:07,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101485862] [2019-11-15 23:49:07,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:49:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:07,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 23:49:07,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:49:07,901 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-15 23:49:07,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:07,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:07,910 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:49:07,910 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:24 [2019-11-15 23:49:07,986 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 23:49:07,986 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:49:07,986 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 17 [2019-11-15 23:49:07,986 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592581786] [2019-11-15 23:49:07,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 23:49:07,988 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:07,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 23:49:07,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2019-11-15 23:49:07,989 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand 18 states. [2019-11-15 23:49:08,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:08,835 INFO L93 Difference]: Finished difference Result 128 states and 144 transitions. [2019-11-15 23:49:08,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:49:08,836 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 62 [2019-11-15 23:49:08,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:49:08,837 INFO L225 Difference]: With dead ends: 128 [2019-11-15 23:49:08,837 INFO L226 Difference]: Without dead ends: 128 [2019-11-15 23:49:08,838 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2019-11-15 23:49:08,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-15 23:49:08,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 118. [2019-11-15 23:49:08,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-15 23:49:08,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2019-11-15 23:49:08,845 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 130 transitions. Word has length 62 [2019-11-15 23:49:08,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:49:08,846 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 130 transitions. [2019-11-15 23:49:08,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 23:49:08,846 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 130 transitions. [2019-11-15 23:49:08,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 23:49:08,847 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:49:08,847 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:49:09,050 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:49:09,051 INFO L410 AbstractCegarLoop]: === Iteration 21 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-15 23:49:09,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:09,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1024566306, now seen corresponding path program 2 times [2019-11-15 23:49:09,051 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:09,051 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124803330] [2019-11-15 23:49:09,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:09,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:09,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:09,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:09,221 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 23 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-15 23:49:09,221 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124803330] [2019-11-15 23:49:09,221 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62337361] [2019-11-15 23:49:09,221 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:49:09,317 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:49:09,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:49:09,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:49:09,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:49:09,385 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 23:49:09,385 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:49:09,386 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 16 [2019-11-15 23:49:09,386 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981759050] [2019-11-15 23:49:09,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 23:49:09,387 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:09,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 23:49:09,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:49:09,387 INFO L87 Difference]: Start difference. First operand 118 states and 130 transitions. Second operand 16 states. [2019-11-15 23:49:09,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:09,835 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2019-11-15 23:49:09,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 23:49:09,836 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 68 [2019-11-15 23:49:09,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:49:09,837 INFO L225 Difference]: With dead ends: 122 [2019-11-15 23:49:09,837 INFO L226 Difference]: Without dead ends: 122 [2019-11-15 23:49:09,837 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2019-11-15 23:49:09,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-15 23:49:09,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2019-11-15 23:49:09,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-15 23:49:09,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2019-11-15 23:49:09,843 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 68 [2019-11-15 23:49:09,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:49:09,843 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2019-11-15 23:49:09,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 23:49:09,844 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2019-11-15 23:49:09,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 23:49:09,844 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:49:09,845 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:49:10,048 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:49:10,048 INFO L410 AbstractCegarLoop]: === Iteration 22 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-15 23:49:10,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:10,048 INFO L82 PathProgramCache]: Analyzing trace with hash 198847582, now seen corresponding path program 2 times [2019-11-15 23:49:10,048 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:10,049 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321166886] [2019-11-15 23:49:10,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:10,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:10,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:10,227 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 23:49:10,227 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321166886] [2019-11-15 23:49:10,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319110059] [2019-11-15 23:49:10,228 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:49:10,302 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-15 23:49:10,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:49:10,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 23:49:10,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:49:10,342 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-15 23:49:10,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:10,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:10,351 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:49:10,352 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:24 [2019-11-15 23:49:10,450 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-15 23:49:10,451 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:49:10,451 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 17 [2019-11-15 23:49:10,451 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447048124] [2019-11-15 23:49:10,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 23:49:10,452 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:10,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 23:49:10,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-11-15 23:49:10,452 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand 17 states. [2019-11-15 23:49:11,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:11,258 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2019-11-15 23:49:11,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 23:49:11,260 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-11-15 23:49:11,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:49:11,261 INFO L225 Difference]: With dead ends: 120 [2019-11-15 23:49:11,261 INFO L226 Difference]: Without dead ends: 120 [2019-11-15 23:49:11,262 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=172, Invalid=758, Unknown=0, NotChecked=0, Total=930 [2019-11-15 23:49:11,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-15 23:49:11,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 114. [2019-11-15 23:49:11,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-15 23:49:11,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2019-11-15 23:49:11,266 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 67 [2019-11-15 23:49:11,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:49:11,266 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2019-11-15 23:49:11,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 23:49:11,267 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2019-11-15 23:49:11,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 23:49:11,267 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:49:11,268 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:49:11,468 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:49:11,468 INFO L410 AbstractCegarLoop]: === Iteration 23 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-15 23:49:11,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:11,469 INFO L82 PathProgramCache]: Analyzing trace with hash -465323109, now seen corresponding path program 3 times [2019-11-15 23:49:11,469 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:11,469 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703799858] [2019-11-15 23:49:11,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:11,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:11,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:11,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:11,708 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 32 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 23:49:11,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703799858] [2019-11-15 23:49:11,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995297079] [2019-11-15 23:49:11,709 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:49:11,786 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-15 23:49:11,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:49:11,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-15 23:49:11,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:49:11,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-15 23:49:11,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:11,825 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:11,826 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:49:11,826 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:21 [2019-11-15 23:49:14,017 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-15 23:49:14,018 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:49:14,018 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 7] total 22 [2019-11-15 23:49:14,018 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073492554] [2019-11-15 23:49:14,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-15 23:49:14,019 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:14,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-15 23:49:14,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=447, Unknown=1, NotChecked=0, Total=506 [2019-11-15 23:49:14,019 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 23 states. [2019-11-15 23:49:16,209 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2019-11-15 23:49:16,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:16,822 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2019-11-15 23:49:16,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 23:49:16,822 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 73 [2019-11-15 23:49:16,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:49:16,823 INFO L225 Difference]: With dead ends: 120 [2019-11-15 23:49:16,823 INFO L226 Difference]: Without dead ends: 120 [2019-11-15 23:49:16,824 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=166, Invalid=1023, Unknown=1, NotChecked=0, Total=1190 [2019-11-15 23:49:16,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-15 23:49:16,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2019-11-15 23:49:16,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-15 23:49:16,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2019-11-15 23:49:16,828 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 73 [2019-11-15 23:49:16,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:49:16,828 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2019-11-15 23:49:16,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-15 23:49:16,828 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2019-11-15 23:49:16,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-15 23:49:16,829 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:49:16,829 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:49:17,029 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:49:17,030 INFO L410 AbstractCegarLoop]: === Iteration 24 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-15 23:49:17,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:17,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1369756115, now seen corresponding path program 2 times [2019-11-15 23:49:17,031 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:17,031 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686500683] [2019-11-15 23:49:17,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:17,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:17,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:17,428 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 34 proven. 42 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 23:49:17,428 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686500683] [2019-11-15 23:49:17,428 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515128116] [2019-11-15 23:49:17,429 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:49:17,518 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:49:17,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:49:17,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 23:49:17,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:49:17,701 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 56 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-15 23:49:17,701 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:49:17,701 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10] total 25 [2019-11-15 23:49:17,702 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882590416] [2019-11-15 23:49:17,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-15 23:49:17,702 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:17,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-15 23:49:17,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2019-11-15 23:49:17,703 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 25 states. [2019-11-15 23:49:19,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:19,174 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2019-11-15 23:49:19,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-15 23:49:19,174 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 81 [2019-11-15 23:49:19,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:49:19,175 INFO L225 Difference]: With dead ends: 122 [2019-11-15 23:49:19,175 INFO L226 Difference]: Without dead ends: 119 [2019-11-15 23:49:19,176 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=247, Invalid=1823, Unknown=0, NotChecked=0, Total=2070 [2019-11-15 23:49:19,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-15 23:49:19,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2019-11-15 23:49:19,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-15 23:49:19,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2019-11-15 23:49:19,180 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 81 [2019-11-15 23:49:19,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:49:19,180 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2019-11-15 23:49:19,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-15 23:49:19,181 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2019-11-15 23:49:19,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 23:49:19,181 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:49:19,182 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:49:19,382 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:49:19,382 INFO L410 AbstractCegarLoop]: === Iteration 25 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-15 23:49:19,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:19,382 INFO L82 PathProgramCache]: Analyzing trace with hash -104803242, now seen corresponding path program 3 times [2019-11-15 23:49:19,383 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:19,383 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766566184] [2019-11-15 23:49:19,383 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:19,383 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:19,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:19,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:19,958 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 13 proven. 41 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-15 23:49:19,959 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766566184] [2019-11-15 23:49:19,959 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928045191] [2019-11-15 23:49:19,959 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:49:20,068 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-15 23:49:20,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:49:20,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 97 conjunts are in the unsatisfiable core [2019-11-15 23:49:20,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:49:20,181 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:49:20,181 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:20,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:20,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:49:20,187 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-11-15 23:49:22,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-15 23:49:22,366 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:22,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:22,370 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:49:22,371 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:22,372 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:22,372 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:49:22,373 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:17, output treesize:1 [2019-11-15 23:49:22,422 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:22,422 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 23:49:22,422 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:22,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:22,438 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2019-11-15 23:49:22,439 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:22,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:22,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:49:22,448 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:14 [2019-11-15 23:49:22,487 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:22,487 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 46 [2019-11-15 23:49:22,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:22,506 INFO L567 ElimStorePlain]: treesize reduction 16, result has 68.6 percent of original size [2019-11-15 23:49:22,507 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:49:22,507 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:35 [2019-11-15 23:49:22,599 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-15 23:49:22,599 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:22,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:22,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:49:22,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:41 [2019-11-15 23:49:25,786 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-15 23:49:25,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:25,792 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:26,047 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-11-15 23:49:26,047 INFO L341 Elim1Store]: treesize reduction 141, result has 50.9 percent of original size [2019-11-15 23:49:26,047 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 68 treesize of output 202 [2019-11-15 23:49:26,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:26,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:26,427 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:49:26,428 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) 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.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.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.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) 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:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) 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-15 23:49:26,431 INFO L168 Benchmark]: Toolchain (without parser) took 35350.66 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 275.3 MB). Free memory was 944.7 MB in the beginning and 874.4 MB in the end (delta: 70.3 MB). Peak memory consumption was 345.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:49:26,431 INFO L168 Benchmark]: CDTParser took 0.26 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-15 23:49:26,432 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -189.1 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:49:26,432 INFO L168 Benchmark]: Boogie Preprocessor took 50.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:49:26,433 INFO L168 Benchmark]: RCFGBuilder took 503.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:49:26,433 INFO L168 Benchmark]: TraceAbstraction took 34488.65 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 136.3 MB). Free memory was 1.1 GB in the beginning and 874.4 MB in the end (delta: 230.3 MB). Peak memory consumption was 366.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:49:26,436 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.26 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 302.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -189.1 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 503.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 34488.65 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 136.3 MB). Free memory was 1.1 GB in the beginning and 874.4 MB in the end (delta: 230.3 MB). Peak memory consumption was 366.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 23:49:28,575 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:49:28,578 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:49:28,593 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:49:28,594 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:49:28,596 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:49:28,598 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:49:28,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:49:28,611 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:49:28,616 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:49:28,617 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:49:28,620 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:49:28,620 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:49:28,623 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:49:28,624 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:49:28,625 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:49:28,626 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:49:28,628 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:49:28,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:49:28,634 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:49:28,638 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:49:28,640 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:49:28,643 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:49:28,646 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:49:28,649 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:49:28,650 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:49:28,650 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:49:28,653 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:49:28,653 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:49:28,654 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:49:28,654 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:49:28,655 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:49:28,656 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:49:28,656 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:49:28,658 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:49:28,658 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:49:28,659 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:49:28,659 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:49:28,660 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:49:28,661 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:49:28,661 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:49:28,663 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-15 23:49:28,681 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:49:28,681 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:49:28,682 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:49:28,682 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:49:28,682 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:49:28,682 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:49:28,682 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:49:28,682 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:49:28,683 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:49:28,683 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:49:28,683 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:49:28,683 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 23:49:28,683 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 23:49:28,683 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 23:49:28,683 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:49:28,683 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 23:49:28,684 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 23:49:28,684 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:49:28,684 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:49:28,684 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:49:28,684 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:49:28,684 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:49:28,684 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:49:28,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:49:28,685 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:49:28,685 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:49:28,685 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 23:49:28,685 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 23:49:28,685 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 23:49:28,685 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_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/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 -> 2ef789dd0026a0c0ee3639964867439e8d9c0358 [2019-11-15 23:49:28,726 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:49:28,737 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:49:28,745 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:49:28,746 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:49:28,748 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:49:28,749 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2.c [2019-11-15 23:49:28,807 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/data/57a969542/cb259f82178744b0b7fa89460e744bb5/FLAG83ccb34bb [2019-11-15 23:49:29,190 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:49:29,191 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2.c [2019-11-15 23:49:29,198 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/data/57a969542/cb259f82178744b0b7fa89460e744bb5/FLAG83ccb34bb [2019-11-15 23:49:29,559 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/bin/uautomizer/data/57a969542/cb259f82178744b0b7fa89460e744bb5 [2019-11-15 23:49:29,562 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:49:29,563 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 23:49:29,564 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:49:29,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:49:29,571 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:49:29,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:49:29" (1/1) ... [2019-11-15 23:49:29,574 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a6a5db5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:29, skipping insertion in model container [2019-11-15 23:49:29,575 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:49:29" (1/1) ... [2019-11-15 23:49:29,582 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:49:29,603 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:49:29,834 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:49:29,848 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:49:29,886 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:49:29,903 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:49:29,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:29 WrapperNode [2019-11-15 23:49:29,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:49:29,905 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:49:29,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:49:29,905 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:49:29,978 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:29" (1/1) ... [2019-11-15 23:49:29,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:29" (1/1) ... [2019-11-15 23:49:30,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:29" (1/1) ... [2019-11-15 23:49:30,002 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:29" (1/1) ... [2019-11-15 23:49:30,011 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:29" (1/1) ... [2019-11-15 23:49:30,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:29" (1/1) ... [2019-11-15 23:49:30,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:29" (1/1) ... [2019-11-15 23:49:30,041 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:49:30,044 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:49:30,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:49:30,045 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:49:30,046 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/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-15 23:49:30,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 23:49:30,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:49:30,105 INFO L138 BoogieDeclarations]: Found implementation of procedure bar [2019-11-15 23:49:30,105 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-11-15 23:49:30,106 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 23:49:30,106 INFO L130 BoogieDeclarations]: Found specification of procedure bar [2019-11-15 23:49:30,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 23:49:30,107 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-11-15 23:49:30,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:49:30,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 23:49:30,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:49:30,108 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 23:49:30,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 23:49:30,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:49:30,509 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:49:30,509 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 23:49:30,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:49:30 BoogieIcfgContainer [2019-11-15 23:49:30,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:49:30,512 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:49:30,512 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:49:30,515 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:49:30,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:49:29" (1/3) ... [2019-11-15 23:49:30,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a75563a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:49:30, skipping insertion in model container [2019-11-15 23:49:30,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:29" (2/3) ... [2019-11-15 23:49:30,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a75563a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:49:30, skipping insertion in model container [2019-11-15 23:49:30,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:49:30" (3/3) ... [2019-11-15 23:49:30,522 INFO L109 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2.c [2019-11-15 23:49:30,533 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:49:30,540 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2019-11-15 23:49:30,551 INFO L249 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2019-11-15 23:49:30,578 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:49:30,579 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 23:49:30,579 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:49:30,579 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:49:30,579 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:49:30,579 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:49:30,579 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:49:30,579 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:49:30,592 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2019-11-15 23:49:30,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 23:49:30,602 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:49:30,603 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:49:30,604 INFO L410 AbstractCegarLoop]: === Iteration 1 === [barErr0REQUIRES_VIOLATION, barErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-11-15 23:49:30,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:30,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1451105141, now seen corresponding path program 1 times [2019-11-15 23:49:30,616 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:49:30,616 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [354604069] [2019-11-15 23:49:30,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/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-15 23:49:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:30,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-15 23:49:30,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:49:30,713 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-15 23:49:30,714 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:49:30,732 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-15 23:49:30,733 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [354604069] [2019-11-15 23:49:30,733 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:49:30,734 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-15 23:49:30,734 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489285821] [2019-11-15 23:49:30,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 23:49:30,738 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:49:30,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 23:49:30,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:49:30,752 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 2 states. [2019-11-15 23:49:30,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:30,766 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2019-11-15 23:49:30,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 23:49:30,767 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-15 23:49:30,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:49:30,774 INFO L225 Difference]: With dead ends: 50 [2019-11-15 23:49:30,775 INFO L226 Difference]: Without dead ends: 47 [2019-11-15 23:49:30,776 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:49:30,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-15 23:49:30,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-15 23:49:30,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-15 23:49:30,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2019-11-15 23:49:30,814 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 10 [2019-11-15 23:49:30,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:49:30,814 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2019-11-15 23:49:30,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 23:49:30,815 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2019-11-15 23:49:30,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 23:49:30,815 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:49:30,815 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:49:31,017 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:49:31,017 INFO L410 AbstractCegarLoop]: === Iteration 2 === [barErr0REQUIRES_VIOLATION, barErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-11-15 23:49:31,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:31,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1450777440, now seen corresponding path program 1 times [2019-11-15 23:49:31,023 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:49:31,023 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1957394806] [2019-11-15 23:49:31,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/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-15 23:49:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:31,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:49:31,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:49:31,120 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-15 23:49:31,123 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:49:31,142 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-15 23:49:31,143 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1957394806] [2019-11-15 23:49:31,143 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:49:31,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 23:49:31,143 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825029141] [2019-11-15 23:49:31,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:49:31,145 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:49:31,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:49:31,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:49:31,148 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 4 states. [2019-11-15 23:49:31,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:31,228 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2019-11-15 23:49:31,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:49:31,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-15 23:49:31,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:49:31,232 INFO L225 Difference]: With dead ends: 54 [2019-11-15 23:49:31,232 INFO L226 Difference]: Without dead ends: 54 [2019-11-15 23:49:31,233 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:49:31,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-15 23:49:31,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-11-15 23:49:31,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-15 23:49:31,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2019-11-15 23:49:31,244 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 10 [2019-11-15 23:49:31,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:49:31,245 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2019-11-15 23:49:31,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:49:31,245 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2019-11-15 23:49:31,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 23:49:31,246 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:49:31,246 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:49:31,457 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:49:31,457 INFO L410 AbstractCegarLoop]: === Iteration 3 === [barErr0REQUIRES_VIOLATION, barErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-11-15 23:49:31,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:31,457 INFO L82 PathProgramCache]: Analyzing trace with hash 2027141917, now seen corresponding path program 1 times [2019-11-15 23:49:31,458 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:49:31,458 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1574889512] [2019-11-15 23:49:31,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/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-15 23:49:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:31,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:49:31,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:49:31,566 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-15 23:49:31,566 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:49:31,624 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-15 23:49:31,625 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1574889512] [2019-11-15 23:49:31,625 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:49:31,625 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-15 23:49:31,625 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111571975] [2019-11-15 23:49:31,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:49:31,626 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:49:31,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:49:31,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:49:31,627 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 8 states. [2019-11-15 23:49:31,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:31,868 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2019-11-15 23:49:31,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:49:31,869 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-11-15 23:49:31,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:49:31,871 INFO L225 Difference]: With dead ends: 60 [2019-11-15 23:49:31,871 INFO L226 Difference]: Without dead ends: 60 [2019-11-15 23:49:31,872 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:49:31,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-15 23:49:31,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-11-15 23:49:31,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-15 23:49:31,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2019-11-15 23:49:31,881 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 11 [2019-11-15 23:49:31,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:49:31,881 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2019-11-15 23:49:31,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:49:31,882 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2019-11-15 23:49:31,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 23:49:31,883 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:49:31,883 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:49:32,085 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:49:32,085 INFO L410 AbstractCegarLoop]: === Iteration 4 === [barErr0REQUIRES_VIOLATION, barErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-11-15 23:49:32,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:32,086 INFO L82 PathProgramCache]: Analyzing trace with hash -950239869, now seen corresponding path program 1 times [2019-11-15 23:49:32,086 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:49:32,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [656885979] [2019-11-15 23:49:32,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/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-15 23:49:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:32,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:49:32,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:49:32,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:49:32,232 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:49:32,332 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-15 23:49:32,332 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [656885979] [2019-11-15 23:49:32,333 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:49:32,333 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-15 23:49:32,333 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348591551] [2019-11-15 23:49:32,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 23:49:32,333 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:49:32,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:49:32,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:49:32,334 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 12 states. [2019-11-15 23:49:32,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:32,626 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2019-11-15 23:49:32,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:49:32,628 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2019-11-15 23:49:32,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:49:32,629 INFO L225 Difference]: With dead ends: 65 [2019-11-15 23:49:32,630 INFO L226 Difference]: Without dead ends: 65 [2019-11-15 23:49:32,630 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:49:32,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-15 23:49:32,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-11-15 23:49:32,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-15 23:49:32,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2019-11-15 23:49:32,644 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 14 [2019-11-15 23:49:32,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:49:32,644 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2019-11-15 23:49:32,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 23:49:32,645 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2019-11-15 23:49:32,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 23:49:32,647 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:49:32,648 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:49:32,851 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:49:32,852 INFO L410 AbstractCegarLoop]: === Iteration 5 === [barErr0REQUIRES_VIOLATION, barErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-11-15 23:49:32,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:32,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1281570102, now seen corresponding path program 1 times [2019-11-15 23:49:32,853 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:49:32,853 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [701807285] [2019-11-15 23:49:32,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/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-15 23:49:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:32,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:49:32,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:49:32,955 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-15 23:49:32,955 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:49:33,032 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-15 23:49:33,033 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [701807285] [2019-11-15 23:49:33,033 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:49:33,033 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-15 23:49:33,033 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860544098] [2019-11-15 23:49:33,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:49:33,034 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:49:33,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:49:33,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:49:33,035 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 5 states. [2019-11-15 23:49:33,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:49:33,065 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2019-11-15 23:49:33,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:49:33,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-15 23:49:33,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:49:33,066 INFO L225 Difference]: With dead ends: 72 [2019-11-15 23:49:33,067 INFO L226 Difference]: Without dead ends: 72 [2019-11-15 23:49:33,067 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:49:33,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-15 23:49:33,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2019-11-15 23:49:33,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-15 23:49:33,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2019-11-15 23:49:33,079 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 20 [2019-11-15 23:49:33,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:49:33,081 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2019-11-15 23:49:33,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:49:33,081 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2019-11-15 23:49:33,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 23:49:33,082 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:49:33,082 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:49:33,287 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:49:33,287 INFO L410 AbstractCegarLoop]: === Iteration 6 === [barErr0REQUIRES_VIOLATION, barErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-11-15 23:49:33,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:33,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1281599893, now seen corresponding path program 1 times [2019-11-15 23:49:33,288 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:49:33,288 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [388072917] [2019-11-15 23:49:33,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/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-15 23:49:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:33,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 23:49:33,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:49:33,432 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 23:49:33,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:33,452 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:33,457 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 23:49:33,457 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:33,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:33,469 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:49:33,469 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2019-11-15 23:49:35,561 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-15 23:49:35,562 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:35,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:35,578 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-15 23:49:35,578 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:35,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:35,583 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:49:35,584 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2019-11-15 23:49:35,703 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:35,704 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 23:49:35,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:35,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:35,724 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2019-11-15 23:49:35,725 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:49:35,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:49:35,741 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:49:35,742 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:25 [2019-11-15 23:49:37,020 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-15 23:49:37,020 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:49:37,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:39,527 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-11-15 23:49:39,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:39,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:39,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:39,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:39,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:39,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:39,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:49:54,089 WARN L191 SmtUtils]: Spent 11.80 s on a formula simplification. DAG size of input: 61 DAG size of output: 36 [2019-11-15 23:49:54,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:49:56,492 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-11-15 23:50:00,638 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-15 23:50:00,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [388072917] [2019-11-15 23:50:00,639 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:50:00,639 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 10 [2019-11-15 23:50:00,640 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426307382] [2019-11-15 23:50:00,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 23:50:00,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:50:00,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 23:50:00,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=80, Unknown=3, NotChecked=0, Total=110 [2019-11-15 23:50:00,641 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 11 states. [2019-11-15 23:50:10,856 WARN L838 $PredicateComparison]: unable to prove that (and (= (bvadd (select |c_#length| |c_main_~#b~0.base|) (_ bv4294966896 32)) (_ bv0 32)) (exists ((|foo_~#a~0.base| (_ BitVec 32)) (foo_~n (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~0.base| (bvmul foo_~n (_ bv4 32)))) (= (_ bv0 1) (select |c_old(#valid)| |foo_~#a~0.base|)))) (= (_ bv0 32) c_main_~i~2) (= (_ bv0 32) |c_main_~#b~0.offset|) (forall ((|v_main_~#b~0.base_BEFORE_CALL_2| (_ BitVec 32)) (|v_foo_~#a~0.base_25| (_ BitVec 32)) (v_foo_~n_10 (_ BitVec 32)) (|v_main_~#b~0.offset_BEFORE_CALL_2| (_ BitVec 32)) (v_main_~i~2_BEFORE_CALL_4 (_ BitVec 32))) (let ((.cse2 (bvmul v_main_~i~2_BEFORE_CALL_4 (_ bv4 32)))) (let ((.cse1 (bvadd |v_main_~#b~0.offset_BEFORE_CALL_2| .cse2)) (.cse0 (bvadd |v_main_~#b~0.offset_BEFORE_CALL_2| .cse2 (_ bv4 32)))) (or (exists ((|v_foo_~#a~0.base_22| (_ BitVec 32)) (v_foo_~n_9 (_ BitVec 32))) (and (not (bvsle (bvadd |v_main_~#b~0.offset_BEFORE_CALL_2| (bvmul v_main_~i~2_BEFORE_CALL_4 (_ bv4 32)) (_ bv4 32)) (select (store |c_old(#length)| |v_foo_~#a~0.base_22| (bvmul v_foo_~n_9 (_ bv4 32))) |v_main_~#b~0.base_BEFORE_CALL_2|))) (= (select |c_old(#valid)| |v_foo_~#a~0.base_22|) (_ bv0 1)))) (bvsle .cse0 (select (store |c_#length| |v_foo_~#a~0.base_25| (bvmul v_foo_~n_10 (_ bv4 32))) |v_main_~#b~0.base_BEFORE_CALL_2|)) (not (= (_ bv0 1) (select |c_#valid| |v_foo_~#a~0.base_25|))) (not (bvsle (_ bv0 32) .cse1)) (not (bvsle .cse1 .cse0)))))) (= (_ bv1 1) (select |c_#valid| |c_main_~#b~0.base|))) is different from false [2019-11-15 23:50:15,060 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| (_ BitVec 32)) (foo_~n (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~0.base| (bvmul foo_~n (_ bv4 32)))) (= (_ bv0 1) (select |c_old(#valid)| |foo_~#a~0.base|)))) (forall ((|v_main_~#b~0.base_BEFORE_CALL_2| (_ BitVec 32)) (|v_foo_~#a~0.base_25| (_ BitVec 32)) (v_foo_~n_10 (_ BitVec 32)) (|v_main_~#b~0.offset_BEFORE_CALL_2| (_ BitVec 32)) (v_main_~i~2_BEFORE_CALL_4 (_ BitVec 32))) (let ((.cse2 (bvmul v_main_~i~2_BEFORE_CALL_4 (_ bv4 32)))) (let ((.cse1 (bvadd |v_main_~#b~0.offset_BEFORE_CALL_2| .cse2)) (.cse0 (bvadd |v_main_~#b~0.offset_BEFORE_CALL_2| .cse2 (_ bv4 32)))) (or (exists ((|v_foo_~#a~0.base_22| (_ BitVec 32)) (v_foo_~n_9 (_ BitVec 32))) (and (not (bvsle (bvadd |v_main_~#b~0.offset_BEFORE_CALL_2| (bvmul v_main_~i~2_BEFORE_CALL_4 (_ bv4 32)) (_ bv4 32)) (select (store |c_old(#length)| |v_foo_~#a~0.base_22| (bvmul v_foo_~n_9 (_ bv4 32))) |v_main_~#b~0.base_BEFORE_CALL_2|))) (= (select |c_old(#valid)| |v_foo_~#a~0.base_22|) (_ bv0 1)))) (bvsle .cse0 (select (store |c_#length| |v_foo_~#a~0.base_25| (bvmul v_foo_~n_10 (_ bv4 32))) |v_main_~#b~0.base_BEFORE_CALL_2|)) (not (= (_ bv0 1) (select |c_#valid| |v_foo_~#a~0.base_25|))) (not (bvsle (_ bv0 32) .cse1)) (not (bvsle .cse1 .cse0))))))) is different from false [2019-11-15 23:50:23,485 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-15 23:50:26,514 WARN L191 SmtUtils]: Spent 2.85 s on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2019-11-15 23:50:31,086 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| (_ BitVec 32)) (foo_~n (_ BitVec 32))) (= (bvmul (_ bv4 32) foo_~n) (select |c_#length| |foo_~#a~0.base|))) (forall ((|v_main_~#b~0.base_BEFORE_CALL_2| (_ BitVec 32)) (|v_main_~#b~0.offset_BEFORE_CALL_2| (_ BitVec 32)) (v_main_~i~2_BEFORE_CALL_4 (_ BitVec 32))) (let ((.cse2 (bvmul v_main_~i~2_BEFORE_CALL_4 (_ bv4 32)))) (let ((.cse1 (bvadd |v_main_~#b~0.offset_BEFORE_CALL_2| .cse2)) (.cse0 (bvadd |v_main_~#b~0.offset_BEFORE_CALL_2| .cse2 (_ bv4 32)))) (or (exists ((|v_foo_~#a~0.base_22| (_ BitVec 32)) (v_foo_~n_9 (_ BitVec 32))) (and (not (bvsle (bvadd |v_main_~#b~0.offset_BEFORE_CALL_2| (bvmul v_main_~i~2_BEFORE_CALL_4 (_ bv4 32)) (_ bv4 32)) (select (store |c_old(#length)| |v_foo_~#a~0.base_22| (bvmul v_foo_~n_9 (_ bv4 32))) |v_main_~#b~0.base_BEFORE_CALL_2|))) (= (select |c_old(#valid)| |v_foo_~#a~0.base_22|) (_ bv0 1)))) (bvsle .cse0 (select |c_#length| |v_main_~#b~0.base_BEFORE_CALL_2|)) (not (bvsle (_ bv0 32) .cse1)) (not (bvsle .cse1 .cse0)))))) (= |c_#valid| |c_old(#valid)|) (exists ((v_prenex_4 (_ BitVec 32))) (= (select |c_old(#valid)| v_prenex_4) (_ bv0 1))) (= |c_old(#length)| |c_#length|)) is different from false [2019-11-15 23:50:35,435 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 20 [2019-11-15 23:50:37,484 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_main_~#b~0.base_BEFORE_CALL_2| (_ BitVec 32)) (|v_main_~#b~0.offset_BEFORE_CALL_2| (_ BitVec 32)) (v_main_~i~2_BEFORE_CALL_4 (_ BitVec 32))) (let ((.cse2 (bvmul v_main_~i~2_BEFORE_CALL_4 (_ bv4 32)))) (let ((.cse1 (bvadd |v_main_~#b~0.offset_BEFORE_CALL_2| .cse2)) (.cse0 (bvadd |v_main_~#b~0.offset_BEFORE_CALL_2| .cse2 (_ bv4 32)))) (or (exists ((|v_foo_~#a~0.base_22| (_ BitVec 32)) (v_foo_~n_9 (_ BitVec 32))) (and (not (bvsle (bvadd |v_main_~#b~0.offset_BEFORE_CALL_2| (bvmul v_main_~i~2_BEFORE_CALL_4 (_ bv4 32)) (_ bv4 32)) (select (store |c_old(#length)| |v_foo_~#a~0.base_22| (bvmul v_foo_~n_9 (_ bv4 32))) |v_main_~#b~0.base_BEFORE_CALL_2|))) (= (select |c_old(#valid)| |v_foo_~#a~0.base_22|) (_ bv0 1)))) (bvsle .cse0 (select |c_#length| |v_main_~#b~0.base_BEFORE_CALL_2|)) (not (bvsle (_ bv0 32) .cse1)) (not (bvsle .cse1 .cse0)))))) (= |c_#valid| |c_old(#valid)|) (exists ((v_prenex_4 (_ BitVec 32))) (= (select |c_old(#valid)| v_prenex_4) (_ bv0 1))) (= |c_old(#length)| |c_#length|)) is different from false [2019-11-15 23:50:38,192 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2019-11-15 23:50:56,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:56,179 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2019-11-15 23:50:56,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 23:50:56,180 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-11-15 23:50:56,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:56,183 INFO L225 Difference]: With dead ends: 113 [2019-11-15 23:50:56,183 INFO L226 Difference]: Without dead ends: 113 [2019-11-15 23:50:56,183 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 44.5s TimeCoverageRelationStatistics Valid=69, Invalid=180, Unknown=7, NotChecked=124, Total=380 [2019-11-15 23:50:56,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-15 23:50:56,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 90. [2019-11-15 23:50:56,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-15 23:50:56,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 105 transitions. [2019-11-15 23:50:56,196 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 105 transitions. Word has length 20 [2019-11-15 23:50:56,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:56,196 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 105 transitions. [2019-11-15 23:50:56,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 23:50:56,196 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 105 transitions. [2019-11-15 23:50:56,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 23:50:56,197 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:56,197 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:50:56,399 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:50:56,399 INFO L410 AbstractCegarLoop]: === Iteration 7 === [barErr0REQUIRES_VIOLATION, barErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-11-15 23:50:56,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:56,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1281599892, now seen corresponding path program 1 times [2019-11-15 23:50:56,400 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:50:56,400 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1905935228] [2019-11-15 23:50:56,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/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-15 23:50:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:56,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:50:56,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:50:56,489 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 23:50:56,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:50:56,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:50:56,492 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:50:56,492 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-15 23:50:56,522 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-15 23:50:56,522 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:50:56,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:50:56,531 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-15 23:50:56,531 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-11-15 23:50:58,622 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:50:58,622 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 23:50:58,623 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:50:58,638 INFO L567 ElimStorePlain]: treesize reduction 18, result has 37.9 percent of original size [2019-11-15 23:50:58,638 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-15 23:50:58,639 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-11-15 23:50:58,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:50:58,653 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:50:58,771 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-15 23:50:58,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1905935228] [2019-11-15 23:50:58,771 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:50:58,771 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 4] imperfect sequences [] total 9 [2019-11-15 23:50:58,771 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834370958] [2019-11-15 23:50:58,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:50:58,772 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:50:58,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:50:58,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=62, Unknown=1, NotChecked=0, Total=90 [2019-11-15 23:50:58,772 INFO L87 Difference]: Start difference. First operand 90 states and 105 transitions. Second operand 10 states. [2019-11-15 23:51:29,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:29,288 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2019-11-15 23:51:29,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:51:29,289 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-15 23:51:29,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:29,290 INFO L225 Difference]: With dead ends: 87 [2019-11-15 23:51:29,290 INFO L226 Difference]: Without dead ends: 87 [2019-11-15 23:51:29,291 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=51, Invalid=128, Unknown=3, NotChecked=0, Total=182 [2019-11-15 23:51:29,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-15 23:51:29,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-11-15 23:51:29,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-15 23:51:29,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 100 transitions. [2019-11-15 23:51:29,300 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 100 transitions. Word has length 20 [2019-11-15 23:51:29,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:29,300 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 100 transitions. [2019-11-15 23:51:29,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:51:29,300 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 100 transitions. [2019-11-15 23:51:29,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 23:51:29,301 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:29,302 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:29,503 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:51:29,503 INFO L410 AbstractCegarLoop]: === Iteration 8 === [barErr0REQUIRES_VIOLATION, barErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-11-15 23:51:29,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:29,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1083248999, now seen corresponding path program 1 times [2019-11-15 23:51:29,504 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:51:29,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [592965160] [2019-11-15 23:51:29,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/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-15 23:51:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:29,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:51:29,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:51:29,659 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:51:29,659 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2019-11-15 23:51:29,660 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:51:29,678 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-15 23:51:29,678 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-15 23:51:29,679 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-15 23:51:29,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:51:29,697 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:51:29,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:51:29,724 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [592965160] [2019-11-15 23:51:29,724 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:51:29,725 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-15 23:51:29,725 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142769623] [2019-11-15 23:51:29,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:51:29,725 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:51:29,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:51:29,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:51:29,726 INFO L87 Difference]: Start difference. First operand 87 states and 100 transitions. Second operand 5 states. [2019-11-15 23:51:29,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:29,899 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2019-11-15 23:51:29,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:51:29,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-15 23:51:29,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:29,901 INFO L225 Difference]: With dead ends: 86 [2019-11-15 23:51:29,901 INFO L226 Difference]: Without dead ends: 86 [2019-11-15 23:51:29,902 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:51:29,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-15 23:51:29,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-11-15 23:51:29,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-15 23:51:29,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2019-11-15 23:51:29,908 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 27 [2019-11-15 23:51:29,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:29,909 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2019-11-15 23:51:29,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:51:29,909 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2019-11-15 23:51:29,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 23:51:29,910 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:29,910 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:51:30,124 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:51:30,124 INFO L410 AbstractCegarLoop]: === Iteration 9 === [barErr0REQUIRES_VIOLATION, barErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-11-15 23:51:30,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:30,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1083248998, now seen corresponding path program 1 times [2019-11-15 23:51:30,125 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:51:30,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2126422738] [2019-11-15 23:51:30,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa9ba6e1-0449-4706-b4bf-7c59afdc9691/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-15 23:51:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:30,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-15 23:51:30,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:51:30,260 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 23:51:30,260 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:51:30,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:51:30,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:51:30,267 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 23:51:30,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-15 23:51:30,313 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:51:30,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:51:30,316 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:51:30,317 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2019-11-15 23:51:30,430 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 23:51:30,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:51:30,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:51:30,437 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:51:30,437 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:14 [2019-11-15 23:51:32,497 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:51:32,498 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 32 [2019-11-15 23:51:32,498 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:51:32,528 INFO L567 ElimStorePlain]: treesize reduction 12, result has 67.6 percent of original size [2019-11-15 23:51:32,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:51:32,529 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:51:32,529 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:25 [2019-11-15 23:51:32,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:51:32,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:51:32,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:51:32,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:51:32,742 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:51:32,742 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 42 [2019-11-15 23:51:32,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:51:32,841 INFO L567 ElimStorePlain]: treesize reduction 12, result has 80.3 percent of original size [2019-11-15 23:51:32,880 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:51:32,880 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 36 [2019-11-15 23:51:32,881 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:51:32,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:51:32,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:51:32,923 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 23:51:32,924 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:44, output treesize:40 [2019-11-15 23:51:32,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:51:35,016 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 31 [2019-11-15 23:51:35,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:51:35,078 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:51:35,079 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:51:37,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:51:44,126 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:51:44,126 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2019-11-15 23:51:44,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:51:44,127 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:51:44,252 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-11-15 23:51:44,253 INFO L567 ElimStorePlain]: treesize reduction 5, result has 93.4 percent of original size [2019-11-15 23:51:44,274 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:51:44,274 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2019-11-15 23:51:44,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:51:44,275 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:51:44,461 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-11-15 23:51:44,461 INFO L567 ElimStorePlain]: treesize reduction 9, result has 86.8 percent of original size [2019-11-15 23:51:44,478 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:51:44,478 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2019-11-15 23:51:44,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:51:44,480 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:51:44,599 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-11-15 23:51:44,599 INFO L567 ElimStorePlain]: treesize reduction 5, result has 90.4 percent of original size [2019-11-15 23:51:44,600 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-15 23:51:44,600 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 11 variables, input treesize:83, output treesize:33 [2019-11-15 23:51:44,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:51:44,748 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-15 23:51:44,917 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:51:44,918 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-15 23:51:44,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:51:44,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:51:45,058 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-11-15 23:51:45,059 INFO L567 ElimStorePlain]: treesize reduction 9, result has 86.4 percent of original size [2019-11-15 23:51:45,260 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:51:45,260 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_main_~#b~0.offset_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#b~0.base_BEFORE_CALL_8| (_ BitVec 32)) (v_prenex_9 (_ BitVec 32)) (v_foo_~n_19 (_ BitVec 32))) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32)) (v_foo_~n_22 (_ BitVec 32))) (let ((.cse0 (bvadd |v_main_~#b~0.offset_BEFORE_CALL_5| (_ bv4 32)))) (or (= |v_main_~#b~0.base_BEFORE_CALL_8| |foo_~#a~0.base|) (bvsle .cse0 (select (store |#length| v_prenex_9 (bvmul v_foo_~n_19 (_ bv4 32))) |v_main_~#b~0.base_BEFORE_CALL_8|)) (not (bvsle |v_main_~#b~0.offset_BEFORE_CALL_5| .cse0)) (and (not (= v_prenex_15 |v_main_~#b~0.base_BEFORE_CALL_8|)) (not (bvsle .cse0 (select (store (store |old(#length)| v_prenex_12 (bvmul v_foo_~n_22 (_ bv4 32))) v_prenex_15 (bvmul v_prenex_16 (_ bv4 32))) |v_main_~#b~0.base_BEFORE_CALL_8|))) (not (= v_prenex_12 |v_main_~#b~0.base_BEFORE_CALL_8|))) (not (bvsle (_ bv0 32) |v_main_~#b~0.offset_BEFORE_CALL_5|)) (= v_prenex_9 |v_main_~#b~0.base_BEFORE_CALL_8|))))) 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.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.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.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) 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:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) 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-15 23:51:45,264 INFO L168 Benchmark]: Toolchain (without parser) took 135701.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.5 MB). Free memory was 947.0 MB in the beginning and 901.2 MB in the end (delta: 45.8 MB). Peak memory consumption was 251.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:51:45,265 INFO L168 Benchmark]: CDTParser took 0.85 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:51:45,265 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.34 ms. Allocated memory is still 1.0 GB. Free memory was 947.0 MB in the beginning and 936.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:51:45,266 INFO L168 Benchmark]: Boogie Preprocessor took 139.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -204.8 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:51:45,266 INFO L168 Benchmark]: RCFGBuilder took 466.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:51:45,267 INFO L168 Benchmark]: TraceAbstraction took 134751.39 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 54.0 MB). Free memory was 1.1 GB in the beginning and 901.2 MB in the end (delta: 214.3 MB). Peak memory consumption was 268.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:51:45,269 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.85 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 340.34 ms. Allocated memory is still 1.0 GB. Free memory was 947.0 MB in the beginning and 936.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 139.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -204.8 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 466.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 134751.39 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 54.0 MB). Free memory was 1.1 GB in the beginning and 901.2 MB in the end (delta: 214.3 MB). Peak memory consumption was 268.3 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_main_~#b~0.offset_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#b~0.base_BEFORE_CALL_8| (_ BitVec 32)) (v_prenex_9 (_ BitVec 32)) (v_foo_~n_19 (_ BitVec 32))) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32)) (v_foo_~n_22 (_ BitVec 32))) (let ((.cse0 (bvadd |v_main_~#b~0.offset_BEFORE_CALL_5| (_ bv4 32)))) (or (= |v_main_~#b~0.base_BEFORE_CALL_8| |foo_~#a~0.base|) (bvsle .cse0 (select (store |#length| v_prenex_9 (bvmul v_foo_~n_19 (_ bv4 32))) |v_main_~#b~0.base_BEFORE_CALL_8|)) (not (bvsle |v_main_~#b~0.offset_BEFORE_CALL_5| .cse0)) (and (not (= v_prenex_15 |v_main_~#b~0.base_BEFORE_CALL_8|)) (not (bvsle .cse0 (select (store (store |old(#length)| v_prenex_12 (bvmul v_foo_~n_22 (_ bv4 32))) v_prenex_15 (bvmul v_prenex_16 (_ bv4 32))) |v_main_~#b~0.base_BEFORE_CALL_8|))) (not (= v_prenex_12 |v_main_~#b~0.base_BEFORE_CALL_8|))) (not (bvsle (_ bv0 32) |v_main_~#b~0.offset_BEFORE_CALL_5|)) (= v_prenex_9 |v_main_~#b~0.base_BEFORE_CALL_8|))))) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: (forall ((|v_main_~#b~0.offset_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#b~0.base_BEFORE_CALL_8| (_ BitVec 32)) (v_prenex_9 (_ BitVec 32)) (v_foo_~n_19 (_ BitVec 32))) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32)) (v_foo_~n_22 (_ BitVec 32))) (let ((.cse0 (bvadd |v_main_~#b~0.offset_BEFORE_CALL_5| (_ bv4 32)))) (or (= |v_main_~#b~0.base_BEFORE_CALL_8| |foo_~#a~0.base|) (bvsle .cse0 (select (store |#length| v_prenex_9 (bvmul v_foo_~n_19 (_ bv4 32))) |v_main_~#b~0.base_BEFORE_CALL_8|)) (not (bvsle |v_main_~#b~0.offset_BEFORE_CALL_5| .cse0)) (and (not (= v_prenex_15 |v_main_~#b~0.base_BEFORE_CALL_8|)) (not (bvsle .cse0 (select (store (store |old(#length)| v_prenex_12 (bvmul v_foo_~n_22 (_ bv4 32))) v_prenex_15 (bvmul v_prenex_16 (_ bv4 32))) |v_main_~#b~0.base_BEFORE_CALL_8|))) (not (= v_prenex_12 |v_main_~#b~0.base_BEFORE_CALL_8|))) (not (bvsle (_ bv0 32) |v_main_~#b~0.offset_BEFORE_CALL_5|)) (= v_prenex_9 |v_main_~#b~0.base_BEFORE_CALL_8|))))): 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...