./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 678e0110 Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_214b198b-a2ba-4373-83fe-7d958d9c2fd6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_214b198b-a2ba-4373-83fe-7d958d9c2fd6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_214b198b-a2ba-4373-83fe-7d958d9c2fd6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_214b198b-a2ba-4373-83fe-7d958d9c2fd6/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_214b198b-a2ba-4373-83fe-7d958d9c2fd6/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_214b198b-a2ba-4373-83fe-7d958d9c2fd6/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 --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-19 22:47:34,816 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:47:34,818 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:47:34,832 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:47:34,832 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:47:34,834 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:47:34,835 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:47:34,843 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:47:34,848 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:47:34,852 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:47:34,853 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:47:34,854 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:47:34,854 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:47:34,856 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:47:34,857 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:47:34,858 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:47:34,859 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:47:34,860 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:47:34,862 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:47:34,866 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:47:34,869 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:47:34,871 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:47:34,874 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:47:34,875 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:47:34,877 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:47:34,878 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:47:34,878 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:47:34,879 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:47:34,880 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:47:34,881 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:47:34,881 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:47:34,881 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:47:34,882 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:47:34,883 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:47:34,884 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:47:34,884 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:47:34,884 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:47:34,885 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:47:34,885 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:47:34,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:47:34,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:47:34,887 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_214b198b-a2ba-4373-83fe-7d958d9c2fd6/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-19 22:47:34,911 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:47:34,921 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:47:34,922 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:47:34,922 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:47:34,922 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:47:34,923 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:47:34,923 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 22:47:34,923 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 22:47:34,923 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:47:34,923 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 22:47:34,924 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:47:34,924 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-19 22:47:34,924 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-19 22:47:34,924 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-19 22:47:34,924 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 22:47:34,925 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-19 22:47:34,925 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-19 22:47:34,926 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 22:47:34,926 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:47:34,926 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:47:34,927 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:47:34,927 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 22:47:34,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 22:47:34,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:47:34,927 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:47:34,928 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 22:47:34,928 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-19 22:47:34,928 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-19 22:47:34,928 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-19 22:47:34,929 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_214b198b-a2ba-4373-83fe-7d958d9c2fd6/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-19 22:47:35,102 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:47:35,116 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:47:35,119 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:47:35,120 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:47:35,121 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:47:35,121 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_214b198b-a2ba-4373-83fe-7d958d9c2fd6/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2.c [2019-11-19 22:47:35,180 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_214b198b-a2ba-4373-83fe-7d958d9c2fd6/bin/uautomizer/data/3f46b39e7/39d567507696440a8042ebc6672a501d/FLAGac85ba173 [2019-11-19 22:47:35,573 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:47:35,574 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_214b198b-a2ba-4373-83fe-7d958d9c2fd6/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2.c [2019-11-19 22:47:35,579 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_214b198b-a2ba-4373-83fe-7d958d9c2fd6/bin/uautomizer/data/3f46b39e7/39d567507696440a8042ebc6672a501d/FLAGac85ba173 [2019-11-19 22:47:35,995 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_214b198b-a2ba-4373-83fe-7d958d9c2fd6/bin/uautomizer/data/3f46b39e7/39d567507696440a8042ebc6672a501d [2019-11-19 22:47:35,998 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:47:35,999 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-19 22:47:36,003 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:47:36,004 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:47:36,007 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:47:36,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:47:35" (1/1) ... [2019-11-19 22:47:36,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@525ee995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:47:36, skipping insertion in model container [2019-11-19 22:47:36,016 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:47:35" (1/1) ... [2019-11-19 22:47:36,023 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:47:36,040 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:47:36,287 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:47:36,299 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:47:36,318 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:47:36,333 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:47:36,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:47:36 WrapperNode [2019-11-19 22:47:36,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:47:36,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:47:36,334 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:47:36,334 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:47:36,347 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:47:36" (1/1) ... [2019-11-19 22:47:36,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:47:36" (1/1) ... [2019-11-19 22:47:36,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:47:36" (1/1) ... [2019-11-19 22:47:36,356 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:47:36" (1/1) ... [2019-11-19 22:47:36,366 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:47:36" (1/1) ... [2019-11-19 22:47:36,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:47:36" (1/1) ... [2019-11-19 22:47:36,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:47:36" (1/1) ... [2019-11-19 22:47:36,375 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:47:36,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:47:36,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:47:36,376 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:47:36,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:47:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_214b198b-a2ba-4373-83fe-7d958d9c2fd6/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:47:36,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-19 22:47:36,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:47:36,442 INFO L138 BoogieDeclarations]: Found implementation of procedure bar [2019-11-19 22:47:36,442 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-11-19 22:47:36,443 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-19 22:47:36,443 INFO L130 BoogieDeclarations]: Found specification of procedure bar [2019-11-19 22:47:36,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-19 22:47:36,443 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-11-19 22:47:36,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 22:47:36,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-19 22:47:36,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 22:47:36,445 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-19 22:47:36,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-19 22:47:36,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:47:36,967 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:47:36,967 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-19 22:47:36,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:47:36 BoogieIcfgContainer [2019-11-19 22:47:36,968 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:47:36,969 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 22:47:36,969 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 22:47:36,972 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 22:47:36,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:47:35" (1/3) ... [2019-11-19 22:47:36,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44579410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:47:36, skipping insertion in model container [2019-11-19 22:47:36,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:47:36" (2/3) ... [2019-11-19 22:47:36,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44579410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:47:36, skipping insertion in model container [2019-11-19 22:47:36,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:47:36" (3/3) ... [2019-11-19 22:47:36,976 INFO L109 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2.c [2019-11-19 22:47:36,986 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 22:47:36,993 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2019-11-19 22:47:37,005 INFO L249 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2019-11-19 22:47:37,023 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 22:47:37,024 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-19 22:47:37,024 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 22:47:37,024 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:47:37,024 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:47:37,024 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 22:47:37,024 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:47:37,024 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 22:47:37,039 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2019-11-19 22:47:37,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-19 22:47:37,048 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:47:37,049 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:47:37,049 INFO L410 AbstractCegarLoop]: === Iteration 1 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-19 22:47:37,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:47:37,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1451105141, now seen corresponding path program 1 times [2019-11-19 22:47:37,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:47:37,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [333804195] [2019-11-19 22:47:37,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_214b198b-a2ba-4373-83fe-7d958d9c2fd6/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:47:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:47:37,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-19 22:47:37,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:47:37,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:47:37,175 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:47:37,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:47:37,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [333804195] [2019-11-19 22:47:37,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:47:37,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-19 22:47:37,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125145886] [2019-11-19 22:47:37,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 22:47:37,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:47:37,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 22:47:37,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 22:47:37,218 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 2 states. [2019-11-19 22:47:37,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:47:37,239 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2019-11-19 22:47:37,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 22:47:37,240 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-19 22:47:37,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:47:37,250 INFO L225 Difference]: With dead ends: 50 [2019-11-19 22:47:37,251 INFO L226 Difference]: Without dead ends: 47 [2019-11-19 22:47:37,252 INFO L630 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-19 22:47:37,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-19 22:47:37,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-19 22:47:37,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-19 22:47:37,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2019-11-19 22:47:37,286 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 10 [2019-11-19 22:47:37,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:47:37,286 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2019-11-19 22:47:37,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 22:47:37,286 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2019-11-19 22:47:37,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-19 22:47:37,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:47:37,287 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:47:37,489 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:47:37,489 INFO L410 AbstractCegarLoop]: === Iteration 2 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-19 22:47:37,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:47:37,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1450777440, now seen corresponding path program 1 times [2019-11-19 22:47:37,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:47:37,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1704498789] [2019-11-19 22:47:37,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_214b198b-a2ba-4373-83fe-7d958d9c2fd6/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:47:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:47:37,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:47:37,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:47:37,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:47:37,574 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:47:37,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:47:37,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1704498789] [2019-11-19 22:47:37,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:47:37,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-19 22:47:37,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133221535] [2019-11-19 22:47:37,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:47:37,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:47:37,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:47:37,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:47:37,591 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 4 states. [2019-11-19 22:47:37,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:47:37,682 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2019-11-19 22:47:37,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:47:37,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-19 22:47:37,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:47:37,685 INFO L225 Difference]: With dead ends: 54 [2019-11-19 22:47:37,685 INFO L226 Difference]: Without dead ends: 54 [2019-11-19 22:47:37,686 INFO L630 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-19 22:47:37,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-19 22:47:37,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-11-19 22:47:37,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-19 22:47:37,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2019-11-19 22:47:37,702 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 10 [2019-11-19 22:47:37,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:47:37,703 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2019-11-19 22:47:37,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:47:37,704 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2019-11-19 22:47:37,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-19 22:47:37,706 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:47:37,706 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:47:37,910 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:47:37,913 INFO L410 AbstractCegarLoop]: === Iteration 3 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-19 22:47:37,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:47:37,913 INFO L82 PathProgramCache]: Analyzing trace with hash 2027141917, now seen corresponding path program 1 times [2019-11-19 22:47:37,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:47:37,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [646597348] [2019-11-19 22:47:37,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_214b198b-a2ba-4373-83fe-7d958d9c2fd6/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:47:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:47:37,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 22:47:38,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:47:38,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:47:38,051 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:47:38,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:47:38,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [646597348] [2019-11-19 22:47:38,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:47:38,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-19 22:47:38,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599187034] [2019-11-19 22:47:38,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 22:47:38,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:47:38,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 22:47:38,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:47:38,115 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 8 states. [2019-11-19 22:47:38,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:47:38,339 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2019-11-19 22:47:38,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:47:38,341 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-11-19 22:47:38,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:47:38,342 INFO L225 Difference]: With dead ends: 60 [2019-11-19 22:47:38,342 INFO L226 Difference]: Without dead ends: 60 [2019-11-19 22:47:38,343 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:47:38,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-19 22:47:38,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-11-19 22:47:38,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-19 22:47:38,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2019-11-19 22:47:38,354 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 11 [2019-11-19 22:47:38,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:47:38,354 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2019-11-19 22:47:38,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 22:47:38,354 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2019-11-19 22:47:38,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-19 22:47:38,355 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:47:38,355 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:47:38,561 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:47:38,561 INFO L410 AbstractCegarLoop]: === Iteration 4 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-19 22:47:38,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:47:38,562 INFO L82 PathProgramCache]: Analyzing trace with hash -950239869, now seen corresponding path program 1 times [2019-11-19 22:47:38,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:47:38,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [725167947] [2019-11-19 22:47:38,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_214b198b-a2ba-4373-83fe-7d958d9c2fd6/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:47:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:47:38,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 22:47:38,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:47:38,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:47:38,724 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:47:38,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:47:38,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [725167947] [2019-11-19 22:47:38,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:47:38,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-19 22:47:38,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792400988] [2019-11-19 22:47:38,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 22:47:38,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:47:38,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 22:47:38,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-19 22:47:38,845 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 12 states. [2019-11-19 22:47:39,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:47:39,209 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2019-11-19 22:47:39,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 22:47:39,210 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2019-11-19 22:47:39,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:47:39,211 INFO L225 Difference]: With dead ends: 65 [2019-11-19 22:47:39,211 INFO L226 Difference]: Without dead ends: 65 [2019-11-19 22:47:39,212 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-11-19 22:47:39,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-19 22:47:39,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-11-19 22:47:39,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-19 22:47:39,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2019-11-19 22:47:39,218 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 14 [2019-11-19 22:47:39,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:47:39,219 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2019-11-19 22:47:39,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 22:47:39,219 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2019-11-19 22:47:39,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-19 22:47:39,220 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:47:39,220 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:47:39,420 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:47:39,421 INFO L410 AbstractCegarLoop]: === Iteration 5 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-19 22:47:39,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:47:39,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1281570102, now seen corresponding path program 1 times [2019-11-19 22:47:39,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:47:39,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1581462216] [2019-11-19 22:47:39,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_214b198b-a2ba-4373-83fe-7d958d9c2fd6/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:47:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:47:39,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:47:39,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:47:39,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:47:39,500 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:47:39,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:47:39,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1581462216] [2019-11-19 22:47:39,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:47:39,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-19 22:47:39,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722774928] [2019-11-19 22:47:39,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 22:47:39,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:47:39,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:47:39,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:47:39,581 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 5 states. [2019-11-19 22:47:39,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:47:39,613 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2019-11-19 22:47:39,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:47:39,617 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-19 22:47:39,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:47:39,619 INFO L225 Difference]: With dead ends: 72 [2019-11-19 22:47:39,619 INFO L226 Difference]: Without dead ends: 72 [2019-11-19 22:47:39,619 INFO L630 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-19 22:47:39,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-19 22:47:39,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2019-11-19 22:47:39,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-19 22:47:39,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2019-11-19 22:47:39,637 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 20 [2019-11-19 22:47:39,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:47:39,638 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2019-11-19 22:47:39,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 22:47:39,638 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2019-11-19 22:47:39,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-19 22:47:39,640 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:47:39,640 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:47:39,851 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:47:39,852 INFO L410 AbstractCegarLoop]: === Iteration 6 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-19 22:47:39,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:47:39,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1281599893, now seen corresponding path program 1 times [2019-11-19 22:47:39,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:47:39,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1365515795] [2019-11-19 22:47:39,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_214b198b-a2ba-4373-83fe-7d958d9c2fd6/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:47:39,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:47:39,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 22:47:39,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:47:40,006 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-19 22:47:40,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:47:40,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:47:40,020 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-19 22:47:40,021 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:47:40,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:47:40,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:47:40,030 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2019-11-19 22:47:42,115 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-19 22:47:42,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:47:42,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:47:42,125 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-19 22:47:42,126 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:47:42,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:47:42,131 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-19 22:47:42,131 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2019-11-19 22:47:42,249 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:47:42,250 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-19 22:47:42,251 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:47:42,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:47:42,289 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2019-11-19 22:47:42,290 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:47:42,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:47:42,319 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-19 22:47:42,319 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:25 [2019-11-19 22:47:46,386 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-19 22:47:46,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:47:46,390 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:47:47,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:47:49,248 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-11-19 22:47:49,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:47:49,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:47:49,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:47:49,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:47:49,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:47:49,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:47:49,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:48:12,869 WARN L191 SmtUtils]: Spent 15.59 s on a formula simplification. DAG size of input: 61 DAG size of output: 36 [2019-11-19 22:48:12,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:48:19,272 WARN L191 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-11-19 22:48:21,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:48:21,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1365515795] [2019-11-19 22:48:21,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:48:21,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 10 [2019-11-19 22:48:21,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504526289] [2019-11-19 22:48:21,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 22:48:21,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:48:21,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 22:48:21,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=76, Unknown=7, NotChecked=0, Total=110 [2019-11-19 22:48:21,458 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 11 states. [2019-11-19 22:48:30,220 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-19 22:48:34,715 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-19 22:48:43,209 WARN L191 SmtUtils]: Spent 3.61 s on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2019-11-19 22:49:06,646 WARN L191 SmtUtils]: Spent 9.76 s on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-11-19 22:49:09,289 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-11-19 22:49:09,354 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-19 22:49:10,324 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2019-11-19 22:49:28,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:49:28,196 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2019-11-19 22:49:28,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-19 22:49:28,197 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-11-19 22:49:28,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:49:28,200 INFO L225 Difference]: With dead ends: 113 [2019-11-19 22:49:28,200 INFO L226 Difference]: Without dead ends: 113 [2019-11-19 22:49:28,201 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 69.8s TimeCoverageRelationStatistics Valid=74, Invalid=196, Unknown=14, NotChecked=96, Total=380 [2019-11-19 22:49:28,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-19 22:49:28,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 90. [2019-11-19 22:49:28,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-19 22:49:28,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 105 transitions. [2019-11-19 22:49:28,221 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 105 transitions. Word has length 20 [2019-11-19 22:49:28,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:49:28,221 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 105 transitions. [2019-11-19 22:49:28,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 22:49:28,222 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 105 transitions. [2019-11-19 22:49:28,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-19 22:49:28,223 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:49:28,223 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:49:28,425 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:49:28,425 INFO L410 AbstractCegarLoop]: === Iteration 7 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-19 22:49:28,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:49:28,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1281599892, now seen corresponding path program 1 times [2019-11-19 22:49:28,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:49:28,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1796490436] [2019-11-19 22:49:28,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_214b198b-a2ba-4373-83fe-7d958d9c2fd6/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:49:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:49:28,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 22:49:28,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:49:28,502 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-19 22:49:28,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:49:28,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:49:28,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:49:28,505 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-19 22:49:28,536 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-19 22:49:28,536 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:49:28,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:49:28,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:49:28,543 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-11-19 22:49:30,639 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:49:30,639 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-19 22:49:30,640 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:49:30,657 INFO L567 ElimStorePlain]: treesize reduction 18, result has 37.9 percent of original size [2019-11-19 22:49:30,658 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:49:30,658 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-11-19 22:49:30,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:49:30,678 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:49:30,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:49:30,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1796490436] [2019-11-19 22:49:30,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:49:30,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 4] imperfect sequences [] total 9 [2019-11-19 22:49:30,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810032359] [2019-11-19 22:49:30,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 22:49:30,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:49:30,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 22:49:30,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=62, Unknown=1, NotChecked=0, Total=90 [2019-11-19 22:49:30,834 INFO L87 Difference]: Start difference. First operand 90 states and 105 transitions. Second operand 10 states. [2019-11-19 22:50:01,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:50:01,409 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2019-11-19 22:50:01,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:50:01,410 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-19 22:50:01,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:50:01,411 INFO L225 Difference]: With dead ends: 87 [2019-11-19 22:50:01,411 INFO L226 Difference]: Without dead ends: 87 [2019-11-19 22:50:01,412 INFO L630 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-19 22:50:01,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-19 22:50:01,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-11-19 22:50:01,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-19 22:50:01,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 100 transitions. [2019-11-19 22:50:01,421 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 100 transitions. Word has length 20 [2019-11-19 22:50:01,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:50:01,422 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 100 transitions. [2019-11-19 22:50:01,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 22:50:01,422 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 100 transitions. [2019-11-19 22:50:01,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-19 22:50:01,423 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:50:01,423 INFO L410 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-19 22:50:01,624 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:50:01,624 INFO L410 AbstractCegarLoop]: === Iteration 8 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-19 22:50:01,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:50:01,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1083248999, now seen corresponding path program 1 times [2019-11-19 22:50:01,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:50:01,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [630054695] [2019-11-19 22:50:01,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_214b198b-a2ba-4373-83fe-7d958d9c2fd6/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:50:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:50:01,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 22:50:01,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:50:01,842 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:50:01,842 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2019-11-19 22:50:01,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:50:01,877 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-19 22:50:01,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:50:01,878 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-19 22:50:01,903 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-19 22:50:01,903 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:50:01,962 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-19 22:50:01,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [630054695] [2019-11-19 22:50:01,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:50:01,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-19 22:50:01,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304802334] [2019-11-19 22:50:01,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 22:50:01,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:50:01,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:50:01,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:50:01,964 INFO L87 Difference]: Start difference. First operand 87 states and 100 transitions. Second operand 5 states. [2019-11-19 22:50:02,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:50:02,140 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2019-11-19 22:50:02,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:50:02,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-19 22:50:02,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:50:02,142 INFO L225 Difference]: With dead ends: 86 [2019-11-19 22:50:02,142 INFO L226 Difference]: Without dead ends: 86 [2019-11-19 22:50:02,142 INFO L630 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-19 22:50:02,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-19 22:50:02,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-11-19 22:50:02,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-19 22:50:02,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2019-11-19 22:50:02,151 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 27 [2019-11-19 22:50:02,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:50:02,151 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2019-11-19 22:50:02,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 22:50:02,152 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2019-11-19 22:50:02,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-19 22:50:02,152 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:50:02,153 INFO L410 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-19 22:50:02,355 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:50:02,357 INFO L410 AbstractCegarLoop]: === Iteration 9 === [barErr1REQUIRES_VIOLATION, barErr0REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-19 22:50:02,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:50:02,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1083248998, now seen corresponding path program 1 times [2019-11-19 22:50:02,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:50:02,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1629309895] [2019-11-19 22:50:02,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_214b198b-a2ba-4373-83fe-7d958d9c2fd6/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:50:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:50:02,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-19 22:50:02,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:50:02,541 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-19 22:50:02,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:50:02,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:50:02,550 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:50:02,550 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-19 22:50:02,615 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-19 22:50:02,615 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:50:02,621 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:50:02,622 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-19 22:50:02,622 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2019-11-19 22:50:02,709 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-19 22:50:02,709 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:50:02,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:50:02,718 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-19 22:50:02,718 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:14 [2019-11-19 22:50:04,810 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:50:04,810 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 32 [2019-11-19 22:50:04,811 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:50:04,883 INFO L567 ElimStorePlain]: treesize reduction 12, result has 67.6 percent of original size [2019-11-19 22:50:04,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:50:04,885 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-19 22:50:04,886 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:25 [2019-11-19 22:50:04,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:50:04,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:50:05,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:50:05,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:50:05,226 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:50:05,226 INFO L377 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-19 22:50:05,227 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:50:05,322 INFO L567 ElimStorePlain]: treesize reduction 12, result has 80.3 percent of original size [2019-11-19 22:50:05,364 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:50:05,365 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 36 [2019-11-19 22:50:05,366 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:50:05,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:50:05,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:50:05,402 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-19 22:50:05,403 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:44, output treesize:40 [2019-11-19 22:50:05,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:50:06,569 WARN L191 SmtUtils]: Spent 1.11 s on a formula simplification that was a NOOP. DAG size: 31 [2019-11-19 22:50:06,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:50:06,647 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-19 22:50:06,647 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:50:08,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:50:14,153 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:50:14,154 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2019-11-19 22:50:14,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:50:14,156 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:50:14,309 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-11-19 22:50:14,312 INFO L567 ElimStorePlain]: treesize reduction 5, result has 93.4 percent of original size [2019-11-19 22:50:14,336 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:50:14,337 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2019-11-19 22:50:14,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:50:14,338 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:50:14,561 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-11-19 22:50:14,561 INFO L567 ElimStorePlain]: treesize reduction 9, result has 86.8 percent of original size [2019-11-19 22:50:14,580 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:50:14,580 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2019-11-19 22:50:14,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:50:14,581 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:50:14,708 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-11-19 22:50:14,709 INFO L567 ElimStorePlain]: treesize reduction 5, result has 90.4 percent of original size [2019-11-19 22:50:14,710 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-19 22:50:14,710 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 11 variables, input treesize:83, output treesize:33 [2019-11-19 22:50:15,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:50:15,888 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-19 22:50:16,116 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:50:16,117 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-19 22:50:16,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:50:16,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:50:16,279 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-11-19 22:50:16,280 INFO L567 ElimStorePlain]: treesize reduction 9, result has 86.4 percent of original size [2019-11-19 22:50:16,481 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:50:16,482 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.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-19 22:50:16,487 INFO L168 Benchmark]: Toolchain (without parser) took 160487.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.2 MB). Free memory was 951.4 MB in the beginning and 881.8 MB in the end (delta: 69.6 MB). Peak memory consumption was 245.8 MB. Max. memory is 11.5 GB. [2019-11-19 22:50:16,487 INFO L168 Benchmark]: CDTParser took 0.69 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-19 22:50:16,487 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -143.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-19 22:50:16,487 INFO L168 Benchmark]: Boogie Preprocessor took 40.72 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:50:16,488 INFO L168 Benchmark]: RCFGBuilder took 593.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2019-11-19 22:50:16,488 INFO L168 Benchmark]: TraceAbstraction took 159516.62 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 881.8 MB in the end (delta: 182.7 MB). Peak memory consumption was 255.1 MB. Max. memory is 11.5 GB. [2019-11-19 22:50:16,490 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.69 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 330.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -143.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.72 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 593.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 159516.62 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 881.8 MB in the end (delta: 182.7 MB). Peak memory consumption was 255.1 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...