./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 678e0110 Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8ac3dc76-8fb7-47f5-b878-5735f4c51dfd/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8ac3dc76-8fb7-47f5-b878-5735f4c51dfd/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8ac3dc76-8fb7-47f5-b878-5735f4c51dfd/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8ac3dc76-8fb7-47f5-b878-5735f4c51dfd/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_insert_equal.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8ac3dc76-8fb7-47f5-b878-5735f4c51dfd/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8ac3dc76-8fb7-47f5-b878-5735f4c51dfd/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 991566e3237a3bd107d157451ed3644c7d9c68a0 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported: (forall ((v_dll_insert_~head.base_BEFORE_CALL_6 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_dll_insert_~head.offset_BEFORE_CALL_4 (_ BitVec 32))) (exists ((v_node_create_~temp~0.offset_26 (_ BitVec 32)) (|v_node_create_#t~malloc2.base_17| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (or (and (= (select |old(#valid)| |v_node_create_#t~malloc2.base_17|) (_ bv0 1)) (bvslt |v_node_create_#t~malloc2.base_17| |#StackHeapBarrier|) (not (= (_ bv1 1) (select (store |old(#valid)| |v_node_create_#t~malloc2.base_17| (_ bv1 1)) (select (select (store |old(#memory_$Pointer$.base)| |v_node_create_#t~malloc2.base_17| (store (store (store (select |old(#memory_$Pointer$.base)| |v_node_create_#t~malloc2.base_17|) (bvadd v_node_create_~temp~0.offset_26 (_ bv4 32)) (_ bv0 32)) (bvadd v_node_create_~temp~0.offset_26 (_ bv8 32)) (_ bv0 32)) v_node_create_~temp~0.offset_26 v_DerPreprocessor_1)) v_dll_insert_~head.base_BEFORE_CALL_6) v_dll_insert_~head.offset_BEFORE_CALL_4))))) (= (bvadd (select |#valid| (select (select (store |#memory_$Pointer$.base| node_create_~temp~0.base (store (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset v_DerPreprocessor_2)) v_dll_insert_~head.base_BEFORE_CALL_6) v_dll_insert_~head.offset_BEFORE_CALL_4)) (_ bv1 1)) (_ bv0 1))))) --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 02:31:07,718 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 02:31:07,720 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 02:31:07,730 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 02:31:07,730 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 02:31:07,731 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 02:31:07,733 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 02:31:07,735 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 02:31:07,737 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 02:31:07,737 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 02:31:07,738 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 02:31:07,739 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 02:31:07,740 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 02:31:07,741 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 02:31:07,742 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 02:31:07,743 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 02:31:07,743 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 02:31:07,744 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 02:31:07,746 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 02:31:07,755 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 02:31:07,756 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 02:31:07,757 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 02:31:07,758 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 02:31:07,759 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 02:31:07,765 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 02:31:07,765 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 02:31:07,765 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 02:31:07,766 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 02:31:07,766 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 02:31:07,767 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 02:31:07,767 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 02:31:07,768 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 02:31:07,768 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 02:31:07,769 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 02:31:07,770 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 02:31:07,770 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 02:31:07,771 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 02:31:07,771 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 02:31:07,771 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 02:31:07,772 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 02:31:07,772 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 02:31:07,773 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8ac3dc76-8fb7-47f5-b878-5735f4c51dfd/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-20 02:31:07,793 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 02:31:07,793 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 02:31:07,794 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 02:31:07,794 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 02:31:07,795 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 02:31:07,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 02:31:07,795 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 02:31:07,795 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 02:31:07,795 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 02:31:07,796 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 02:31:07,796 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 02:31:07,797 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-20 02:31:07,797 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-20 02:31:07,797 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-20 02:31:07,797 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 02:31:07,797 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 02:31:07,797 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 02:31:07,798 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 02:31:07,798 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 02:31:07,798 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 02:31:07,798 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 02:31:07,798 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 02:31:07,799 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 02:31:07,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 02:31:07,799 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 02:31:07,799 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 02:31:07,800 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 02:31:07,800 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 02:31:07,800 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 02:31:07,800 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_8ac3dc76-8fb7-47f5-b878-5735f4c51dfd/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 -> 991566e3237a3bd107d157451ed3644c7d9c68a0 [2019-11-20 02:31:07,953 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 02:31:07,963 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 02:31:07,966 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 02:31:07,967 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 02:31:07,968 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 02:31:07,968 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8ac3dc76-8fb7-47f5-b878-5735f4c51dfd/bin/uautomizer/../../sv-benchmarks/c/list-simple/dll2n_insert_equal.i [2019-11-20 02:31:08,016 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8ac3dc76-8fb7-47f5-b878-5735f4c51dfd/bin/uautomizer/data/49dda4219/dded0b2de34443c1840e3dd1f109e3b4/FLAG6a3e16898 [2019-11-20 02:31:08,523 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 02:31:08,524 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8ac3dc76-8fb7-47f5-b878-5735f4c51dfd/sv-benchmarks/c/list-simple/dll2n_insert_equal.i [2019-11-20 02:31:08,541 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8ac3dc76-8fb7-47f5-b878-5735f4c51dfd/bin/uautomizer/data/49dda4219/dded0b2de34443c1840e3dd1f109e3b4/FLAG6a3e16898 [2019-11-20 02:31:08,849 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8ac3dc76-8fb7-47f5-b878-5735f4c51dfd/bin/uautomizer/data/49dda4219/dded0b2de34443c1840e3dd1f109e3b4 [2019-11-20 02:31:08,851 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 02:31:08,852 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-20 02:31:08,853 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 02:31:08,853 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 02:31:08,856 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 02:31:08,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:31:08" (1/1) ... [2019-11-20 02:31:08,860 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e95deeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:31:08, skipping insertion in model container [2019-11-20 02:31:08,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:31:08" (1/1) ... [2019-11-20 02:31:08,866 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 02:31:08,905 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 02:31:09,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:31:09,274 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 02:31:09,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:31:09,378 INFO L192 MainTranslator]: Completed translation [2019-11-20 02:31:09,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:31:09 WrapperNode [2019-11-20 02:31:09,378 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 02:31:09,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 02:31:09,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 02:31:09,379 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 02:31:09,392 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:31:09" (1/1) ... [2019-11-20 02:31:09,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:31:09" (1/1) ... [2019-11-20 02:31:09,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:31:09" (1/1) ... [2019-11-20 02:31:09,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:31:09" (1/1) ... [2019-11-20 02:31:09,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:31:09" (1/1) ... [2019-11-20 02:31:09,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:31:09" (1/1) ... [2019-11-20 02:31:09,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:31:09" (1/1) ... [2019-11-20 02:31:09,448 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 02:31:09,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 02:31:09,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 02:31:09,449 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 02:31:09,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:31:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8ac3dc76-8fb7-47f5-b878-5735f4c51dfd/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 02:31:09,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-20 02:31:09,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 02:31:09,510 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-20 02:31:09,511 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-20 02:31:09,511 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-20 02:31:09,511 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-20 02:31:09,511 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2019-11-20 02:31:09,511 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2019-11-20 02:31:09,511 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert [2019-11-20 02:31:09,512 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-20 02:31:09,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-20 02:31:09,512 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-20 02:31:09,512 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-20 02:31:09,512 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-20 02:31:09,512 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-20 02:31:09,512 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-20 02:31:09,513 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-20 02:31:09,513 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-20 02:31:09,513 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-20 02:31:09,513 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-20 02:31:09,513 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-20 02:31:09,513 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-20 02:31:09,514 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-20 02:31:09,514 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-20 02:31:09,514 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-20 02:31:09,514 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-20 02:31:09,514 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-20 02:31:09,514 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-20 02:31:09,514 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-20 02:31:09,515 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-20 02:31:09,515 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-20 02:31:09,515 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-20 02:31:09,516 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-20 02:31:09,516 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-20 02:31:09,516 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-20 02:31:09,516 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-20 02:31:09,517 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-20 02:31:09,517 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-20 02:31:09,517 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-20 02:31:09,517 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-20 02:31:09,517 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-20 02:31:09,518 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-20 02:31:09,518 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-20 02:31:09,518 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-20 02:31:09,518 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-20 02:31:09,518 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-20 02:31:09,518 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-20 02:31:09,518 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-20 02:31:09,518 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-20 02:31:09,519 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-20 02:31:09,519 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-20 02:31:09,519 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-20 02:31:09,519 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-20 02:31:09,519 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-20 02:31:09,519 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-20 02:31:09,519 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-20 02:31:09,520 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-20 02:31:09,520 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-20 02:31:09,520 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-20 02:31:09,520 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-20 02:31:09,520 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-20 02:31:09,521 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-20 02:31:09,521 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-20 02:31:09,521 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-20 02:31:09,521 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-20 02:31:09,521 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-20 02:31:09,521 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-20 02:31:09,522 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-20 02:31:09,522 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-20 02:31:09,522 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-20 02:31:09,522 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-20 02:31:09,523 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-20 02:31:09,523 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-20 02:31:09,524 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-20 02:31:09,524 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-20 02:31:09,525 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-20 02:31:09,525 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-20 02:31:09,525 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-20 02:31:09,525 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-20 02:31:09,525 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-20 02:31:09,526 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-20 02:31:09,526 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-20 02:31:09,526 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-20 02:31:09,526 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-20 02:31:09,526 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-20 02:31:09,526 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-20 02:31:09,526 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-20 02:31:09,527 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-20 02:31:09,527 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-20 02:31:09,527 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-20 02:31:09,528 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-20 02:31:09,528 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-20 02:31:09,528 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-20 02:31:09,528 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-20 02:31:09,528 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-20 02:31:09,528 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-20 02:31:09,528 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-20 02:31:09,528 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-20 02:31:09,529 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-20 02:31:09,529 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-20 02:31:09,529 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-20 02:31:09,529 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-20 02:31:09,529 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-20 02:31:09,529 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-20 02:31:09,529 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-20 02:31:09,529 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-20 02:31:09,530 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-20 02:31:09,530 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-20 02:31:09,530 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-20 02:31:09,530 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-20 02:31:09,530 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-20 02:31:09,530 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-20 02:31:09,530 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-20 02:31:09,531 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-20 02:31:09,531 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-20 02:31:09,531 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-20 02:31:09,531 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-20 02:31:09,532 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-20 02:31:09,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 02:31:09,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 02:31:09,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 02:31:09,533 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2019-11-20 02:31:09,533 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2019-11-20 02:31:09,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 02:31:09,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 02:31:09,535 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert [2019-11-20 02:31:09,535 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-20 02:31:09,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 02:31:09,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-20 02:31:09,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 02:31:09,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-20 02:31:09,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 02:31:09,915 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-20 02:31:10,466 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 02:31:10,466 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-20 02:31:10,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:31:10 BoogieIcfgContainer [2019-11-20 02:31:10,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 02:31:10,469 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 02:31:10,469 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 02:31:10,472 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 02:31:10,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:31:08" (1/3) ... [2019-11-20 02:31:10,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d17242a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:31:10, skipping insertion in model container [2019-11-20 02:31:10,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:31:09" (2/3) ... [2019-11-20 02:31:10,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d17242a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:31:10, skipping insertion in model container [2019-11-20 02:31:10,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:31:10" (3/3) ... [2019-11-20 02:31:10,478 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2n_insert_equal.i [2019-11-20 02:31:10,489 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 02:31:10,505 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 52 error locations. [2019-11-20 02:31:10,515 INFO L249 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2019-11-20 02:31:10,541 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 02:31:10,541 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-20 02:31:10,541 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 02:31:10,541 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 02:31:10,541 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 02:31:10,541 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 02:31:10,541 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 02:31:10,541 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 02:31:10,570 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states. [2019-11-20 02:31:10,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 02:31:10,578 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:31:10,579 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:31:10,580 INFO L410 AbstractCegarLoop]: === Iteration 1 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 02:31:10,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:31:10,585 INFO L82 PathProgramCache]: Analyzing trace with hash -456220142, now seen corresponding path program 1 times [2019-11-20 02:31:10,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:31:10,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [443465656] [2019-11-20 02:31:10,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8ac3dc76-8fb7-47f5-b878-5735f4c51dfd/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:31:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:31:10,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 02:31:10,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:31:10,912 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-20 02:31:10,912 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:31:10,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:31:10,923 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:31:10,924 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 02:31:10,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:31:10,938 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:31:10,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:31:10,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [443465656] [2019-11-20 02:31:10,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:31:10,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 02:31:10,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094714621] [2019-11-20 02:31:11,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:31:11,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:31:11,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:31:11,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:31:11,018 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 4 states. [2019-11-20 02:31:11,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:31:11,628 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2019-11-20 02:31:11,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:31:11,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-20 02:31:11,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:31:11,641 INFO L225 Difference]: With dead ends: 136 [2019-11-20 02:31:11,641 INFO L226 Difference]: Without dead ends: 128 [2019-11-20 02:31:11,643 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:31:11,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-20 02:31:11,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2019-11-20 02:31:11,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-20 02:31:11,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 131 transitions. [2019-11-20 02:31:11,686 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 131 transitions. Word has length 11 [2019-11-20 02:31:11,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:31:11,686 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 131 transitions. [2019-11-20 02:31:11,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:31:11,687 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 131 transitions. [2019-11-20 02:31:11,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 02:31:11,688 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:31:11,688 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:31:11,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:31:11,891 INFO L410 AbstractCegarLoop]: === Iteration 2 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 02:31:11,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:31:11,891 INFO L82 PathProgramCache]: Analyzing trace with hash -456220143, now seen corresponding path program 1 times [2019-11-20 02:31:11,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:31:11,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [349483860] [2019-11-20 02:31:11,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8ac3dc76-8fb7-47f5-b878-5735f4c51dfd/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:31:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:31:12,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 02:31:12,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:31:12,091 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-20 02:31:12,091 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:31:12,096 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:31:12,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:31:12,097 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 02:31:12,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:31:12,102 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:31:12,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:31:12,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [349483860] [2019-11-20 02:31:12,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:31:12,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 02:31:12,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636785180] [2019-11-20 02:31:12,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:31:12,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:31:12,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:31:12,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:31:12,115 INFO L87 Difference]: Start difference. First operand 124 states and 131 transitions. Second operand 3 states. [2019-11-20 02:31:12,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:31:12,370 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2019-11-20 02:31:12,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:31:12,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-20 02:31:12,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:31:12,373 INFO L225 Difference]: With dead ends: 125 [2019-11-20 02:31:12,373 INFO L226 Difference]: Without dead ends: 125 [2019-11-20 02:31:12,374 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:31:12,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-20 02:31:12,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2019-11-20 02:31:12,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-20 02:31:12,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2019-11-20 02:31:12,386 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 11 [2019-11-20 02:31:12,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:31:12,386 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2019-11-20 02:31:12,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:31:12,387 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2019-11-20 02:31:12,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 02:31:12,387 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:31:12,388 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:31:12,604 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:31:12,604 INFO L410 AbstractCegarLoop]: === Iteration 3 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 02:31:12,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:31:12,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1175859563, now seen corresponding path program 1 times [2019-11-20 02:31:12,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:31:12,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1914782652] [2019-11-20 02:31:12,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8ac3dc76-8fb7-47f5-b878-5735f4c51dfd/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:31:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:31:12,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 02:31:12,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:31:12,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:31:12,812 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:31:12,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:31:12,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1914782652] [2019-11-20 02:31:12,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:31:12,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 02:31:12,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078514265] [2019-11-20 02:31:12,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:31:12,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:31:12,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:31:12,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:31:12,820 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand 3 states. [2019-11-20 02:31:12,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:31:12,869 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2019-11-20 02:31:12,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:31:12,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-20 02:31:12,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:31:12,873 INFO L225 Difference]: With dead ends: 131 [2019-11-20 02:31:12,873 INFO L226 Difference]: Without dead ends: 131 [2019-11-20 02:31:12,873 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:31:12,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-20 02:31:12,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2019-11-20 02:31:12,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-20 02:31:12,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 135 transitions. [2019-11-20 02:31:12,884 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 135 transitions. Word has length 15 [2019-11-20 02:31:12,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:31:12,884 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 135 transitions. [2019-11-20 02:31:12,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:31:12,885 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2019-11-20 02:31:12,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 02:31:12,886 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:31:12,886 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:31:13,088 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:31:13,088 INFO L410 AbstractCegarLoop]: === Iteration 4 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 02:31:13,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:31:13,089 INFO L82 PathProgramCache]: Analyzing trace with hash -545594592, now seen corresponding path program 1 times [2019-11-20 02:31:13,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:31:13,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [387972408] [2019-11-20 02:31:13,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8ac3dc76-8fb7-47f5-b878-5735f4c51dfd/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:31:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:31:13,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 02:31:13,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:31:13,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:31:13,356 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:31:13,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:31:13,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [387972408] [2019-11-20 02:31:13,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:31:13,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-11-20 02:31:13,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63898828] [2019-11-20 02:31:13,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 02:31:13,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:31:13,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 02:31:13,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 02:31:13,431 INFO L87 Difference]: Start difference. First operand 127 states and 135 transitions. Second operand 7 states. [2019-11-20 02:31:13,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:31:13,510 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2019-11-20 02:31:13,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 02:31:13,511 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-20 02:31:13,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:31:13,512 INFO L225 Difference]: With dead ends: 131 [2019-11-20 02:31:13,513 INFO L226 Difference]: Without dead ends: 128 [2019-11-20 02:31:13,513 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-20 02:31:13,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-20 02:31:13,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-11-20 02:31:13,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-20 02:31:13,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 134 transitions. [2019-11-20 02:31:13,521 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 134 transitions. Word has length 19 [2019-11-20 02:31:13,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:31:13,521 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 134 transitions. [2019-11-20 02:31:13,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 02:31:13,522 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 134 transitions. [2019-11-20 02:31:13,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 02:31:13,522 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:31:13,522 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:31:13,733 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:31:13,734 INFO L410 AbstractCegarLoop]: === Iteration 5 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 02:31:13,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:31:13,734 INFO L82 PathProgramCache]: Analyzing trace with hash 2049635944, now seen corresponding path program 1 times [2019-11-20 02:31:13,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:31:13,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1789247284] [2019-11-20 02:31:13,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8ac3dc76-8fb7-47f5-b878-5735f4c51dfd/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:31:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:31:13,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 02:31:13,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:31:14,001 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-20 02:31:14,001 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:31:14,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:31:14,003 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:31:14,003 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 02:31:14,034 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:31:14,035 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-20 02:31:14,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:31:14,050 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-20 02:31:14,051 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:31:14,051 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-11-20 02:31:14,069 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:31:14,069 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:31:14,086 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:31:14,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1789247284] [2019-11-20 02:31:14,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 02:31:14,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-11-20 02:31:14,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676068271] [2019-11-20 02:31:14,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:31:14,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:31:14,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:31:14,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:31:14,088 INFO L87 Difference]: Start difference. First operand 127 states and 134 transitions. Second operand 4 states. [2019-11-20 02:31:14,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:31:14,457 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions. [2019-11-20 02:31:14,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:31:14,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-11-20 02:31:14,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:31:14,459 INFO L225 Difference]: With dead ends: 127 [2019-11-20 02:31:14,459 INFO L226 Difference]: Without dead ends: 127 [2019-11-20 02:31:14,459 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:31:14,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-20 02:31:14,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-11-20 02:31:14,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-20 02:31:14,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 133 transitions. [2019-11-20 02:31:14,466 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 133 transitions. Word has length 22 [2019-11-20 02:31:14,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:31:14,467 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 133 transitions. [2019-11-20 02:31:14,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:31:14,467 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 133 transitions. [2019-11-20 02:31:14,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 02:31:14,468 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:31:14,468 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:31:14,678 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:31:14,678 INFO L410 AbstractCegarLoop]: === Iteration 6 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 02:31:14,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:31:14,678 INFO L82 PathProgramCache]: Analyzing trace with hash 2049635945, now seen corresponding path program 1 times [2019-11-20 02:31:14,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:31:14,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1827743390] [2019-11-20 02:31:14,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8ac3dc76-8fb7-47f5-b878-5735f4c51dfd/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:31:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:31:14,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 02:31:14,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:31:14,944 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-20 02:31:14,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:31:14,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:31:14,962 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-20 02:31:14,963 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:31:14,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:31:14,971 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:31:14,971 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 02:31:15,017 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:31:15,017 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-20 02:31:15,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:31:15,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:31:15,040 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-20 02:31:15,041 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:31:15,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:31:15,053 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:31:15,053 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2019-11-20 02:31:15,090 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:31:15,090 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:31:15,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:31:15,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:31:15,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1827743390] [2019-11-20 02:31:15,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 02:31:15,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-11-20 02:31:15,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074028041] [2019-11-20 02:31:15,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 02:31:15,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:31:15,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 02:31:15,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 02:31:15,451 INFO L87 Difference]: Start difference. First operand 126 states and 133 transitions. Second operand 8 states. [2019-11-20 02:31:16,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:31:16,906 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2019-11-20 02:31:16,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 02:31:16,907 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-11-20 02:31:16,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:31:16,908 INFO L225 Difference]: With dead ends: 130 [2019-11-20 02:31:16,908 INFO L226 Difference]: Without dead ends: 130 [2019-11-20 02:31:16,908 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-20 02:31:16,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-20 02:31:16,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 125. [2019-11-20 02:31:16,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-20 02:31:16,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2019-11-20 02:31:16,915 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 22 [2019-11-20 02:31:16,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:31:16,915 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2019-11-20 02:31:16,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 02:31:16,915 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2019-11-20 02:31:16,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 02:31:16,916 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:31:16,916 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:31:17,117 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:31:17,117 INFO L410 AbstractCegarLoop]: === Iteration 7 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 02:31:17,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:31:17,117 INFO L82 PathProgramCache]: Analyzing trace with hash -932320909, now seen corresponding path program 1 times [2019-11-20 02:31:17,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:31:17,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [106290723] [2019-11-20 02:31:17,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8ac3dc76-8fb7-47f5-b878-5735f4c51dfd/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:31:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:31:17,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 02:31:17,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:31:17,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:31:17,361 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:31:17,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:31:17,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [106290723] [2019-11-20 02:31:17,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 02:31:17,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-11-20 02:31:17,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626058763] [2019-11-20 02:31:17,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 02:31:17,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:31:17,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 02:31:17,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-20 02:31:17,494 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand 9 states. [2019-11-20 02:31:17,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:31:17,620 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2019-11-20 02:31:17,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 02:31:17,620 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-11-20 02:31:17,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:31:17,621 INFO L225 Difference]: With dead ends: 137 [2019-11-20 02:31:17,621 INFO L226 Difference]: Without dead ends: 134 [2019-11-20 02:31:17,622 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-20 02:31:17,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-20 02:31:17,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 127. [2019-11-20 02:31:17,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-20 02:31:17,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 134 transitions. [2019-11-20 02:31:17,628 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 134 transitions. Word has length 26 [2019-11-20 02:31:17,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:31:17,628 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 134 transitions. [2019-11-20 02:31:17,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 02:31:17,628 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 134 transitions. [2019-11-20 02:31:17,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-20 02:31:17,629 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:31:17,629 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:31:17,832 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:31:17,832 INFO L410 AbstractCegarLoop]: === Iteration 8 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 02:31:17,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:31:17,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1831448512, now seen corresponding path program 2 times [2019-11-20 02:31:17,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:31:17,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [707713553] [2019-11-20 02:31:17,833 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8ac3dc76-8fb7-47f5-b878-5735f4c51dfd/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:31:17,994 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-20 02:31:17,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 02:31:17,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 02:31:17,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:31:18,005 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-20 02:31:18,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:31:18,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:31:18,007 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:31:18,007 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 02:31:18,011 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-20 02:31:18,011 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:31:18,021 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-20 02:31:18,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [707713553] [2019-11-20 02:31:18,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:31:18,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 02:31:18,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496521916] [2019-11-20 02:31:18,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:31:18,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:31:18,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:31:18,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:31:18,023 INFO L87 Difference]: Start difference. First operand 127 states and 134 transitions. Second operand 3 states. [2019-11-20 02:31:18,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:31:18,185 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2019-11-20 02:31:18,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:31:18,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-20 02:31:18,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:31:18,186 INFO L225 Difference]: With dead ends: 124 [2019-11-20 02:31:18,186 INFO L226 Difference]: Without dead ends: 124 [2019-11-20 02:31:18,187 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:31:18,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-20 02:31:18,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2019-11-20 02:31:18,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-20 02:31:18,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 131 transitions. [2019-11-20 02:31:18,191 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 131 transitions. Word has length 33 [2019-11-20 02:31:18,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:31:18,191 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 131 transitions. [2019-11-20 02:31:18,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:31:18,191 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 131 transitions. [2019-11-20 02:31:18,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-20 02:31:18,192 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:31:18,192 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:31:18,395 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:31:18,395 INFO L410 AbstractCegarLoop]: === Iteration 9 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 02:31:18,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:31:18,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1831448513, now seen corresponding path program 1 times [2019-11-20 02:31:18,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:31:18,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [698979738] [2019-11-20 02:31:18,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8ac3dc76-8fb7-47f5-b878-5735f4c51dfd/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:31:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:31:18,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 02:31:18,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:31:18,575 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:31:18,575 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:31:18,592 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:31:18,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [698979738] [2019-11-20 02:31:18,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 02:31:18,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-20 02:31:18,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151480978] [2019-11-20 02:31:18,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:31:18,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:31:18,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:31:18,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:31:18,593 INFO L87 Difference]: Start difference. First operand 124 states and 131 transitions. Second operand 4 states. [2019-11-20 02:31:18,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:31:18,703 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2019-11-20 02:31:18,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:31:18,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-20 02:31:18,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:31:18,705 INFO L225 Difference]: With dead ends: 124 [2019-11-20 02:31:18,705 INFO L226 Difference]: Without dead ends: 124 [2019-11-20 02:31:18,705 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:31:18,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-20 02:31:18,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2019-11-20 02:31:18,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-20 02:31:18,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2019-11-20 02:31:18,710 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 33 [2019-11-20 02:31:18,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:31:18,710 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2019-11-20 02:31:18,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:31:18,710 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2019-11-20 02:31:18,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 02:31:18,711 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:31:18,711 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:31:18,911 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:31:18,912 INFO L410 AbstractCegarLoop]: === Iteration 10 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 02:31:18,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:31:18,912 INFO L82 PathProgramCache]: Analyzing trace with hash 200264928, now seen corresponding path program 1 times [2019-11-20 02:31:18,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:31:18,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [891493337] [2019-11-20 02:31:18,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8ac3dc76-8fb7-47f5-b878-5735f4c51dfd/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:31:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:31:19,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 02:31:19,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:31:19,190 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-20 02:31:19,190 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:31:19,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:31:19,197 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:31:19,197 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 02:31:19,206 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-20 02:31:19,206 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:31:19,249 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-20 02:31:19,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [891493337] [2019-11-20 02:31:19,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:31:19,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 02:31:19,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667431254] [2019-11-20 02:31:19,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:31:19,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:31:19,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:31:19,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:31:19,251 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand 4 states. [2019-11-20 02:31:19,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:31:19,555 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2019-11-20 02:31:19,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:31:19,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-11-20 02:31:19,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:31:19,557 INFO L225 Difference]: With dead ends: 121 [2019-11-20 02:31:19,557 INFO L226 Difference]: Without dead ends: 121 [2019-11-20 02:31:19,557 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 65 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-20 02:31:19,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-20 02:31:19,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-11-20 02:31:19,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-20 02:31:19,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 127 transitions. [2019-11-20 02:31:19,561 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 127 transitions. Word has length 34 [2019-11-20 02:31:19,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:31:19,561 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 127 transitions. [2019-11-20 02:31:19,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:31:19,561 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 127 transitions. [2019-11-20 02:31:19,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-20 02:31:19,562 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:31:19,562 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:31:19,765 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:31:19,766 INFO L410 AbstractCegarLoop]: === Iteration 11 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 02:31:19,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:31:19,766 INFO L82 PathProgramCache]: Analyzing trace with hash -930251750, now seen corresponding path program 1 times [2019-11-20 02:31:19,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:31:19,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [90509844] [2019-11-20 02:31:19,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8ac3dc76-8fb7-47f5-b878-5735f4c51dfd/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:31:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:31:20,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-20 02:31:20,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:31:20,117 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-20 02:31:20,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:31:20,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:31:20,120 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:31:20,120 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 02:31:20,323 INFO L343 Elim1Store]: treesize reduction 27, result has 57.1 percent of original size [2019-11-20 02:31:20,323 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 4 case distinctions, treesize of input 20 treesize of output 47 [2019-11-20 02:31:20,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:31:20,367 INFO L567 ElimStorePlain]: treesize reduction 17, result has 54.1 percent of original size [2019-11-20 02:31:20,368 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-20 02:31:20,368 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:20 [2019-11-20 02:31:20,527 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:31:20,527 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 52 [2019-11-20 02:31:20,528 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:31:20,562 INFO L567 ElimStorePlain]: treesize reduction 28, result has 41.7 percent of original size [2019-11-20 02:31:20,562 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-20 02:31:20,563 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:20 [2019-11-20 02:31:20,587 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:31:20,587 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:31:48,626 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 02:31:48,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [90509844] [2019-11-20 02:31:48,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 02:31:48,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2019-11-20 02:31:48,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437281039] [2019-11-20 02:31:48,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 02:31:48,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:31:48,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 02:31:48,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=216, Unknown=6, NotChecked=0, Total=272 [2019-11-20 02:31:48,628 INFO L87 Difference]: Start difference. First operand 121 states and 127 transitions. Second operand 10 states. [2019-11-20 02:33:02,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:33:02,154 INFO L93 Difference]: Finished difference Result 128 states and 135 transitions. [2019-11-20 02:33:02,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 02:33:02,155 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2019-11-20 02:33:02,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:33:02,156 INFO L225 Difference]: With dead ends: 128 [2019-11-20 02:33:02,156 INFO L226 Difference]: Without dead ends: 128 [2019-11-20 02:33:02,157 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 60 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 28.8s TimeCoverageRelationStatistics Valid=77, Invalid=337, Unknown=6, NotChecked=0, Total=420 [2019-11-20 02:33:02,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-20 02:33:02,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 114. [2019-11-20 02:33:02,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-20 02:33:02,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2019-11-20 02:33:02,165 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 41 [2019-11-20 02:33:02,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:33:02,165 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2019-11-20 02:33:02,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 02:33:02,166 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2019-11-20 02:33:02,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-20 02:33:02,166 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:33:02,166 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:33:02,367 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:33:02,367 INFO L410 AbstractCegarLoop]: === Iteration 12 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 02:33:02,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:33:02,367 INFO L82 PathProgramCache]: Analyzing trace with hash -930251749, now seen corresponding path program 1 times [2019-11-20 02:33:02,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:33:02,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [327924438] [2019-11-20 02:33:02,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8ac3dc76-8fb7-47f5-b878-5735f4c51dfd/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:33:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:33:02,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-20 02:33:02,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:33:02,796 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-20 02:33:02,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:33:02,802 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:33:02,805 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-20 02:33:02,805 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:33:02,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:33:02,811 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:33:02,811 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-20 02:33:02,899 INFO L392 ElimStorePlain]: Different costs {2=[|v_old(#length)_AFTER_CALL_35|], 4=[|v_#valid_BEFORE_CALL_9|]} [2019-11-20 02:33:02,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:33:02,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:33:02,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:33:02,913 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2019-11-20 02:33:02,914 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:33:02,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:33:02,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:33:02,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:33:02,969 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:33:02,969 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 24 [2019-11-20 02:33:02,970 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:33:02,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:33:02,995 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-20 02:33:02,996 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:25 [2019-11-20 02:33:03,295 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:33:03,296 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 90 [2019-11-20 02:33:03,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:33:03,364 INFO L567 ElimStorePlain]: treesize reduction 38, result has 51.3 percent of original size [2019-11-20 02:33:03,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:33:03,365 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 02:33:03,366 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:40 [2019-11-20 02:33:03,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:33:03,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:33:03,512 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:33:03,513 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:33:03,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:33:05,865 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_dll_insert_~head.offset_BEFORE_CALL_2 (_ BitVec 32)) (v_dll_insert_~head.base_BEFORE_CALL_4 (_ BitVec 32))) (let ((.cse0 (bvadd v_dll_insert_~head.offset_BEFORE_CALL_2 (_ bv4 32)))) (or (bvsle .cse0 (select |c_#length| v_dll_insert_~head.base_BEFORE_CALL_4)) (not (bvsle (_ bv0 32) v_dll_insert_~head.offset_BEFORE_CALL_2)) (exists ((v_node_create_~temp~0.base_25 (_ BitVec 32))) (not (bvsle (bvadd v_dll_insert_~head.offset_BEFORE_CALL_2 (_ bv4 32)) (select (store |c_old(#length)| v_node_create_~temp~0.base_25 (_ bv12 32)) v_dll_insert_~head.base_BEFORE_CALL_4)))) (not (bvsle v_dll_insert_~head.offset_BEFORE_CALL_2 .cse0))))) is different from false [2019-11-20 02:33:12,951 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 24 [2019-11-20 02:33:13,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:33:13,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:33:13,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:33:13,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:33:13,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:33:13,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:33:13,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:33:13,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:33:13,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:33:13,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:33:23,695 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 37 [2019-11-20 02:33:45,317 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 9 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:33:45,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [327924438] [2019-11-20 02:33:45,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 02:33:45,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2019-11-20 02:33:45,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179849210] [2019-11-20 02:33:45,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-20 02:33:45,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:33:45,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 02:33:45,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=348, Unknown=15, NotChecked=38, Total=462 [2019-11-20 02:33:45,319 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand 22 states. [2019-11-20 02:33:51,447 WARN L191 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 52 [2019-11-20 02:33:59,896 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_node_create_~temp~0.base_25 (_ BitVec 32)) (v_dll_create_~new_head~0.base_53 (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_main_~#s~0.offset_BEFORE_CALL_3| (_ BitVec 32))) (let ((.cse0 (bvadd |v_main_~#s~0.offset_BEFORE_CALL_3| (_ bv4 32)))) (or (not (bvsle (_ bv0 32) |v_main_~#s~0.offset_BEFORE_CALL_3|)) (exists ((v_prenex_7 (_ BitVec 32)) (v_prenex_9 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32))) (and (= (select |c_old(#valid)| v_prenex_8) (_ bv0 1)) (= (select (store |c_old(#valid)| v_prenex_8 (_ bv1 1)) v_prenex_9) (_ bv0 1)) (not (bvsle (bvadd |v_main_~#s~0.offset_BEFORE_CALL_3| (_ bv4 32)) (select (store (store (store |c_old(#length)| v_prenex_8 (_ bv12 32)) v_prenex_9 (_ bv12 32)) v_prenex_7 (_ bv12 32)) |v_main_~#s~0.base_BEFORE_CALL_6|))))) (not (bvsle |v_main_~#s~0.offset_BEFORE_CALL_3| .cse0)) (not (= (select |c_#valid| v_dll_create_~new_head~0.base_53) (_ bv0 1))) (bvsle .cse0 (select (store (store |c_#length| v_dll_create_~new_head~0.base_53 (_ bv12 32)) v_node_create_~temp~0.base_25 (_ bv12 32)) |v_main_~#s~0.base_BEFORE_CALL_6|))))) (exists ((|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |dll_create_#t~malloc3.base| (_ bv12 32)) |c_#length|) (= (select |c_old(#valid)| |dll_create_#t~malloc3.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |dll_create_#t~malloc3.base| (_ bv1 1)))))) is different from false [2019-11-20 02:34:01,921 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_4 (_ BitVec 32)) (|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| v_prenex_4) (_ bv0 1)) (= (select (store |c_old(#valid)| v_prenex_4 (_ bv1 1)) |dll_create_#t~malloc3.base|) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| v_prenex_4 (_ bv12 32)) |dll_create_#t~malloc3.base| (_ bv12 32))))) (forall ((v_node_create_~temp~0.base_25 (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_main_~#s~0.offset_BEFORE_CALL_3| (_ BitVec 32))) (let ((.cse0 (bvadd |v_main_~#s~0.offset_BEFORE_CALL_3| (_ bv4 32)))) (or (not (bvsle (_ bv0 32) |v_main_~#s~0.offset_BEFORE_CALL_3|)) (exists ((v_prenex_7 (_ BitVec 32)) (v_prenex_9 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32))) (and (= (select |c_old(#valid)| v_prenex_8) (_ bv0 1)) (= (select (store |c_old(#valid)| v_prenex_8 (_ bv1 1)) v_prenex_9) (_ bv0 1)) (not (bvsle (bvadd |v_main_~#s~0.offset_BEFORE_CALL_3| (_ bv4 32)) (select (store (store (store |c_old(#length)| v_prenex_8 (_ bv12 32)) v_prenex_9 (_ bv12 32)) v_prenex_7 (_ bv12 32)) |v_main_~#s~0.base_BEFORE_CALL_6|))))) (not (bvsle |v_main_~#s~0.offset_BEFORE_CALL_3| .cse0)) (bvsle .cse0 (select (store |c_#length| v_node_create_~temp~0.base_25 (_ bv12 32)) |v_main_~#s~0.base_BEFORE_CALL_6|)))))) is different from false [2019-11-20 02:34:09,337 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((node_create_~temp~0.base (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| node_create_~temp~0.base (_ bv12 32)))) (forall ((v_node_create_~temp~0.base_25 (_ BitVec 32)) (v_dll_create_~new_head~0.base_53 (_ BitVec 32)) (v_dll_create_~new_head~0.base_54 (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_main_~#s~0.offset_BEFORE_CALL_3| (_ BitVec 32))) (let ((.cse0 (bvadd |v_main_~#s~0.offset_BEFORE_CALL_3| (_ bv4 32)))) (or (not (bvsle (_ bv0 32) |v_main_~#s~0.offset_BEFORE_CALL_3|)) (exists ((v_prenex_7 (_ BitVec 32)) (v_prenex_9 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32))) (and (= (select |c_old(#valid)| v_prenex_8) (_ bv0 1)) (= (select (store |c_old(#valid)| v_prenex_8 (_ bv1 1)) v_prenex_9) (_ bv0 1)) (not (bvsle (bvadd |v_main_~#s~0.offset_BEFORE_CALL_3| (_ bv4 32)) (select (store (store (store |c_old(#length)| v_prenex_8 (_ bv12 32)) v_prenex_9 (_ bv12 32)) v_prenex_7 (_ bv12 32)) |v_main_~#s~0.base_BEFORE_CALL_6|))))) (not (bvsle |v_main_~#s~0.offset_BEFORE_CALL_3| .cse0)) (not (= (select (store |c_#valid| v_dll_create_~new_head~0.base_54 (_ bv1 1)) v_dll_create_~new_head~0.base_53) (_ bv0 1))) (not (= (select |c_#valid| v_dll_create_~new_head~0.base_54) (_ bv0 1))) (bvsle .cse0 (select (store (store (store |c_#length| v_dll_create_~new_head~0.base_54 (_ bv12 32)) v_dll_create_~new_head~0.base_53 (_ bv12 32)) v_node_create_~temp~0.base_25 (_ bv12 32)) |v_main_~#s~0.base_BEFORE_CALL_6|))))) (= |c_dll_insert_#in~head.offset| (_ bv0 32)) (= |c_#valid| |c_old(#valid)|) (= (bvadd (select |c_#length| |c_dll_insert_#in~head.base|) (_ bv4294967292 32)) (_ bv0 32)) (= |c_old(#length)| |c_#length|) (exists ((v_prenex_4 (_ BitVec 32)) (|dll_create_#t~malloc3.base| (_ BitVec 32))) (and (= (bvadd (select |c_#length| v_prenex_4) (_ bv4294967284 32)) (_ bv0 32)) (not (= v_prenex_4 |dll_create_#t~malloc3.base|)) (= (_ bv12 32) (select |c_#length| |dll_create_#t~malloc3.base|))))) is different from false [2019-11-20 02:34:11,930 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((node_create_~temp~0.base (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| node_create_~temp~0.base (_ bv12 32)))) (forall ((v_node_create_~temp~0.base_25 (_ BitVec 32)) (v_dll_create_~new_head~0.base_53 (_ BitVec 32)) (v_dll_create_~new_head~0.base_54 (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_main_~#s~0.offset_BEFORE_CALL_3| (_ BitVec 32))) (let ((.cse0 (bvadd |v_main_~#s~0.offset_BEFORE_CALL_3| (_ bv4 32)))) (or (not (bvsle (_ bv0 32) |v_main_~#s~0.offset_BEFORE_CALL_3|)) (exists ((v_prenex_7 (_ BitVec 32)) (v_prenex_9 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32))) (and (= (select |c_old(#valid)| v_prenex_8) (_ bv0 1)) (= (select (store |c_old(#valid)| v_prenex_8 (_ bv1 1)) v_prenex_9) (_ bv0 1)) (not (bvsle (bvadd |v_main_~#s~0.offset_BEFORE_CALL_3| (_ bv4 32)) (select (store (store (store |c_old(#length)| v_prenex_8 (_ bv12 32)) v_prenex_9 (_ bv12 32)) v_prenex_7 (_ bv12 32)) |v_main_~#s~0.base_BEFORE_CALL_6|))))) (not (bvsle |v_main_~#s~0.offset_BEFORE_CALL_3| .cse0)) (not (= (select (store |c_#valid| v_dll_create_~new_head~0.base_54 (_ bv1 1)) v_dll_create_~new_head~0.base_53) (_ bv0 1))) (not (= (select |c_#valid| v_dll_create_~new_head~0.base_54) (_ bv0 1))) (bvsle .cse0 (select (store (store (store |c_#length| v_dll_create_~new_head~0.base_54 (_ bv12 32)) v_dll_create_~new_head~0.base_53 (_ bv12 32)) v_node_create_~temp~0.base_25 (_ bv12 32)) |v_main_~#s~0.base_BEFORE_CALL_6|))))) (= |c_#valid| |c_old(#valid)|) (= |c_old(#length)| |c_#length|)) is different from false [2019-11-20 02:34:13,957 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((node_create_~temp~0.base (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| node_create_~temp~0.base (_ bv12 32)))) (forall ((v_dll_insert_~head.offset_BEFORE_CALL_2 (_ BitVec 32)) (v_dll_insert_~head.base_BEFORE_CALL_4 (_ BitVec 32))) (let ((.cse0 (bvadd v_dll_insert_~head.offset_BEFORE_CALL_2 (_ bv4 32)))) (or (bvsle .cse0 (select |c_#length| v_dll_insert_~head.base_BEFORE_CALL_4)) (not (bvsle (_ bv0 32) v_dll_insert_~head.offset_BEFORE_CALL_2)) (exists ((v_node_create_~temp~0.base_25 (_ BitVec 32))) (not (bvsle (bvadd v_dll_insert_~head.offset_BEFORE_CALL_2 (_ bv4 32)) (select (store |c_old(#length)| v_node_create_~temp~0.base_25 (_ bv12 32)) v_dll_insert_~head.base_BEFORE_CALL_4)))) (not (bvsle v_dll_insert_~head.offset_BEFORE_CALL_2 .cse0)))))) is different from false [2019-11-20 02:35:04,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:35:04,313 INFO L93 Difference]: Finished difference Result 174 states and 189 transitions. [2019-11-20 02:35:04,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 02:35:04,314 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 41 [2019-11-20 02:35:04,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:35:04,316 INFO L225 Difference]: With dead ends: 174 [2019-11-20 02:35:04,316 INFO L226 Difference]: Without dead ends: 174 [2019-11-20 02:35:04,317 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 58.0s TimeCoverageRelationStatistics Valid=77, Invalid=388, Unknown=21, NotChecked=270, Total=756 [2019-11-20 02:35:04,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-11-20 02:35:04,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 148. [2019-11-20 02:35:04,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-11-20 02:35:04,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 174 transitions. [2019-11-20 02:35:04,322 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 174 transitions. Word has length 41 [2019-11-20 02:35:04,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:35:04,324 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 174 transitions. [2019-11-20 02:35:04,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-20 02:35:04,324 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 174 transitions. [2019-11-20 02:35:04,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 02:35:04,325 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:35:04,326 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:35:04,530 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:35:04,530 INFO L410 AbstractCegarLoop]: === Iteration 13 === [dll_createErr4REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_insertErr20REQUIRES_VIOLATION, dll_insertErr9REQUIRES_VIOLATION, dll_insertErr19REQUIRES_VIOLATION, dll_insertErr8REQUIRES_VIOLATION, dll_insertErr18REQUIRES_VIOLATION, dll_insertErr23REQUIRES_VIOLATION, dll_insertErr12REQUIRES_VIOLATION, dll_insertErr1REQUIRES_VIOLATION, dll_insertErr22REQUIRES_VIOLATION, dll_insertErr0REQUIRES_VIOLATION, dll_insertErr11REQUIRES_VIOLATION, dll_insertErr21REQUIRES_VIOLATION, dll_insertErr10REQUIRES_VIOLATION, dll_insertErr15REQUIRES_VIOLATION, dll_insertErr4REQUIRES_VIOLATION, dll_insertErr14REQUIRES_VIOLATION, dll_insertErr3REQUIRES_VIOLATION, dll_insertErr13REQUIRES_VIOLATION, dll_insertErr2REQUIRES_VIOLATION, dll_insertErr7REQUIRES_VIOLATION, dll_insertErr17REQUIRES_VIOLATION, dll_insertErr6REQUIRES_VIOLATION, dll_insertErr16REQUIRES_VIOLATION, dll_insertErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION]=== [2019-11-20 02:35:04,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:35:04,530 INFO L82 PathProgramCache]: Analyzing trace with hash -2000885204, now seen corresponding path program 1 times [2019-11-20 02:35:04,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:35:04,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2015843522] [2019-11-20 02:35:04,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8ac3dc76-8fb7-47f5-b878-5735f4c51dfd/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:35:04,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:35:04,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-20 02:35:04,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:35:04,930 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:35:04,931 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-20 02:35:04,931 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:35:04,979 INFO L567 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2019-11-20 02:35:04,980 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-20 02:35:04,980 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:17 [2019-11-20 02:35:05,266 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 9 treesize of output 3 [2019-11-20 02:35:05,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:35:05,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:35:05,277 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_BEFORE_CALL_2| vanished before elimination [2019-11-20 02:35:05,277 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:35:05,277 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:13 [2019-11-20 02:35:12,396 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:35:12,397 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 21 treesize of output 59 [2019-11-20 02:35:12,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:35:12,584 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-11-20 02:35:12,584 INFO L567 ElimStorePlain]: treesize reduction 26, result has 70.8 percent of original size [2019-11-20 02:35:12,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:35:12,659 INFO L343 Elim1Store]: treesize reduction 82, result has 18.8 percent of original size [2019-11-20 02:35:12,660 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 35 [2019-11-20 02:35:12,660 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:35:12,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:35:12,727 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 02:35:12,727 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:61, output treesize:58 [2019-11-20 02:35:12,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:35:12,864 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-20 02:35:12,865 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 21 [2019-11-20 02:35:12,865 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:35:12,901 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:35:12,901 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 02:35:12,902 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:62, output treesize:27 [2019-11-20 02:35:13,076 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:35:13,076 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:35:13,340 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:35:13,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:35:13,381 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 02:35:13,381 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:41 [2019-11-20 02:35:21,171 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:35:21,254 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:35:21,455 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:35:21,455 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_dll_insert_~head.base_BEFORE_CALL_6 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_dll_insert_~head.offset_BEFORE_CALL_4 (_ BitVec 32))) (exists ((v_node_create_~temp~0.offset_26 (_ BitVec 32)) (|v_node_create_#t~malloc2.base_17| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (or (and (= (select |old(#valid)| |v_node_create_#t~malloc2.base_17|) (_ bv0 1)) (bvslt |v_node_create_#t~malloc2.base_17| |#StackHeapBarrier|) (not (= (_ bv1 1) (select (store |old(#valid)| |v_node_create_#t~malloc2.base_17| (_ bv1 1)) (select (select (store |old(#memory_$Pointer$.base)| |v_node_create_#t~malloc2.base_17| (store (store (store (select |old(#memory_$Pointer$.base)| |v_node_create_#t~malloc2.base_17|) (bvadd v_node_create_~temp~0.offset_26 (_ bv4 32)) (_ bv0 32)) (bvadd v_node_create_~temp~0.offset_26 (_ bv8 32)) (_ bv0 32)) v_node_create_~temp~0.offset_26 v_DerPreprocessor_1)) v_dll_insert_~head.base_BEFORE_CALL_6) v_dll_insert_~head.offset_BEFORE_CALL_4))))) (= (bvadd (select |#valid| (select (select (store |#memory_$Pointer$.base| node_create_~temp~0.base (store (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset v_DerPreprocessor_2)) v_dll_insert_~head.base_BEFORE_CALL_6) v_dll_insert_~head.offset_BEFORE_CALL_4)) (_ bv1 1)) (_ bv0 1))))) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:667) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:493) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 02:35:21,460 INFO L168 Benchmark]: Toolchain (without parser) took 252608.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 173.0 MB). Free memory was 938.1 MB in the beginning and 892.9 MB in the end (delta: 45.2 MB). Peak memory consumption was 218.2 MB. Max. memory is 11.5 GB. [2019-11-20 02:35:21,461 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:35:21,461 INFO L168 Benchmark]: CACSL2BoogieTranslator took 525.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -168.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-20 02:35:21,461 INFO L168 Benchmark]: Boogie Preprocessor took 69.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:35:21,462 INFO L168 Benchmark]: RCFGBuilder took 1018.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 76.9 MB). Peak memory consumption was 76.9 MB. Max. memory is 11.5 GB. [2019-11-20 02:35:21,462 INFO L168 Benchmark]: TraceAbstraction took 250990.54 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 37.7 MB). Free memory was 1.0 GB in the beginning and 892.9 MB in the end (delta: 137.1 MB). Peak memory consumption was 174.9 MB. Max. memory is 11.5 GB. [2019-11-20 02:35:21,464 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 525.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -168.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1018.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 76.9 MB). Peak memory consumption was 76.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 250990.54 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 37.7 MB). Free memory was 1.0 GB in the beginning and 892.9 MB in the end (delta: 137.1 MB). Peak memory consumption was 174.9 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_dll_insert_~head.base_BEFORE_CALL_6 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_dll_insert_~head.offset_BEFORE_CALL_4 (_ BitVec 32))) (exists ((v_node_create_~temp~0.offset_26 (_ BitVec 32)) (|v_node_create_#t~malloc2.base_17| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (or (and (= (select |old(#valid)| |v_node_create_#t~malloc2.base_17|) (_ bv0 1)) (bvslt |v_node_create_#t~malloc2.base_17| |#StackHeapBarrier|) (not (= (_ bv1 1) (select (store |old(#valid)| |v_node_create_#t~malloc2.base_17| (_ bv1 1)) (select (select (store |old(#memory_$Pointer$.base)| |v_node_create_#t~malloc2.base_17| (store (store (store (select |old(#memory_$Pointer$.base)| |v_node_create_#t~malloc2.base_17|) (bvadd v_node_create_~temp~0.offset_26 (_ bv4 32)) (_ bv0 32)) (bvadd v_node_create_~temp~0.offset_26 (_ bv8 32)) (_ bv0 32)) v_node_create_~temp~0.offset_26 v_DerPreprocessor_1)) v_dll_insert_~head.base_BEFORE_CALL_6) v_dll_insert_~head.offset_BEFORE_CALL_4))))) (= (bvadd (select |#valid| (select (select (store |#memory_$Pointer$.base| node_create_~temp~0.base (store (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset v_DerPreprocessor_2)) v_dll_insert_~head.base_BEFORE_CALL_6) v_dll_insert_~head.offset_BEFORE_CALL_4)) (_ bv1 1)) (_ bv0 1))))) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: (forall ((v_dll_insert_~head.base_BEFORE_CALL_6 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_dll_insert_~head.offset_BEFORE_CALL_4 (_ BitVec 32))) (exists ((v_node_create_~temp~0.offset_26 (_ BitVec 32)) (|v_node_create_#t~malloc2.base_17| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (or (and (= (select |old(#valid)| |v_node_create_#t~malloc2.base_17|) (_ bv0 1)) (bvslt |v_node_create_#t~malloc2.base_17| |#StackHeapBarrier|) (not (= (_ bv1 1) (select (store |old(#valid)| |v_node_create_#t~malloc2.base_17| (_ bv1 1)) (select (select (store |old(#memory_$Pointer$.base)| |v_node_create_#t~malloc2.base_17| (store (store (store (select |old(#memory_$Pointer$.base)| |v_node_create_#t~malloc2.base_17|) (bvadd v_node_create_~temp~0.offset_26 (_ bv4 32)) (_ bv0 32)) (bvadd v_node_create_~temp~0.offset_26 (_ bv8 32)) (_ bv0 32)) v_node_create_~temp~0.offset_26 v_DerPreprocessor_1)) v_dll_insert_~head.base_BEFORE_CALL_6) v_dll_insert_~head.offset_BEFORE_CALL_4))))) (= (bvadd (select |#valid| (select (select (store |#memory_$Pointer$.base| node_create_~temp~0.base (store (select |#memory_$Pointer$.base| node_create_~temp~0.base) node_create_~temp~0.offset v_DerPreprocessor_2)) v_dll_insert_~head.base_BEFORE_CALL_6) v_dll_insert_~head.offset_BEFORE_CALL_4)) (_ bv1 1)) (_ bv0 1))))): 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...