./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test11_1_false-valid-free.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test11_1_false-valid-free.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 41595dc52c6906fb55de72b138967114013fb2be ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test11_1_false-valid-free.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 41595dc52c6906fb55de72b138967114013fb2be .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free) --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 09:44:56,980 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 09:44:56,981 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 09:44:56,987 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 09:44:56,987 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 09:44:56,988 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 09:44:56,989 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 09:44:56,989 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 09:44:56,990 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 09:44:56,991 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 09:44:56,991 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 09:44:56,991 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 09:44:56,992 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 09:44:56,992 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 09:44:56,993 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 09:44:56,993 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 09:44:56,993 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 09:44:56,994 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 09:44:56,995 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 09:44:56,996 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 09:44:56,996 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 09:44:56,997 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 09:44:56,998 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 09:44:56,998 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 09:44:56,998 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 09:44:56,999 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 09:44:56,999 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 09:44:56,999 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 09:44:57,000 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 09:44:57,000 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 09:44:57,001 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 09:44:57,001 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 09:44:57,001 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 09:44:57,001 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 09:44:57,002 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 09:44:57,002 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 09:44:57,002 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-02 09:44:57,009 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 09:44:57,009 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 09:44:57,010 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 09:44:57,010 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 09:44:57,010 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 09:44:57,010 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 09:44:57,010 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 09:44:57,010 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 09:44:57,010 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 09:44:57,011 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 09:44:57,011 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 09:44:57,011 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 09:44:57,011 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 09:44:57,011 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 09:44:57,011 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 09:44:57,012 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 09:44:57,012 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 09:44:57,012 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 09:44:57,012 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 09:44:57,012 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 09:44:57,012 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 09:44:57,012 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 09:44:57,012 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 09:44:57,012 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 09:44:57,013 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 09:44:57,013 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 09:44:57,013 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 09:44:57,013 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 09:44:57,013 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 09:44:57,013 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 09:44:57,013 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 09:44:57,013 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 09:44:57,014 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 09:44:57,014 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 09:44:57,014 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 09:44:57,014 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 09:44:57,014 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan 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 -> Taipan 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 -> 41595dc52c6906fb55de72b138967114013fb2be [2018-12-02 09:44:57,031 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 09:44:57,038 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 09:44:57,039 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 09:44:57,040 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 09:44:57,040 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 09:44:57,041 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test11_1_false-valid-free.i [2018-12-02 09:44:57,075 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/data/9739706fa/11594060ab104d52a95113a7864121d7/FLAG0f4adfa68 [2018-12-02 09:44:57,566 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 09:44:57,566 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/sv-benchmarks/c/ldv-memsafety/memleaks_test11_1_false-valid-free.i [2018-12-02 09:44:57,574 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/data/9739706fa/11594060ab104d52a95113a7864121d7/FLAG0f4adfa68 [2018-12-02 09:44:58,060 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/data/9739706fa/11594060ab104d52a95113a7864121d7 [2018-12-02 09:44:58,062 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 09:44:58,063 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 09:44:58,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 09:44:58,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 09:44:58,067 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 09:44:58,067 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:44:58" (1/1) ... [2018-12-02 09:44:58,069 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75090e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:44:58, skipping insertion in model container [2018-12-02 09:44:58,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:44:58" (1/1) ... [2018-12-02 09:44:58,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 09:44:58,101 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 09:44:58,324 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 09:44:58,333 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 09:44:58,368 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 09:44:58,403 INFO L195 MainTranslator]: Completed translation [2018-12-02 09:44:58,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:44:58 WrapperNode [2018-12-02 09:44:58,404 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 09:44:58,404 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 09:44:58,404 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 09:44:58,404 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 09:44:58,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:44:58" (1/1) ... [2018-12-02 09:44:58,420 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:44:58" (1/1) ... [2018-12-02 09:44:58,425 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 09:44:58,425 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 09:44:58,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 09:44:58,426 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 09:44:58,431 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:44:58" (1/1) ... [2018-12-02 09:44:58,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:44:58" (1/1) ... [2018-12-02 09:44:58,433 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:44:58" (1/1) ... [2018-12-02 09:44:58,433 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:44:58" (1/1) ... [2018-12-02 09:44:58,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:44:58" (1/1) ... [2018-12-02 09:44:58,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:44:58" (1/1) ... [2018-12-02 09:44:58,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:44:58" (1/1) ... [2018-12-02 09:44:58,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 09:44:58,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 09:44:58,443 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 09:44:58,443 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 09:44:58,444 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:44:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/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 [2018-12-02 09:44:58,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 09:44:58,474 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-02 09:44:58,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-02 09:44:58,474 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2018-12-02 09:44:58,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2018-12-02 09:44:58,475 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_i2c_set_clientdata [2018-12-02 09:44:58,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_i2c_set_clientdata [2018-12-02 09:44:58,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 09:44:58,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 09:44:58,475 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2018-12-02 09:44:58,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2018-12-02 09:44:58,475 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_i2c_get_clientdata [2018-12-02 09:44:58,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_i2c_get_clientdata [2018-12-02 09:44:58,475 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 09:44:58,475 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 09:44:58,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 09:44:58,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 09:44:58,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 09:44:58,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 09:44:58,475 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_2_11 [2018-12-02 09:44:58,476 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_2_11 [2018-12-02 09:44:58,476 INFO L130 BoogieDeclarations]: Found specification of procedure free_11 [2018-12-02 09:44:58,476 INFO L138 BoogieDeclarations]: Found implementation of procedure free_11 [2018-12-02 09:44:58,476 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-02 09:44:58,476 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-02 09:44:58,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 09:44:58,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 09:44:58,677 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 09:44:58,677 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-02 09:44:58,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:44:58 BoogieIcfgContainer [2018-12-02 09:44:58,677 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 09:44:58,678 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 09:44:58,678 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 09:44:58,680 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 09:44:58,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:44:58" (1/3) ... [2018-12-02 09:44:58,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4806080d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:44:58, skipping insertion in model container [2018-12-02 09:44:58,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:44:58" (2/3) ... [2018-12-02 09:44:58,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4806080d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:44:58, skipping insertion in model container [2018-12-02 09:44:58,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:44:58" (3/3) ... [2018-12-02 09:44:58,682 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test11_1_false-valid-free.i [2018-12-02 09:44:58,688 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 09:44:58,692 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2018-12-02 09:44:58,701 INFO L257 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2018-12-02 09:44:58,716 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 09:44:58,717 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 09:44:58,717 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 09:44:58,717 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 09:44:58,717 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 09:44:58,717 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 09:44:58,717 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 09:44:58,717 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 09:44:58,727 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2018-12-02 09:44:58,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 09:44:58,733 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:44:58,733 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:44:58,735 INFO L423 AbstractCegarLoop]: === Iteration 1 === [alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:44:58,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:44:58,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1929161300, now seen corresponding path program 1 times [2018-12-02 09:44:58,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:44:58,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:44:58,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:44:58,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:44:58,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:44:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:44:58,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:44:58,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:44:58,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 09:44:58,845 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:44:58,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 09:44:58,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 09:44:58,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:44:58,858 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 3 states. [2018-12-02 09:44:58,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:44:58,971 INFO L93 Difference]: Finished difference Result 153 states and 179 transitions. [2018-12-02 09:44:58,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 09:44:58,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-02 09:44:58,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:44:58,980 INFO L225 Difference]: With dead ends: 153 [2018-12-02 09:44:58,980 INFO L226 Difference]: Without dead ends: 147 [2018-12-02 09:44:58,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:44:58,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-02 09:44:59,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 104. [2018-12-02 09:44:59,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-02 09:44:59,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2018-12-02 09:44:59,010 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 16 [2018-12-02 09:44:59,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:44:59,010 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2018-12-02 09:44:59,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 09:44:59,011 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2018-12-02 09:44:59,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 09:44:59,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:44:59,011 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:44:59,012 INFO L423 AbstractCegarLoop]: === Iteration 2 === [alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:44:59,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:44:59,012 INFO L82 PathProgramCache]: Analyzing trace with hash 622995661, now seen corresponding path program 1 times [2018-12-02 09:44:59,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:44:59,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:44:59,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:44:59,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:44:59,014 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:44:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:44:59,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:44:59,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:44:59,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:44:59,049 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:44:59,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:44:59,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:44:59,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:44:59,051 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand 5 states. [2018-12-02 09:44:59,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:44:59,078 INFO L93 Difference]: Finished difference Result 132 states and 152 transitions. [2018-12-02 09:44:59,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:44:59,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-12-02 09:44:59,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:44:59,079 INFO L225 Difference]: With dead ends: 132 [2018-12-02 09:44:59,079 INFO L226 Difference]: Without dead ends: 132 [2018-12-02 09:44:59,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:44:59,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-02 09:44:59,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 100. [2018-12-02 09:44:59,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-02 09:44:59,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2018-12-02 09:44:59,085 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 16 [2018-12-02 09:44:59,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:44:59,085 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2018-12-02 09:44:59,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:44:59,085 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2018-12-02 09:44:59,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 09:44:59,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:44:59,086 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:44:59,086 INFO L423 AbstractCegarLoop]: === Iteration 3 === [alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:44:59,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:44:59,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1721395782, now seen corresponding path program 1 times [2018-12-02 09:44:59,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:44:59,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:44:59,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:44:59,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:44:59,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:44:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:44:59,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 09:44:59,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:44:59,123 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:44:59,123 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-02 09:44:59,124 INFO L205 CegarAbsIntRunner]: [44], [48], [49], [50], [51], [74], [79], [81], [84], [113], [119], [129], [130], [131], [137], [138], [139], [140] [2018-12-02 09:44:59,143 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 09:44:59,143 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 09:44:59,218 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 09:44:59,219 INFO L272 AbstractInterpreter]: Visited 13 different actions 13 times. Never merged. Never widened. Performed 108 root evaluator evaluations with a maximum evaluation depth of 3. Performed 108 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 24 variables. [2018-12-02 09:44:59,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:44:59,224 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 09:44:59,255 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 92.32% of their original sizes. [2018-12-02 09:44:59,255 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 09:44:59,272 INFO L418 sIntCurrentIteration]: We unified 20 AI predicates to 20 [2018-12-02 09:44:59,272 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 09:44:59,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 09:44:59,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2018-12-02 09:44:59,273 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:44:59,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 09:44:59,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 09:44:59,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:44:59,274 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 6 states. [2018-12-02 09:44:59,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:44:59,357 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2018-12-02 09:44:59,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 09:44:59,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-12-02 09:44:59,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:44:59,358 INFO L225 Difference]: With dead ends: 110 [2018-12-02 09:44:59,358 INFO L226 Difference]: Without dead ends: 106 [2018-12-02 09:44:59,358 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 09:44:59,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-02 09:44:59,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2018-12-02 09:44:59,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-02 09:44:59,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2018-12-02 09:44:59,363 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 21 [2018-12-02 09:44:59,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:44:59,363 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2018-12-02 09:44:59,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 09:44:59,363 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2018-12-02 09:44:59,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 09:44:59,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:44:59,364 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:44:59,364 INFO L423 AbstractCegarLoop]: === Iteration 4 === [alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:44:59,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:44:59,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1427992775, now seen corresponding path program 1 times [2018-12-02 09:44:59,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:44:59,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:44:59,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:44:59,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:44:59,365 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:44:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:44:59,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 09:44:59,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:44:59,398 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:44:59,398 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-02 09:44:59,399 INFO L205 CegarAbsIntRunner]: [44], [47], [48], [49], [50], [51], [74], [79], [81], [84], [113], [119], [129], [130], [131], [137], [138], [139], [140] [2018-12-02 09:44:59,400 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 09:44:59,400 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 09:44:59,433 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 09:44:59,434 INFO L272 AbstractInterpreter]: Visited 19 different actions 31 times. Merged at 6 different actions 8 times. Never widened. Performed 218 root evaluator evaluations with a maximum evaluation depth of 3. Performed 218 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-12-02 09:44:59,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:44:59,438 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 09:44:59,463 INFO L227 lantSequenceWeakener]: Weakened 19 states. On average, predicates are now at 91.25% of their original sizes. [2018-12-02 09:44:59,463 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 09:44:59,518 INFO L418 sIntCurrentIteration]: We unified 20 AI predicates to 20 [2018-12-02 09:44:59,518 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 09:44:59,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 09:44:59,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [4] total 12 [2018-12-02 09:44:59,519 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:44:59,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 09:44:59,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 09:44:59,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-02 09:44:59,520 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 10 states. [2018-12-02 09:44:59,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:44:59,786 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2018-12-02 09:44:59,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 09:44:59,786 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-12-02 09:44:59,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:44:59,787 INFO L225 Difference]: With dead ends: 106 [2018-12-02 09:44:59,787 INFO L226 Difference]: Without dead ends: 106 [2018-12-02 09:44:59,788 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-12-02 09:44:59,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-02 09:44:59,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-02 09:44:59,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-02 09:44:59,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2018-12-02 09:44:59,794 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 21 [2018-12-02 09:44:59,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:44:59,794 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2018-12-02 09:44:59,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 09:44:59,794 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2018-12-02 09:44:59,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 09:44:59,795 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:44:59,795 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:44:59,795 INFO L423 AbstractCegarLoop]: === Iteration 5 === [alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:44:59,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:44:59,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1427992738, now seen corresponding path program 1 times [2018-12-02 09:44:59,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:44:59,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:44:59,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:44:59,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:44:59,798 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:44:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:44:59,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 09:44:59,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:44:59,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:44:59,828 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:44:59,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:44:59,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:44:59,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:44:59,829 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand 5 states. [2018-12-02 09:44:59,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:44:59,847 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2018-12-02 09:44:59,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:44:59,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-12-02 09:44:59,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:44:59,849 INFO L225 Difference]: With dead ends: 117 [2018-12-02 09:44:59,849 INFO L226 Difference]: Without dead ends: 117 [2018-12-02 09:44:59,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:44:59,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-02 09:44:59,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 110. [2018-12-02 09:44:59,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-02 09:44:59,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2018-12-02 09:44:59,853 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 21 [2018-12-02 09:44:59,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:44:59,854 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2018-12-02 09:44:59,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:44:59,854 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2018-12-02 09:44:59,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 09:44:59,854 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:44:59,854 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:44:59,855 INFO L423 AbstractCegarLoop]: === Iteration 6 === [alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:44:59,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:44:59,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1456621889, now seen corresponding path program 1 times [2018-12-02 09:44:59,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:44:59,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:44:59,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:44:59,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:44:59,856 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:44:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:44:59,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:44:59,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:44:59,916 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:44:59,916 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-02 09:44:59,916 INFO L205 CegarAbsIntRunner]: [44], [47], [49], [50], [51], [74], [79], [81], [86], [88], [119], [129], [130], [131], [137], [138], [139], [140] [2018-12-02 09:44:59,917 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 09:44:59,917 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 09:44:59,938 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 09:44:59,939 INFO L272 AbstractInterpreter]: Visited 18 different actions 21 times. Never merged. Never widened. Performed 170 root evaluator evaluations with a maximum evaluation depth of 3. Performed 170 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 24 variables. [2018-12-02 09:44:59,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:44:59,942 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 09:44:59,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:44:59,942 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:44:59,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:44:59,949 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 09:44:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:44:59,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:44:59,997 INFO L478 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 [2018-12-02 09:44:59,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:45:00,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:45:00,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 09:45:00,026 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:45:00,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:45:00,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-02 09:45:00,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:45:00,034 INFO L267 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. [2018-12-02 09:45:00,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-12-02 09:45:00,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:45:00,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:45:00,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:45:00,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 09:45:00,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2018-12-02 09:45:00,188 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 09:45:00,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 09:45:00,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 09:45:00,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-12-02 09:45:00,189 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 9 states. [2018-12-02 09:45:00,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:45:00,445 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2018-12-02 09:45:00,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 09:45:00,445 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-12-02 09:45:00,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:45:00,446 INFO L225 Difference]: With dead ends: 142 [2018-12-02 09:45:00,446 INFO L226 Difference]: Without dead ends: 142 [2018-12-02 09:45:00,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-02 09:45:00,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-02 09:45:00,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 111. [2018-12-02 09:45:00,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-02 09:45:00,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2018-12-02 09:45:00,451 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 21 [2018-12-02 09:45:00,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:45:00,451 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2018-12-02 09:45:00,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 09:45:00,451 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2018-12-02 09:45:00,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 09:45:00,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:45:00,452 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:45:00,452 INFO L423 AbstractCegarLoop]: === Iteration 7 === [alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:45:00,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:45:00,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1456621888, now seen corresponding path program 1 times [2018-12-02 09:45:00,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:45:00,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:45:00,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:45:00,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:45:00,454 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:45:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:45:00,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:45:00,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:45:00,538 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:45:00,538 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-02 09:45:00,538 INFO L205 CegarAbsIntRunner]: [44], [47], [49], [50], [51], [74], [79], [81], [86], [89], [119], [129], [130], [131], [137], [138], [139], [140] [2018-12-02 09:45:00,539 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 09:45:00,539 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 09:45:00,552 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 09:45:00,552 INFO L272 AbstractInterpreter]: Visited 18 different actions 21 times. Never merged. Never widened. Performed 171 root evaluator evaluations with a maximum evaluation depth of 3. Performed 171 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 24 variables. [2018-12-02 09:45:00,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:45:00,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 09:45:00,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:45:00,553 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:45:00,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:45:00,559 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 09:45:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:45:00,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:45:00,575 INFO L478 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 [2018-12-02 09:45:00,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:45:00,581 INFO L478 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 [2018-12-02 09:45:00,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:45:00,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:45:00,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-12-02 09:45:00,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:45:00,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:45:00,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 09:45:00,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:45:00,623 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 09:45:00,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:45:00,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:45:00,628 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-12-02 09:45:00,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:45:00,636 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:45:00,683 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 27 [2018-12-02 09:45:01,102 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 22 [2018-12-02 09:45:01,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-12-02 09:45:01,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:45:01,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-12-02 09:45:01,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-12-02 09:45:01,235 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:45:01,236 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-02 09:45:01,236 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:45:01,238 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:45:01,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:45:01,242 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:24, output treesize:7 [2018-12-02 09:45:01,256 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:45:01,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 09:45:01,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2018-12-02 09:45:01,272 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 09:45:01,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 09:45:01,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 09:45:01,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-12-02 09:45:01,273 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand 10 states. [2018-12-02 09:45:02,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:45:02,002 INFO L93 Difference]: Finished difference Result 165 states and 183 transitions. [2018-12-02 09:45:02,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 09:45:02,003 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-12-02 09:45:02,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:45:02,003 INFO L225 Difference]: With dead ends: 165 [2018-12-02 09:45:02,003 INFO L226 Difference]: Without dead ends: 165 [2018-12-02 09:45:02,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2018-12-02 09:45:02,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-12-02 09:45:02,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 110. [2018-12-02 09:45:02,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-02 09:45:02,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2018-12-02 09:45:02,008 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 21 [2018-12-02 09:45:02,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:45:02,008 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2018-12-02 09:45:02,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 09:45:02,008 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2018-12-02 09:45:02,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 09:45:02,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:45:02,008 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:45:02,008 INFO L423 AbstractCegarLoop]: === Iteration 8 === [alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:45:02,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:45:02,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1282074310, now seen corresponding path program 1 times [2018-12-02 09:45:02,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:45:02,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:45:02,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:45:02,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:45:02,010 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:45:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:45:02,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 09:45:02,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:45:02,050 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:45:02,050 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-12-02 09:45:02,051 INFO L205 CegarAbsIntRunner]: [2], [44], [47], [48], [49], [50], [51], [74], [79], [81], [84], [114], [116], [118], [119], [120], [129], [130], [131], [137], [138], [139], [140] [2018-12-02 09:45:02,051 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 09:45:02,051 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 09:45:02,070 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 09:45:02,071 INFO L272 AbstractInterpreter]: Visited 23 different actions 35 times. Merged at 6 different actions 8 times. Never widened. Performed 226 root evaluator evaluations with a maximum evaluation depth of 3. Performed 226 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-12-02 09:45:02,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:45:02,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 09:45:02,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:45:02,072 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:45:02,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:45:02,079 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 09:45:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:45:02,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:45:03,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 09:45:03,531 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:45:03,779 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:45:03,780 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacement(DerPreprocessor.java:217) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacement(DerPreprocessor.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.convert(DerPreprocessor.java:190) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:211) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2018-12-02 09:45:03,784 INFO L168 Benchmark]: Toolchain (without parser) took 5720.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 947.0 MB in the beginning and 1.0 GB in the end (delta: -89.7 MB). Peak memory consumption was 50.8 MB. Max. memory is 11.5 GB. [2018-12-02 09:45:03,785 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 09:45:03,786 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -122.6 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2018-12-02 09:45:03,787 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 09:45:03,787 INFO L168 Benchmark]: Boogie Preprocessor took 17.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 09:45:03,787 INFO L168 Benchmark]: RCFGBuilder took 234.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2018-12-02 09:45:03,788 INFO L168 Benchmark]: TraceAbstraction took 5105.29 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 45.6 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -2.9 MB). Peak memory consumption was 42.8 MB. Max. memory is 11.5 GB. [2018-12-02 09:45:03,790 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 339.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -122.6 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 234.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5105.29 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 45.6 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -2.9 MB). Peak memory consumption was 42.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacement(DerPreprocessor.java:217) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-02 09:45:05,073 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 09:45:05,074 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 09:45:05,082 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 09:45:05,082 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 09:45:05,083 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 09:45:05,083 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 09:45:05,085 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 09:45:05,086 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 09:45:05,086 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 09:45:05,087 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 09:45:05,087 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 09:45:05,088 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 09:45:05,089 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 09:45:05,089 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 09:45:05,090 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 09:45:05,091 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 09:45:05,092 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 09:45:05,093 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 09:45:05,094 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 09:45:05,095 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 09:45:05,096 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 09:45:05,098 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 09:45:05,098 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 09:45:05,098 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 09:45:05,099 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 09:45:05,099 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 09:45:05,100 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 09:45:05,100 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 09:45:05,101 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 09:45:05,101 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 09:45:05,102 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 09:45:05,102 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 09:45:05,102 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 09:45:05,103 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 09:45:05,103 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 09:45:05,103 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-02 09:45:05,114 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 09:45:05,114 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 09:45:05,115 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 09:45:05,115 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 09:45:05,115 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 09:45:05,115 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 09:45:05,116 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 09:45:05,116 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 09:45:05,116 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 09:45:05,116 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 09:45:05,116 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 09:45:05,116 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 09:45:05,117 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 09:45:05,117 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 09:45:05,117 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 09:45:05,117 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 09:45:05,117 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 09:45:05,117 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 09:45:05,117 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 09:45:05,117 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 09:45:05,117 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 09:45:05,118 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 09:45:05,118 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-02 09:45:05,118 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-02 09:45:05,118 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 09:45:05,118 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 09:45:05,118 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 09:45:05,118 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 09:45:05,118 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 09:45:05,118 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 09:45:05,118 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 09:45:05,118 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 09:45:05,119 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 09:45:05,119 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-02 09:45:05,119 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 09:45:05,119 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-02 09:45:05,119 INFO L133 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/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan 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 -> Taipan 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 -> 41595dc52c6906fb55de72b138967114013fb2be [2018-12-02 09:45:05,143 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 09:45:05,152 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 09:45:05,155 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 09:45:05,156 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 09:45:05,156 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 09:45:05,157 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test11_1_false-valid-free.i [2018-12-02 09:45:05,194 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/data/a9cc6032e/50ea5ac237c1443da4db74b4d1f85c50/FLAG422f30d77 [2018-12-02 09:45:05,567 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 09:45:05,567 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/sv-benchmarks/c/ldv-memsafety/memleaks_test11_1_false-valid-free.i [2018-12-02 09:45:05,574 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/data/a9cc6032e/50ea5ac237c1443da4db74b4d1f85c50/FLAG422f30d77 [2018-12-02 09:45:05,931 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/data/a9cc6032e/50ea5ac237c1443da4db74b4d1f85c50 [2018-12-02 09:45:05,935 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 09:45:05,937 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 09:45:05,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 09:45:05,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 09:45:05,946 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 09:45:05,947 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:45:05" (1/1) ... [2018-12-02 09:45:05,951 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@438c1f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:45:05, skipping insertion in model container [2018-12-02 09:45:05,951 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:45:05" (1/1) ... [2018-12-02 09:45:05,957 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 09:45:05,988 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 09:45:06,193 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 09:45:06,205 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 09:45:06,281 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 09:45:06,327 INFO L195 MainTranslator]: Completed translation [2018-12-02 09:45:06,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:45:06 WrapperNode [2018-12-02 09:45:06,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 09:45:06,328 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 09:45:06,328 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 09:45:06,328 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 09:45:06,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:45:06" (1/1) ... [2018-12-02 09:45:06,344 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:45:06" (1/1) ... [2018-12-02 09:45:06,349 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 09:45:06,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 09:45:06,350 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 09:45:06,350 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 09:45:06,355 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:45:06" (1/1) ... [2018-12-02 09:45:06,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:45:06" (1/1) ... [2018-12-02 09:45:06,357 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:45:06" (1/1) ... [2018-12-02 09:45:06,357 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:45:06" (1/1) ... [2018-12-02 09:45:06,364 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:45:06" (1/1) ... [2018-12-02 09:45:06,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:45:06" (1/1) ... [2018-12-02 09:45:06,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:45:06" (1/1) ... [2018-12-02 09:45:06,368 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 09:45:06,368 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 09:45:06,368 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 09:45:06,369 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 09:45:06,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:45:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/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 [2018-12-02 09:45:06,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 09:45:06,400 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-02 09:45:06,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-02 09:45:06,400 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2018-12-02 09:45:06,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2018-12-02 09:45:06,400 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_i2c_set_clientdata [2018-12-02 09:45:06,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_i2c_set_clientdata [2018-12-02 09:45:06,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 09:45:06,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 09:45:06,400 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2018-12-02 09:45:06,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2018-12-02 09:45:06,401 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_i2c_get_clientdata [2018-12-02 09:45:06,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_i2c_get_clientdata [2018-12-02 09:45:06,401 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 09:45:06,401 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 09:45:06,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 09:45:06,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 09:45:06,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 09:45:06,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 09:45:06,401 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_2_11 [2018-12-02 09:45:06,402 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_2_11 [2018-12-02 09:45:06,402 INFO L130 BoogieDeclarations]: Found specification of procedure free_11 [2018-12-02 09:45:06,402 INFO L138 BoogieDeclarations]: Found implementation of procedure free_11 [2018-12-02 09:45:06,402 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-02 09:45:06,402 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-02 09:45:06,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 09:45:06,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 09:45:06,649 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 09:45:06,649 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-02 09:45:06,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:45:06 BoogieIcfgContainer [2018-12-02 09:45:06,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 09:45:06,650 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 09:45:06,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 09:45:06,651 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 09:45:06,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:45:05" (1/3) ... [2018-12-02 09:45:06,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f198594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:45:06, skipping insertion in model container [2018-12-02 09:45:06,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:45:06" (2/3) ... [2018-12-02 09:45:06,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f198594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:45:06, skipping insertion in model container [2018-12-02 09:45:06,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:45:06" (3/3) ... [2018-12-02 09:45:06,653 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test11_1_false-valid-free.i [2018-12-02 09:45:06,659 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 09:45:06,663 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2018-12-02 09:45:06,673 INFO L257 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2018-12-02 09:45:06,688 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 09:45:06,688 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 09:45:06,688 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 09:45:06,688 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 09:45:06,688 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 09:45:06,688 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 09:45:06,689 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 09:45:06,689 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 09:45:06,689 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 09:45:06,698 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2018-12-02 09:45:06,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 09:45:06,703 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:45:06,703 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:45:06,705 INFO L423 AbstractCegarLoop]: === Iteration 1 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:45:06,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:45:06,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1929161300, now seen corresponding path program 1 times [2018-12-02 09:45:06,710 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:45:06,710 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/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 [2018-12-02 09:45:06,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:45:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:45:06,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:45:06,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:45:06,800 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 09:45:06,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:45:06,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 09:45:06,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 09:45:06,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 09:45:06,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:45:06,814 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 3 states. [2018-12-02 09:45:07,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:45:07,012 INFO L93 Difference]: Finished difference Result 153 states and 179 transitions. [2018-12-02 09:45:07,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 09:45:07,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-02 09:45:07,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:45:07,020 INFO L225 Difference]: With dead ends: 153 [2018-12-02 09:45:07,020 INFO L226 Difference]: Without dead ends: 147 [2018-12-02 09:45:07,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:45:07,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-02 09:45:07,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 104. [2018-12-02 09:45:07,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-02 09:45:07,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2018-12-02 09:45:07,050 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 16 [2018-12-02 09:45:07,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:45:07,050 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2018-12-02 09:45:07,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 09:45:07,051 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2018-12-02 09:45:07,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 09:45:07,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:45:07,052 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:45:07,052 INFO L423 AbstractCegarLoop]: === Iteration 2 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:45:07,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:45:07,052 INFO L82 PathProgramCache]: Analyzing trace with hash 622995661, now seen corresponding path program 1 times [2018-12-02 09:45:07,053 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:45:07,053 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/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 [2018-12-02 09:45:07,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:45:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:45:07,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:45:07,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:45:07,100 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 09:45:07,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:45:07,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:45:07,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:45:07,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:45:07,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:45:07,102 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand 5 states. [2018-12-02 09:45:07,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:45:07,161 INFO L93 Difference]: Finished difference Result 132 states and 152 transitions. [2018-12-02 09:45:07,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:45:07,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-12-02 09:45:07,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:45:07,163 INFO L225 Difference]: With dead ends: 132 [2018-12-02 09:45:07,163 INFO L226 Difference]: Without dead ends: 132 [2018-12-02 09:45:07,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:45:07,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-02 09:45:07,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 100. [2018-12-02 09:45:07,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-02 09:45:07,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2018-12-02 09:45:07,170 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 16 [2018-12-02 09:45:07,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:45:07,170 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2018-12-02 09:45:07,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:45:07,170 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2018-12-02 09:45:07,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 09:45:07,170 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:45:07,171 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:45:07,171 INFO L423 AbstractCegarLoop]: === Iteration 3 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:45:07,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:45:07,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1721395782, now seen corresponding path program 1 times [2018-12-02 09:45:07,171 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:45:07,171 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/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 [2018-12-02 09:45:07,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:45:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:45:07,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:45:07,236 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 09:45:07,236 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:45:07,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 09:45:07,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:45:07,258 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:45:07,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:45:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:45:07,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:45:07,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 09:45:07,284 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:45:07,301 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 09:45:07,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 09:45:07,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4] total 4 [2018-12-02 09:45:07,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:45:07,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:45:07,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:45:07,317 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 5 states. [2018-12-02 09:45:07,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:45:07,345 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2018-12-02 09:45:07,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:45:07,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-12-02 09:45:07,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:45:07,346 INFO L225 Difference]: With dead ends: 99 [2018-12-02 09:45:07,346 INFO L226 Difference]: Without dead ends: 99 [2018-12-02 09:45:07,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:45:07,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-02 09:45:07,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-02 09:45:07,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-02 09:45:07,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-12-02 09:45:07,351 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 21 [2018-12-02 09:45:07,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:45:07,351 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-12-02 09:45:07,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:45:07,352 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2018-12-02 09:45:07,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 09:45:07,352 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:45:07,352 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:45:07,352 INFO L423 AbstractCegarLoop]: === Iteration 4 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:45:07,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:45:07,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1721395745, now seen corresponding path program 1 times [2018-12-02 09:45:07,353 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:45:07,353 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/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 [2018-12-02 09:45:07,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:45:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:45:07,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:45:07,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:45:07,417 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 09:45:07,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:45:07,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:45:07,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:45:07,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:45:07,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:45:07,419 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 5 states. [2018-12-02 09:45:07,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:45:07,440 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2018-12-02 09:45:07,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:45:07,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-12-02 09:45:07,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:45:07,441 INFO L225 Difference]: With dead ends: 103 [2018-12-02 09:45:07,441 INFO L226 Difference]: Without dead ends: 101 [2018-12-02 09:45:07,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:45:07,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-02 09:45:07,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-02 09:45:07,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-02 09:45:07,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2018-12-02 09:45:07,446 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 21 [2018-12-02 09:45:07,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:45:07,447 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2018-12-02 09:45:07,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:45:07,447 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2018-12-02 09:45:07,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 09:45:07,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:45:07,447 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:45:07,448 INFO L423 AbstractCegarLoop]: === Iteration 5 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:45:07,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:45:07,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1427992738, now seen corresponding path program 1 times [2018-12-02 09:45:07,448 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:45:07,448 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/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 [2018-12-02 09:45:07,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:45:07,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:45:07,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:45:07,523 INFO L478 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 [2018-12-02 09:45:07,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:45:07,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:45:07,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 09:45:07,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:45:07,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:45:07,615 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:45:07,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:45:07,616 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:45:07,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:45:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:45:07,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:45:07,639 INFO L478 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 [2018-12-02 09:45:07,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:45:07,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:45:07,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 09:45:07,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:45:07,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:45:07,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:45:07,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 09:45:07,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5] total 6 [2018-12-02 09:45:07,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 09:45:07,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 09:45:07,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=26, Unknown=4, NotChecked=0, Total=42 [2018-12-02 09:45:07,719 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand 7 states. [2018-12-02 09:45:08,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:45:08,322 INFO L93 Difference]: Finished difference Result 155 states and 183 transitions. [2018-12-02 09:45:08,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 09:45:08,323 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-12-02 09:45:08,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:45:08,324 INFO L225 Difference]: With dead ends: 155 [2018-12-02 09:45:08,324 INFO L226 Difference]: Without dead ends: 155 [2018-12-02 09:45:08,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=59, Unknown=7, NotChecked=0, Total=90 [2018-12-02 09:45:08,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-12-02 09:45:08,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 102. [2018-12-02 09:45:08,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-02 09:45:08,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2018-12-02 09:45:08,330 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 21 [2018-12-02 09:45:08,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:45:08,330 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2018-12-02 09:45:08,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 09:45:08,330 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2018-12-02 09:45:08,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 09:45:08,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:45:08,331 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:45:08,331 INFO L423 AbstractCegarLoop]: === Iteration 6 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:45:08,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:45:08,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1427992737, now seen corresponding path program 1 times [2018-12-02 09:45:08,331 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:45:08,332 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/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 [2018-12-02 09:45:08,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:45:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:45:08,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:45:08,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 09:45:08,415 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 09:45:08,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:45:08,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:45:08,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:45:08,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:45:08,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:45:08,417 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 5 states. [2018-12-02 09:45:08,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:45:08,451 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2018-12-02 09:45:08,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:45:08,451 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-12-02 09:45:08,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:45:08,452 INFO L225 Difference]: With dead ends: 106 [2018-12-02 09:45:08,452 INFO L226 Difference]: Without dead ends: 106 [2018-12-02 09:45:08,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:45:08,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-02 09:45:08,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2018-12-02 09:45:08,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-02 09:45:08,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2018-12-02 09:45:08,456 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 21 [2018-12-02 09:45:08,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:45:08,456 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2018-12-02 09:45:08,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:45:08,457 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2018-12-02 09:45:08,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 09:45:08,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:45:08,457 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:45:08,457 INFO L423 AbstractCegarLoop]: === Iteration 7 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:45:08,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:45:08,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1456621888, now seen corresponding path program 1 times [2018-12-02 09:45:08,458 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:45:08,458 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/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 [2018-12-02 09:45:08,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:45:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:45:08,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:45:08,525 INFO L478 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 [2018-12-02 09:45:08,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:45:08,533 INFO L478 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 [2018-12-02 09:45:08,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:45:08,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:45:08,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 09:45:09,434 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 09:45:09,441 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:45:09,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:45:09,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 09:45:09,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:45:09,457 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 09:45:09,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:45:09,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:45:09,465 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:11 [2018-12-02 09:45:09,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-02 09:45:09,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:45:09,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:45:09,628 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:45:09,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:45:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:45:09,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:45:09,653 INFO L478 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 [2018-12-02 09:45:09,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:45:09,661 INFO L478 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 [2018-12-02 09:45:09,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:45:09,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:45:09,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 09:45:09,681 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:45:09,684 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 09:45:09,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:45:09,698 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:45:09,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:45:09,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 09:45:09,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:45:09,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:45:09,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2018-12-02 09:45:09,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-02 09:45:09,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:45:09,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 09:45:09,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-12-02 09:45:09,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 09:45:09,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 09:45:09,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2018-12-02 09:45:09,809 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand 9 states. [2018-12-02 09:45:10,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:45:10,453 INFO L93 Difference]: Finished difference Result 152 states and 172 transitions. [2018-12-02 09:45:10,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 09:45:10,453 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-12-02 09:45:10,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:45:10,454 INFO L225 Difference]: With dead ends: 152 [2018-12-02 09:45:10,454 INFO L226 Difference]: Without dead ends: 152 [2018-12-02 09:45:10,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=31, Invalid=104, Unknown=1, NotChecked=20, Total=156 [2018-12-02 09:45:10,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-02 09:45:10,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 103. [2018-12-02 09:45:10,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-02 09:45:10,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2018-12-02 09:45:10,458 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 21 [2018-12-02 09:45:10,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:45:10,458 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2018-12-02 09:45:10,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 09:45:10,459 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2018-12-02 09:45:10,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 09:45:10,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:45:10,459 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:45:10,459 INFO L423 AbstractCegarLoop]: === Iteration 8 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:45:10,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:45:10,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1282074310, now seen corresponding path program 1 times [2018-12-02 09:45:10,459 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:45:10,460 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/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 [2018-12-02 09:45:10,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:45:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:45:10,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:45:10,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-12-02 09:45:10,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:45:10,555 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 15 [2018-12-02 09:45:10,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 09:45:10,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 09:45:10,564 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2018-12-02 09:45:10,566 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:45:10,566 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2018-12-02 09:45:10,567 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:45:10,570 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:45:10,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 09:45:10,577 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:18, output treesize:19 [2018-12-02 09:45:12,633 WARN L854 $PredicateComparison]: unable to prove that (exists ((entry_point_~c11~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| entry_point_~c11~0.base)) (= |c_#valid| (store |c_old(#valid)| entry_point_~c11~0.base (_ bv0 1))))) is different from true [2018-12-02 09:45:12,656 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 09:45:12,656 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:45:13,042 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_entry_point_~c11~0.base_19 (_ BitVec 32))) (or (not (= (select |c_#valid| v_entry_point_~c11~0.base_19) (_ bv0 1))) (= (store |c_#valid| v_entry_point_~c11~0.base_19 (_ bv0 1)) |c_old(#valid)|))) is different from false [2018-12-02 09:45:13,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:45:13,045 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:45:13,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:45:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:45:13,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:45:13,073 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 09:45:13,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:45:13,563 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_entry_point_~c11~0.base_22 (_ BitVec 32))) (or (= (store |c_#valid| v_entry_point_~c11~0.base_22 (_ bv0 1)) |c_old(#valid)|) (not (= (select |c_#valid| v_entry_point_~c11~0.base_22) (_ bv0 1))))) is different from false [2018-12-02 09:45:13,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 09:45:13,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 9 [2018-12-02 09:45:13,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 09:45:13,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 09:45:13,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=52, Unknown=3, NotChecked=48, Total=132 [2018-12-02 09:45:13,580 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand 10 states. [2018-12-02 09:45:28,779 WARN L180 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-12-02 09:46:20,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:46:20,493 INFO L93 Difference]: Finished difference Result 145 states and 157 transitions. [2018-12-02 09:46:20,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 09:46:20,494 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-12-02 09:46:20,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:46:20,494 INFO L225 Difference]: With dead ends: 145 [2018-12-02 09:46:20,494 INFO L226 Difference]: Without dead ends: 136 [2018-12-02 09:46:20,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=33, Invalid=66, Unknown=3, NotChecked=54, Total=156 [2018-12-02 09:46:20,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-02 09:46:20,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 103. [2018-12-02 09:46:20,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-02 09:46:20,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2018-12-02 09:46:20,497 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 25 [2018-12-02 09:46:20,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:46:20,498 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2018-12-02 09:46:20,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 09:46:20,498 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2018-12-02 09:46:20,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 09:46:20,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:46:20,498 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:46:20,498 INFO L423 AbstractCegarLoop]: === Iteration 9 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:46:20,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:46:20,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1478587815, now seen corresponding path program 1 times [2018-12-02 09:46:20,499 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:46:20,499 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/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 [2018-12-02 09:46:20,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:46:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:46:20,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:46:20,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 09:46:20,540 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 09:46:20,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:46:20,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:46:20,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:46:20,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:46:20,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:46:20,542 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand 5 states. [2018-12-02 09:46:20,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:46:20,578 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2018-12-02 09:46:20,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:46:20,578 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-12-02 09:46:20,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:46:20,579 INFO L225 Difference]: With dead ends: 103 [2018-12-02 09:46:20,579 INFO L226 Difference]: Without dead ends: 103 [2018-12-02 09:46:20,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:46:20,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-02 09:46:20,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-12-02 09:46:20,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-02 09:46:20,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-12-02 09:46:20,581 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 25 [2018-12-02 09:46:20,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:46:20,581 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-12-02 09:46:20,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:46:20,581 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-12-02 09:46:20,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 09:46:20,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:46:20,582 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:46:20,582 INFO L423 AbstractCegarLoop]: === Iteration 10 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:46:20,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:46:20,582 INFO L82 PathProgramCache]: Analyzing trace with hash -2125002099, now seen corresponding path program 1 times [2018-12-02 09:46:20,582 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:46:20,582 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:46:20,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:46:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:46:20,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:46:20,640 INFO L478 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 [2018-12-02 09:46:20,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:20,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:46:20,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 09:46:20,668 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 09:46:20,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:46:20,749 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 09:46:20,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:46:20,751 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:46:20,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:46:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:46:20,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:46:20,774 INFO L478 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 [2018-12-02 09:46:20,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:20,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:46:20,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 09:46:20,779 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 09:46:20,779 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:46:20,817 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 2 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 09:46:20,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 09:46:20,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5, 5] total 9 [2018-12-02 09:46:20,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 09:46:20,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 09:46:20,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=65, Unknown=4, NotChecked=0, Total=90 [2018-12-02 09:46:20,833 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 10 states. [2018-12-02 09:46:21,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:46:21,371 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2018-12-02 09:46:21,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 09:46:21,372 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-12-02 09:46:21,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:46:21,372 INFO L225 Difference]: With dead ends: 127 [2018-12-02 09:46:21,373 INFO L226 Difference]: Without dead ends: 127 [2018-12-02 09:46:21,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=79, Unknown=5, NotChecked=0, Total=110 [2018-12-02 09:46:21,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-02 09:46:21,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 102. [2018-12-02 09:46:21,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-02 09:46:21,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2018-12-02 09:46:21,377 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 29 [2018-12-02 09:46:21,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:46:21,377 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2018-12-02 09:46:21,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 09:46:21,377 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2018-12-02 09:46:21,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 09:46:21,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:46:21,378 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:46:21,378 INFO L423 AbstractCegarLoop]: === Iteration 11 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:46:21,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:46:21,378 INFO L82 PathProgramCache]: Analyzing trace with hash -2125002098, now seen corresponding path program 1 times [2018-12-02 09:46:21,379 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:46:21,379 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:46:21,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:46:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:46:21,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:46:21,473 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 09:46:21,474 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 09:46:21,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:46:21,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:46:21,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:46:21,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:46:21,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:46:21,476 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 5 states. [2018-12-02 09:46:21,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:46:21,501 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2018-12-02 09:46:21,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:46:21,502 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-12-02 09:46:21,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:46:21,502 INFO L225 Difference]: With dead ends: 112 [2018-12-02 09:46:21,502 INFO L226 Difference]: Without dead ends: 112 [2018-12-02 09:46:21,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:46:21,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-02 09:46:21,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2018-12-02 09:46:21,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-02 09:46:21,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2018-12-02 09:46:21,505 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 29 [2018-12-02 09:46:21,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:46:21,505 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2018-12-02 09:46:21,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:46:21,505 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2018-12-02 09:46:21,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 09:46:21,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:46:21,505 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:46:21,506 INFO L423 AbstractCegarLoop]: === Iteration 12 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:46:21,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:46:21,506 INFO L82 PathProgramCache]: Analyzing trace with hash -2125002151, now seen corresponding path program 1 times [2018-12-02 09:46:21,506 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:46:21,506 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:46:21,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:46:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:46:21,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:46:21,573 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 09:46:21,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:46:21,603 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 09:46:21,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:46:21,605 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:46:21,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:46:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:46:21,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:46:21,627 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 09:46:21,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:46:21,649 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 09:46:21,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 09:46:21,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4] total 4 [2018-12-02 09:46:21,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:46:21,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:46:21,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:46:21,664 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand 5 states. [2018-12-02 09:46:21,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:46:21,702 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2018-12-02 09:46:21,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:46:21,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-12-02 09:46:21,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:46:21,703 INFO L225 Difference]: With dead ends: 105 [2018-12-02 09:46:21,703 INFO L226 Difference]: Without dead ends: 105 [2018-12-02 09:46:21,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:46:21,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-02 09:46:21,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-02 09:46:21,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-02 09:46:21,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2018-12-02 09:46:21,707 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 29 [2018-12-02 09:46:21,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:46:21,707 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2018-12-02 09:46:21,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:46:21,707 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2018-12-02 09:46:21,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 09:46:21,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:46:21,708 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:46:21,708 INFO L423 AbstractCegarLoop]: === Iteration 13 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:46:21,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:46:21,708 INFO L82 PathProgramCache]: Analyzing trace with hash 2141336047, now seen corresponding path program 1 times [2018-12-02 09:46:21,709 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:46:21,709 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:46:21,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:46:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:46:21,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:46:21,794 INFO L478 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 [2018-12-02 09:46:21,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:21,803 INFO L478 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 [2018-12-02 09:46:21,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:21,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:46:21,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 09:46:22,664 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 09:46:22,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:46:22,671 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 09:46:22,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:22,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:46:22,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:46:22,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 09:46:22,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:22,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:46:22,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:11 [2018-12-02 09:46:22,709 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2018-12-02 09:46:22,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:46:22,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:46:22,847 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:46:22,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:46:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:46:22,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:46:22,873 INFO L478 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 [2018-12-02 09:46:22,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:22,884 INFO L478 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 [2018-12-02 09:46:22,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:22,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:46:22,890 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 09:46:22,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:46:22,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:46:22,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 09:46:22,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:22,923 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 09:46:22,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:22,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:46:22,933 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:9 [2018-12-02 09:46:22,935 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2018-12-02 09:46:22,935 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:46:23,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 09:46:23,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-12-02 09:46:23,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 09:46:23,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 09:46:23,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2018-12-02 09:46:23,030 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 9 states. [2018-12-02 09:46:23,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:46:23,594 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2018-12-02 09:46:23,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 09:46:23,594 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-12-02 09:46:23,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:46:23,595 INFO L225 Difference]: With dead ends: 140 [2018-12-02 09:46:23,595 INFO L226 Difference]: Without dead ends: 140 [2018-12-02 09:46:23,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=31, Invalid=104, Unknown=1, NotChecked=20, Total=156 [2018-12-02 09:46:23,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-02 09:46:23,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 104. [2018-12-02 09:46:23,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-02 09:46:23,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2018-12-02 09:46:23,598 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 29 [2018-12-02 09:46:23,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:46:23,599 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2018-12-02 09:46:23,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 09:46:23,599 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2018-12-02 09:46:23,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 09:46:23,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:46:23,599 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:46:23,600 INFO L423 AbstractCegarLoop]: === Iteration 14 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:46:23,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:46:23,600 INFO L82 PathProgramCache]: Analyzing trace with hash -606993372, now seen corresponding path program 1 times [2018-12-02 09:46:23,600 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:46:23,600 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:46:23,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:46:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:46:23,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:46:25,683 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-02 09:46:25,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:46:25,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:46:25,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-02 09:46:25,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:25,695 INFO L267 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. [2018-12-02 09:46:25,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-12-02 09:46:25,730 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 09:46:25,730 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 09:46:25,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:46:25,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 09:46:25,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 09:46:25,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 09:46:25,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2018-12-02 09:46:25,732 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 8 states. [2018-12-02 09:46:26,539 WARN L180 SmtUtils]: Spent 703.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2018-12-02 09:46:26,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:46:26,787 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2018-12-02 09:46:26,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 09:46:26,788 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-12-02 09:46:26,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:46:26,788 INFO L225 Difference]: With dead ends: 127 [2018-12-02 09:46:26,788 INFO L226 Difference]: Without dead ends: 127 [2018-12-02 09:46:26,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=24, Invalid=51, Unknown=1, NotChecked=14, Total=90 [2018-12-02 09:46:26,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-02 09:46:26,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 103. [2018-12-02 09:46:26,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-02 09:46:26,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2018-12-02 09:46:26,792 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 32 [2018-12-02 09:46:26,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:46:26,792 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2018-12-02 09:46:26,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 09:46:26,792 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2018-12-02 09:46:26,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 09:46:26,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:46:26,793 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:46:26,793 INFO L423 AbstractCegarLoop]: === Iteration 15 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:46:26,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:46:26,794 INFO L82 PathProgramCache]: Analyzing trace with hash -606993371, now seen corresponding path program 1 times [2018-12-02 09:46:26,794 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:46:26,794 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:46:26,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:46:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:46:26,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:46:26,891 INFO L478 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 [2018-12-02 09:46:26,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:26,901 INFO L478 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 [2018-12-02 09:46:26,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:26,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:46:26,912 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 09:46:27,877 WARN L180 SmtUtils]: Spent 916.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-02 09:46:27,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:46:27,885 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 09:46:27,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:27,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:46:27,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:46:27,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 09:46:27,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:27,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:46:27,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:15 [2018-12-02 09:46:28,640 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 09:46:28,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:46:28,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:46:28,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 09:46:28,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:28,658 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 09:46:28,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:28,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:46:28,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:9 [2018-12-02 09:46:28,701 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2018-12-02 09:46:28,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:46:28,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:46:28,969 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:46:28,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:46:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:46:29,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:46:29,002 INFO L478 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 [2018-12-02 09:46:29,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:29,013 INFO L478 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 [2018-12-02 09:46:29,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:29,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:46:29,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 09:46:29,818 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-02 09:46:29,822 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:46:29,824 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 09:46:29,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:29,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:46:29,841 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:46:29,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-02 09:46:29,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:29,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:46:29,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:27 [2018-12-02 09:46:29,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:46:29,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 09:46:29,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:29,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:46:29,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:46:29,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:46:29,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 09:46:29,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:29,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:46:29,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:36, output treesize:11 [2018-12-02 09:46:29,980 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2018-12-02 09:46:29,980 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:46:30,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 09:46:30,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2018-12-02 09:46:30,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 09:46:30,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 09:46:30,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=231, Unknown=2, NotChecked=62, Total=342 [2018-12-02 09:46:30,104 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand 15 states. [2018-12-02 09:46:34,060 WARN L180 SmtUtils]: Spent 3.84 s on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2018-12-02 09:46:37,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:46:37,469 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2018-12-02 09:46:37,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 09:46:37,469 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2018-12-02 09:46:37,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:46:37,470 INFO L225 Difference]: With dead ends: 140 [2018-12-02 09:46:37,470 INFO L226 Difference]: Without dead ends: 140 [2018-12-02 09:46:37,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=84, Invalid=428, Unknown=2, NotChecked=86, Total=600 [2018-12-02 09:46:37,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-02 09:46:37,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 102. [2018-12-02 09:46:37,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-02 09:46:37,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2018-12-02 09:46:37,473 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 32 [2018-12-02 09:46:37,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:46:37,473 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2018-12-02 09:46:37,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 09:46:37,473 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2018-12-02 09:46:37,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 09:46:37,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:46:37,473 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-12-02 09:46:37,473 INFO L423 AbstractCegarLoop]: === Iteration 16 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:46:37,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:46:37,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1879002710, now seen corresponding path program 1 times [2018-12-02 09:46:37,474 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:46:37,474 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:46:37,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:46:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:46:37,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:46:37,545 INFO L478 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 [2018-12-02 09:46:37,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:37,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:46:37,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 09:46:37,568 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:46:37,569 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:46:37,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 09:46:37,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:37,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:46:37,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:4 [2018-12-02 09:46:37,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:46:37,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-12-02 09:46:37,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:37,624 INFO L267 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. [2018-12-02 09:46:37,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:13 [2018-12-02 09:46:37,639 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 09:46:37,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:46:37,680 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 09:46:37,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:37,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:46:37,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:4 [2018-12-02 09:46:37,745 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 4 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 09:46:37,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:46:37,747 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:46:37,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:46:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:46:37,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:46:37,770 INFO L478 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 [2018-12-02 09:46:37,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:37,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:46:37,772 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 09:46:37,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:46:37,777 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:46:37,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 09:46:37,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:37,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:46:37,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-12-02 09:46:37,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:46:37,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-12-02 09:46:37,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:37,800 INFO L267 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. [2018-12-02 09:46:37,800 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:13 [2018-12-02 09:46:37,801 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 09:46:37,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:46:37,841 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 09:46:37,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:37,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:46:37,848 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:4 [2018-12-02 09:46:37,910 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 4 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 09:46:37,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 09:46:37,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10, 9] total 11 [2018-12-02 09:46:37,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 09:46:37,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 09:46:37,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=101, Unknown=6, NotChecked=0, Total=132 [2018-12-02 09:46:37,926 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 12 states. [2018-12-02 09:46:46,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:46:46,780 INFO L93 Difference]: Finished difference Result 128 states and 142 transitions. [2018-12-02 09:46:46,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 09:46:46,781 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-12-02 09:46:46,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:46:46,782 INFO L225 Difference]: With dead ends: 128 [2018-12-02 09:46:46,782 INFO L226 Difference]: Without dead ends: 128 [2018-12-02 09:46:46,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 104 SyntacticMatches, 13 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=255, Unknown=25, NotChecked=0, Total=342 [2018-12-02 09:46:46,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-02 09:46:46,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 104. [2018-12-02 09:46:46,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-02 09:46:46,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2018-12-02 09:46:46,786 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 32 [2018-12-02 09:46:46,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:46:46,787 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2018-12-02 09:46:46,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 09:46:46,787 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2018-12-02 09:46:46,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 09:46:46,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:46:46,788 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-12-02 09:46:46,788 INFO L423 AbstractCegarLoop]: === Iteration 17 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:46:46,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:46:46,788 INFO L82 PathProgramCache]: Analyzing trace with hash 794921029, now seen corresponding path program 1 times [2018-12-02 09:46:46,789 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:46:46,789 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:46:46,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:46:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:46:46,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:46:46,888 INFO L478 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 [2018-12-02 09:46:46,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:46,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:46:46,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 09:46:46,928 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:46:46,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:46:46,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 09:46:46,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:46,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:46:46,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-12-02 09:46:46,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 09:46:46,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:46,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 09:46:46,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 09:46:46,972 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:46,975 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:46:46,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:46:46,982 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:24, output treesize:15 [2018-12-02 09:46:49,005 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_entry_point_~c11~0.base_BEFORE_CALL_26 (_ BitVec 32))) (not (= v_entry_point_~c11~0.base_BEFORE_CALL_26 (select (select |c_#memory_$Pointer$.base| v_entry_point_~c11~0.base_BEFORE_CALL_26) (_ bv0 32))))) is different from true [2018-12-02 09:46:49,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-12-02 09:46:49,043 INFO L478 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 12 treesize of output 11 [2018-12-02 09:46:49,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:49,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:46:49,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:46:49,060 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:21 [2018-12-02 09:46:49,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-12-02 09:46:49,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-12-02 09:46:49,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:49,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:46:49,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:46:49,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:7 [2018-12-02 09:46:49,194 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-12-02 09:46:49,194 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:46:49,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-12-02 09:46:49,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:49,313 INFO L267 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. [2018-12-02 09:46:49,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:15 [2018-12-02 09:46:49,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:46:49,400 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:46:49,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:46:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:46:49,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:46:49,430 INFO L478 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 [2018-12-02 09:46:49,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:49,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:46:49,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 09:46:49,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:46:49,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:46:49,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 09:46:49,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:49,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:46:49,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:4 [2018-12-02 09:46:49,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 09:46:49,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 09:46:49,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:49,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:46:49,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:46:49,566 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-12-02 09:46:51,618 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_entry_point_~c11~0.base_BEFORE_CALL_29 (_ BitVec 32)) (v_entry_point_~c11~0.offset_BEFORE_CALL_16 (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.base| v_entry_point_~c11~0.base_BEFORE_CALL_29) v_entry_point_~c11~0.offset_BEFORE_CALL_16) v_entry_point_~c11~0.base_BEFORE_CALL_29))) is different from true [2018-12-02 09:46:51,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-12-02 09:46:51,692 INFO L478 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 12 treesize of output 11 [2018-12-02 09:46:51,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:51,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:46:51,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:46:51,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:18 [2018-12-02 09:46:51,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-12-02 09:46:51,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-12-02 09:46:51,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:51,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:46:51,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:46:51,841 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:7 [2018-12-02 09:46:51,843 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-12-02 09:46:51,843 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:46:51,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-12-02 09:46:51,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:46:51,887 INFO L267 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. [2018-12-02 09:46:51,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:15 [2018-12-02 09:46:51,988 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 09:46:52,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 09:46:52,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 29 [2018-12-02 09:46:52,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-02 09:46:52,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-02 09:46:52,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=720, Unknown=18, NotChecked=110, Total=930 [2018-12-02 09:46:52,004 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 30 states. [2018-12-02 09:46:58,653 WARN L180 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 19 DAG size of output: 12 [2018-12-02 09:47:04,765 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2018-12-02 09:47:12,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:47:12,478 INFO L93 Difference]: Finished difference Result 137 states and 149 transitions. [2018-12-02 09:47:12,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-02 09:47:12,479 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 34 [2018-12-02 09:47:12,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:47:12,479 INFO L225 Difference]: With dead ends: 137 [2018-12-02 09:47:12,480 INFO L226 Difference]: Without dead ends: 137 [2018-12-02 09:47:12,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 73 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=246, Invalid=1888, Unknown=36, NotChecked=182, Total=2352 [2018-12-02 09:47:12,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-02 09:47:12,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 107. [2018-12-02 09:47:12,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-02 09:47:12,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2018-12-02 09:47:12,484 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 34 [2018-12-02 09:47:12,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:47:12,484 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2018-12-02 09:47:12,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-02 09:47:12,484 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2018-12-02 09:47:12,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 09:47:12,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:47:12,485 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-12-02 09:47:12,485 INFO L423 AbstractCegarLoop]: === Iteration 18 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:47:12,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:47:12,485 INFO L82 PathProgramCache]: Analyzing trace with hash 794921030, now seen corresponding path program 1 times [2018-12-02 09:47:12,485 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:47:12,486 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/cvc4 Starting monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:47:12,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:47:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:47:12,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:47:12,589 INFO L478 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 [2018-12-02 09:47:12,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:47:12,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:47:12,594 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 09:47:12,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:47:12,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:47:12,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 09:47:12,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:47:12,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:47:12,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2018-12-02 09:47:12,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 09:47:12,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 09:47:12,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:47:12,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:47:12,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 09:47:12,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 09:47:12,697 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:47:12,700 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:47:12,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:47:12,709 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2018-12-02 09:47:12,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-12-02 09:47:12,806 INFO L478 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 12 treesize of output 11 [2018-12-02 09:47:12,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:47:12,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:47:12,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-12-02 09:47:12,849 INFO L478 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 12 treesize of output 11 [2018-12-02 09:47:12,849 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:47:12,861 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:47:12,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:47:12,878 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:66, output treesize:28 [2018-12-02 09:47:12,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2018-12-02 09:47:12,995 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 09:47:12,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:47:12,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:47:13,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 19 [2018-12-02 09:47:13,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-12-02 09:47:13,011 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:47:13,016 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:47:13,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:47:13,022 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:9 [2018-12-02 09:47:13,080 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:47:13,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:47:13,461 INFO L478 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 40 treesize of output 44 [2018-12-02 09:47:13,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-02 09:47:13,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-12-02 09:47:13,589 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:47:13,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2018-12-02 09:47:13,711 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:47:13,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-1 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-12-02 09:47:13,812 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:103, output treesize:122 [2018-12-02 09:47:14,644 WARN L180 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2018-12-02 09:47:14,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:47:14,651 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:47:14,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:47:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:47:14,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:47:14,684 INFO L478 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 [2018-12-02 09:47:14,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:47:14,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:47:14,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 09:47:14,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:47:14,801 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:47:14,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 09:47:14,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:47:14,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:47:14,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-12-02 09:47:14,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 09:47:14,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 09:47:14,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:47:14,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:47:14,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 09:47:14,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 09:47:14,928 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:47:14,930 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:47:14,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:47:14,939 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-12-02 09:47:15,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-12-02 09:47:15,246 INFO L478 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 12 treesize of output 11 [2018-12-02 09:47:15,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:47:15,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:47:15,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-12-02 09:47:15,291 INFO L478 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 12 treesize of output 11 [2018-12-02 09:47:15,291 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:47:15,305 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:47:15,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:47:15,323 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:25 [2018-12-02 09:47:15,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2018-12-02 09:47:15,544 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 09:47:15,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:47:15,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:47:15,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 19 [2018-12-02 09:47:15,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-12-02 09:47:15,561 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:47:15,566 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:47:15,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:47:15,573 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:9 [2018-12-02 09:47:15,575 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:47:15,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:47:15,611 INFO L478 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 50 treesize of output 54 [2018-12-02 09:47:15,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-02 09:47:15,781 INFO L478 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 34 treesize of output 32 [2018-12-02 09:47:15,782 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:47:15,987 INFO L478 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 48 treesize of output 46 [2018-12-02 09:47:15,987 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:47:16,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-1 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-12-02 09:47:16,174 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:133, output treesize:162 [2018-12-02 09:47:17,052 WARN L180 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2018-12-02 09:47:17,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 09:47:17,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2018-12-02 09:47:17,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-02 09:47:17,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-02 09:47:17,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=955, Unknown=0, NotChecked=0, Total=1056 [2018-12-02 09:47:17,075 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 26 states. [2018-12-02 09:47:21,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:47:21,548 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2018-12-02 09:47:21,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 09:47:21,549 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 34 [2018-12-02 09:47:21,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:47:21,550 INFO L225 Difference]: With dead ends: 136 [2018-12-02 09:47:21,550 INFO L226 Difference]: Without dead ends: 136 [2018-12-02 09:47:21,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=198, Invalid=1524, Unknown=0, NotChecked=0, Total=1722 [2018-12-02 09:47:21,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-02 09:47:21,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 106. [2018-12-02 09:47:21,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-02 09:47:21,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2018-12-02 09:47:21,554 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 34 [2018-12-02 09:47:21,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:47:21,555 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2018-12-02 09:47:21,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-02 09:47:21,555 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2018-12-02 09:47:21,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 09:47:21,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:47:21,556 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-12-02 09:47:21,556 INFO L423 AbstractCegarLoop]: === Iteration 19 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:47:21,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:47:21,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1061111753, now seen corresponding path program 1 times [2018-12-02 09:47:21,556 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:47:21,557 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/cvc4 Starting monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:47:21,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:47:21,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:47:21,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:47:21,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-12-02 09:47:21,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:47:21,671 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 15 [2018-12-02 09:47:21,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 09:47:21,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 09:47:21,678 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2018-12-02 09:47:21,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:47:21,680 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2018-12-02 09:47:21,680 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:47:21,685 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:47:21,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 09:47:21,694 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:18, output treesize:19 [2018-12-02 09:47:28,581 WARN L180 SmtUtils]: Spent 3.25 s on a formula simplification that was a NOOP. DAG size: 24 [2018-12-02 09:47:30,617 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 19 [2018-12-02 09:47:31,290 WARN L854 $PredicateComparison]: unable to prove that (exists ((entry_point_~c11~0.base (_ BitVec 32)) (entry_point_~cfg~1.base (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| entry_point_~c11~0.base (_ bv1 1)))) (let ((.cse1 (store .cse0 entry_point_~cfg~1.base (_ bv0 1)))) (and (not (= (_ bv0 32) entry_point_~c11~0.base)) (= (_ bv0 1) (select |c_old(#valid)| entry_point_~c11~0.base)) (= (select .cse0 entry_point_~cfg~1.base) (_ bv0 1)) (= |c_#valid| (store .cse1 entry_point_~c11~0.base (_ bv0 1))) (= (_ bv1 1) (select .cse1 entry_point_~c11~0.base)))))) is different from true [2018-12-02 09:47:31,349 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 09:47:31,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:47:31,535 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2018-12-02 09:47:33,000 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_entry_point_~cfg~1.base_31 (_ BitVec 32)) (v_entry_point_~c11~0.base_28 (_ BitVec 32))) (let ((.cse0 (store |c_#valid| v_entry_point_~c11~0.base_28 (_ bv1 1)))) (or (= |c_old(#valid)| (store (store .cse0 v_entry_point_~cfg~1.base_31 (_ bv0 1)) v_entry_point_~c11~0.base_28 (_ bv0 1))) (not (= (select .cse0 v_entry_point_~cfg~1.base_31) (_ bv0 1))) (= v_entry_point_~c11~0.base_28 (_ bv0 32)) (not (= (select |c_#valid| v_entry_point_~c11~0.base_28) (_ bv0 1)))))) is different from false [2018-12-02 09:47:33,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:47:33,003 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:47:33,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:47:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:47:33,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:47:40,825 WARN L180 SmtUtils]: Spent 929.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-02 09:47:41,892 WARN L854 $PredicateComparison]: unable to prove that (exists ((entry_point_~c11~0.base (_ BitVec 32)) (entry_point_~cfg~1.base (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| entry_point_~c11~0.base (_ bv1 1)))) (and (= (_ bv0 1) (select |c_old(#valid)| entry_point_~c11~0.base)) (= (select .cse0 entry_point_~cfg~1.base) (_ bv0 1)) (= |c_#valid| (store (store .cse0 entry_point_~cfg~1.base (_ bv0 1)) entry_point_~c11~0.base (_ bv0 1)))))) is different from true [2018-12-02 09:47:41,897 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 09:47:41,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:47:44,030 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_entry_point_~cfg~1.base_34 (_ BitVec 32)) (v_entry_point_~c11~0.base_31 (_ BitVec 32))) (let ((.cse0 (store |c_#valid| v_entry_point_~c11~0.base_31 (_ bv1 1)))) (or (= (store (store .cse0 v_entry_point_~cfg~1.base_34 (_ bv0 1)) v_entry_point_~c11~0.base_31 (_ bv0 1)) |c_old(#valid)|) (not (= (select |c_#valid| v_entry_point_~c11~0.base_31) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 v_entry_point_~cfg~1.base_34)))))) is different from false [2018-12-02 09:47:44,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 09:47:44,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 18 [2018-12-02 09:47:44,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 09:47:44,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 09:47:44,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=209, Unknown=13, NotChecked=132, Total=420 [2018-12-02 09:47:44,047 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand 19 states. [2018-12-02 09:48:19,716 WARN L180 SmtUtils]: Spent 2.63 s on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-12-02 09:48:34,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:48:34,249 INFO L93 Difference]: Finished difference Result 145 states and 158 transitions. [2018-12-02 09:48:34,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 09:48:34,249 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2018-12-02 09:48:34,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:48:34,250 INFO L225 Difference]: With dead ends: 145 [2018-12-02 09:48:34,250 INFO L226 Difference]: Without dead ends: 136 [2018-12-02 09:48:34,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 24.6s TimeCoverageRelationStatistics Valid=70, Invalid=239, Unknown=13, NotChecked=140, Total=462 [2018-12-02 09:48:34,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-02 09:48:34,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 102. [2018-12-02 09:48:34,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-02 09:48:34,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2018-12-02 09:48:34,253 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 35 [2018-12-02 09:48:34,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:48:34,253 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2018-12-02 09:48:34,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 09:48:34,253 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2018-12-02 09:48:34,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 09:48:34,254 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:48:34,254 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-12-02 09:48:34,254 INFO L423 AbstractCegarLoop]: === Iteration 20 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:48:34,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:48:34,254 INFO L82 PathProgramCache]: Analyzing trace with hash 932029034, now seen corresponding path program 1 times [2018-12-02 09:48:34,255 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:48:34,255 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/cvc4 Starting monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:48:34,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:48:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:48:34,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:48:34,302 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 09:48:34,302 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 09:48:34,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:48:34,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:48:34,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:48:34,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:48:34,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:48:34,304 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 5 states. [2018-12-02 09:48:34,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:48:34,323 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2018-12-02 09:48:34,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:48:34,324 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-12-02 09:48:34,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:48:34,324 INFO L225 Difference]: With dead ends: 100 [2018-12-02 09:48:34,324 INFO L226 Difference]: Without dead ends: 100 [2018-12-02 09:48:34,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:48:34,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-02 09:48:34,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2018-12-02 09:48:34,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-02 09:48:34,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2018-12-02 09:48:34,327 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 35 [2018-12-02 09:48:34,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:48:34,327 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2018-12-02 09:48:34,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:48:34,328 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2018-12-02 09:48:34,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-02 09:48:34,328 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:48:34,328 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2018-12-02 09:48:34,328 INFO L423 AbstractCegarLoop]: === Iteration 21 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:48:34,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:48:34,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1511879600, now seen corresponding path program 1 times [2018-12-02 09:48:34,329 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:48:34,329 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/cvc4 Starting monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:48:34,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:48:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:48:34,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:48:34,442 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 09:48:34,443 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 09:48:34,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:48:34,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:48:34,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:48:34,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:48:34,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:48:34,445 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 5 states. [2018-12-02 09:48:34,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:48:34,466 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2018-12-02 09:48:34,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:48:34,467 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-12-02 09:48:34,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:48:34,467 INFO L225 Difference]: With dead ends: 104 [2018-12-02 09:48:34,467 INFO L226 Difference]: Without dead ends: 104 [2018-12-02 09:48:34,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:48:34,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-02 09:48:34,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2018-12-02 09:48:34,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-02 09:48:34,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2018-12-02 09:48:34,470 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 43 [2018-12-02 09:48:34,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:48:34,470 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2018-12-02 09:48:34,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:48:34,470 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2018-12-02 09:48:34,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-02 09:48:34,470 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:48:34,471 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2018-12-02 09:48:34,471 INFO L423 AbstractCegarLoop]: === Iteration 22 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:48:34,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:48:34,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1483250449, now seen corresponding path program 1 times [2018-12-02 09:48:34,471 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:48:34,471 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/cvc4 Starting monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:48:34,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:48:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:48:34,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:48:34,597 INFO L478 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 [2018-12-02 09:48:34,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:48:34,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:48:34,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 09:48:34,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:48:34,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:48:34,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 09:48:34,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:48:34,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:48:34,634 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-12-02 09:48:34,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 09:48:34,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:48:34,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 09:48:34,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 09:48:34,691 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:48:34,694 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:48:34,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 09:48:34,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 09:48:34,713 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 09:48:34,716 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:48:34,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:48:34,725 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:35, output treesize:22 [2018-12-02 09:48:36,757 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_entry_point_~c11~0.base_BEFORE_CALL_44 (_ BitVec 32))) (not (= v_entry_point_~c11~0.base_BEFORE_CALL_44 (select (select |c_#memory_$Pointer$.base| v_entry_point_~c11~0.base_BEFORE_CALL_44) (_ bv0 32))))) is different from true [2018-12-02 09:48:36,760 INFO L478 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 [2018-12-02 09:48:36,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:48:36,765 INFO L267 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. [2018-12-02 09:48:36,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-02 09:48:40,792 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 16 [2018-12-02 09:48:40,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-12-02 09:48:40,902 INFO L478 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 16 treesize of output 15 [2018-12-02 09:48:40,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:48:40,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:48:40,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-12-02 09:48:40,942 INFO L478 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 16 treesize of output 15 [2018-12-02 09:48:40,942 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:48:40,952 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:48:40,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:48:40,965 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:31 [2018-12-02 09:48:41,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 21 [2018-12-02 09:48:41,076 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-12-02 09:48:41,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:48:41,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:48:41,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:48:41,088 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:29 [2018-12-02 09:48:41,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-12-02 09:48:41,187 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-02 09:48:41,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:48:41,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2018-12-02 09:48:41,192 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:48:41,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:48:41,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:48:41,195 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:33, output treesize:5 [2018-12-02 09:48:41,990 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-02 09:48:41,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:48:41,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:48:41,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-02 09:48:41,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:48:42,001 INFO L267 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. [2018-12-02 09:48:42,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-12-02 09:48:42,050 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 10 not checked. [2018-12-02 09:48:42,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:48:42,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:48:42,147 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:48:42,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:48:42,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:48:42,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:48:42,182 INFO L478 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 [2018-12-02 09:48:42,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:48:42,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:48:42,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 09:48:44,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:48:44,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:48:44,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 09:48:44,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:48:44,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:48:44,295 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:4 [2018-12-02 09:48:44,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 09:48:44,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 09:48:44,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:48:44,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:48:44,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 09:48:44,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 09:48:44,389 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:48:44,391 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:48:44,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:48:44,399 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-12-02 09:48:46,466 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_entry_point_~c11~0.base_BEFORE_CALL_47 (_ BitVec 32)) (v_entry_point_~c11~0.offset_BEFORE_CALL_29 (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.base| v_entry_point_~c11~0.base_BEFORE_CALL_47) v_entry_point_~c11~0.offset_BEFORE_CALL_29) v_entry_point_~c11~0.base_BEFORE_CALL_47))) is different from true [2018-12-02 09:48:46,469 INFO L478 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 [2018-12-02 09:48:46,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:48:46,475 INFO L267 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. [2018-12-02 09:48:46,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:14 [2018-12-02 09:48:54,548 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 16 [2018-12-02 09:48:54,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-12-02 09:48:54,751 INFO L478 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 16 treesize of output 15 [2018-12-02 09:48:54,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:48:54,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:48:54,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-12-02 09:48:54,788 INFO L478 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 16 treesize of output 15 [2018-12-02 09:48:54,788 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:48:54,797 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:48:54,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:48:54,809 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:60, output treesize:28 [2018-12-02 09:48:55,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-12-02 09:48:55,008 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-02 09:48:55,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:48:55,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:48:55,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 09:48:55,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:31 [2018-12-02 09:48:55,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-12-02 09:48:55,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2018-12-02 09:48:55,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:48:55,172 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-02 09:48:55,172 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:48:55,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:48:55,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:48:55,175 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:33, output treesize:5 [2018-12-02 09:48:55,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:48:55,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:48:55,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-02 09:48:55,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:48:55,186 INFO L267 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. [2018-12-02 09:48:55,187 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-12-02 09:48:55,190 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 10 not checked. [2018-12-02 09:48:55,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:48:55,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 09:48:55,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 37 [2018-12-02 09:48:55,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-02 09:48:55,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-02 09:48:55,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1155, Unknown=8, NotChecked=210, Total=1482 [2018-12-02 09:48:55,297 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand 38 states. [2018-12-02 09:49:03,475 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 21 [2018-12-02 09:49:12,011 WARN L180 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 19 DAG size of output: 12 [2018-12-02 09:49:18,123 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification that was a NOOP. DAG size: 28 [2018-12-02 09:49:23,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:49:23,325 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2018-12-02 09:49:23,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-02 09:49:23,326 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 43 [2018-12-02 09:49:23,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:49:23,326 INFO L225 Difference]: With dead ends: 115 [2018-12-02 09:49:23,326 INFO L226 Difference]: Without dead ends: 115 [2018-12-02 09:49:23,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 41.3s TimeCoverageRelationStatistics Valid=270, Invalid=2485, Unknown=13, NotChecked=312, Total=3080 [2018-12-02 09:49:23,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-02 09:49:23,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 101. [2018-12-02 09:49:23,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-02 09:49:23,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-12-02 09:49:23,329 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 43 [2018-12-02 09:49:23,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:49:23,329 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-12-02 09:49:23,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-02 09:49:23,329 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-12-02 09:49:23,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-02 09:49:23,329 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:49:23,329 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2018-12-02 09:49:23,330 INFO L423 AbstractCegarLoop]: === Iteration 23 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:49:23,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:49:23,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1483250450, now seen corresponding path program 1 times [2018-12-02 09:49:23,330 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:49:23,330 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/cvc4 Starting monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:49:23,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:49:23,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:49:23,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:49:23,479 INFO L478 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 [2018-12-02 09:49:23,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:49:23,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:49:23,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 09:49:23,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:49:23,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:49:23,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 09:49:23,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:49:23,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:49:23,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-12-02 09:49:23,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 09:49:23,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 09:49:23,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:49:23,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:49:23,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 09:49:23,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 09:49:23,573 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:49:23,575 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:49:23,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:49:23,584 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-12-02 09:49:25,616 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_entry_point_~c11~0.base_BEFORE_CALL_50 (_ BitVec 32))) (not (= v_entry_point_~c11~0.base_BEFORE_CALL_50 (select (select |c_#memory_$Pointer$.base| v_entry_point_~c11~0.base_BEFORE_CALL_50) (_ bv0 32))))) is different from true [2018-12-02 09:49:27,643 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 12 [2018-12-02 09:49:27,646 INFO L478 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 [2018-12-02 09:49:27,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:49:27,657 INFO L478 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 [2018-12-02 09:49:27,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:49:27,666 INFO L267 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. [2018-12-02 09:49:27,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:22 [2018-12-02 09:49:29,697 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 22 [2018-12-02 09:49:29,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2018-12-02 09:49:29,837 INFO L478 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 16 treesize of output 15 [2018-12-02 09:49:29,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:49:29,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:49:29,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2018-12-02 09:49:29,890 INFO L478 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 16 treesize of output 15 [2018-12-02 09:49:29,890 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:49:29,898 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:49:29,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:49:29,913 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:68, output treesize:65 [2018-12-02 09:49:30,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 66 [2018-12-02 09:49:30,210 INFO L478 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 58 treesize of output 48 [2018-12-02 09:49:30,211 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:49:30,225 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 09:49:30,225 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:49:30,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:49:30,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 31 [2018-12-02 09:49:30,250 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-12-02 09:49:30,251 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 09:49:30,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2018-12-02 09:49:30,258 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 09:49:30,262 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:49:30,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:49:30,266 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:88, output treesize:14 [2018-12-02 09:49:31,134 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 09:49:31,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:49:31,141 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 09:49:31,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:49:31,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:49:31,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:49:31,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 09:49:31,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:49:31,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:49:31,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:11 [2018-12-02 09:49:31,206 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2018-12-02 09:49:31,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:49:31,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:49:31,483 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:49:31,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:49:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:49:31,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:49:31,525 INFO L478 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 [2018-12-02 09:49:31,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:49:31,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:49:31,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 09:49:31,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:49:31,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:49:31,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 09:49:31,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:49:31,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:49:31,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-12-02 09:49:31,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 09:49:31,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 09:49:31,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:49:31,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:49:31,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 09:49:31,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 09:49:31,758 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:49:31,760 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:49:31,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:49:31,768 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-12-02 09:49:33,846 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_entry_point_~c11~0.offset_BEFORE_CALL_34 (_ BitVec 32)) (v_entry_point_~c11~0.base_BEFORE_CALL_53 (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.base| v_entry_point_~c11~0.base_BEFORE_CALL_53) v_entry_point_~c11~0.offset_BEFORE_CALL_34) v_entry_point_~c11~0.base_BEFORE_CALL_53))) is different from true [2018-12-02 09:49:37,931 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 12 [2018-12-02 09:49:37,935 INFO L478 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 [2018-12-02 09:49:37,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:49:37,946 INFO L478 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 [2018-12-02 09:49:37,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:49:37,956 INFO L267 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. [2018-12-02 09:49:37,956 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:22 [2018-12-02 09:49:42,036 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2018-12-02 09:49:42,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2018-12-02 09:49:42,320 INFO L478 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 16 treesize of output 15 [2018-12-02 09:49:42,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:49:42,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:49:42,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2018-12-02 09:49:42,362 INFO L478 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 16 treesize of output 15 [2018-12-02 09:49:42,362 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:49:42,370 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:49:42,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:49:42,383 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:65, output treesize:62 [2018-12-02 09:49:42,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 70 [2018-12-02 09:49:42,885 INFO L478 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 62 treesize of output 52 [2018-12-02 09:49:42,886 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:49:42,903 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 09:49:42,903 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:49:42,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:49:42,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 35 [2018-12-02 09:49:42,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2018-12-02 09:49:42,933 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 09:49:42,941 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 15 [2018-12-02 09:49:42,941 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 09:49:42,944 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:49:42,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:49:42,949 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:92, output treesize:18 [2018-12-02 09:49:42,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:49:42,956 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:49:42,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 09:49:42,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:49:42,971 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 09:49:42,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:49:42,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:49:42,980 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:11 [2018-12-02 09:49:42,983 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2018-12-02 09:49:42,983 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:49:43,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 09:49:43,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 40 [2018-12-02 09:49:43,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-02 09:49:43,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-02 09:49:43,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1440, Unknown=10, NotChecked=234, Total=1806 [2018-12-02 09:49:43,153 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 41 states. [2018-12-02 09:49:46,445 WARN L180 SmtUtils]: Spent 1.13 s on a formula simplification that was a NOOP. DAG size: 24 [2018-12-02 09:49:52,947 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 22 DAG size of output: 15 [2018-12-02 09:49:55,003 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2018-12-02 09:49:59,155 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 35 [2018-12-02 09:50:04,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:50:04,793 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2018-12-02 09:50:04,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-02 09:50:04,793 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 43 [2018-12-02 09:50:04,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:50:04,794 INFO L225 Difference]: With dead ends: 108 [2018-12-02 09:50:04,794 INFO L226 Difference]: Without dead ends: 106 [2018-12-02 09:50:04,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 35.5s TimeCoverageRelationStatistics Valid=251, Invalid=2505, Unknown=12, NotChecked=312, Total=3080 [2018-12-02 09:50:04,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-02 09:50:04,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 100. [2018-12-02 09:50:04,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-02 09:50:04,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2018-12-02 09:50:04,796 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 43 [2018-12-02 09:50:04,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:50:04,796 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2018-12-02 09:50:04,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-02 09:50:04,796 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2018-12-02 09:50:04,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 09:50:04,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:50:04,797 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:50:04,797 INFO L423 AbstractCegarLoop]: === Iteration 24 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:50:04,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:50:04,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1683743134, now seen corresponding path program 1 times [2018-12-02 09:50:04,797 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:50:04,797 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/cvc4 Starting monitored process 39 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:50:04,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:50:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:50:04,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:50:04,893 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 09:50:04,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:50:04,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:50:04,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-12-02 09:50:04,923 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 09:50:04,924 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 09:50:04,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:50:04,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 09:50:04,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 09:50:04,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 09:50:04,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 09:50:04,926 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 8 states. [2018-12-02 09:50:05,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:50:05,309 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2018-12-02 09:50:05,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 09:50:05,309 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-12-02 09:50:05,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:50:05,310 INFO L225 Difference]: With dead ends: 115 [2018-12-02 09:50:05,310 INFO L226 Difference]: Without dead ends: 115 [2018-12-02 09:50:05,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-12-02 09:50:05,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-02 09:50:05,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 109. [2018-12-02 09:50:05,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-02 09:50:05,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2018-12-02 09:50:05,312 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 47 [2018-12-02 09:50:05,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:50:05,312 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2018-12-02 09:50:05,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 09:50:05,312 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2018-12-02 09:50:05,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 09:50:05,313 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:50:05,313 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:50:05,313 INFO L423 AbstractCegarLoop]: === Iteration 25 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:50:05,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:50:05,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1683743135, now seen corresponding path program 1 times [2018-12-02 09:50:05,313 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:50:05,313 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/cvc4 Starting monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:50:05,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:50:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:50:05,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:50:05,459 INFO L478 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 [2018-12-02 09:50:05,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:50:05,467 INFO L478 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 [2018-12-02 09:50:05,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:50:05,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:50:05,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 09:50:06,395 WARN L180 SmtUtils]: Spent 873.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-02 09:50:06,400 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:50:06,402 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 09:50:06,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:50:06,417 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:50:06,418 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:50:06,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 09:50:06,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:50:06,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:50:06,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-12-02 09:50:08,434 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 09:50:08,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:50:08,441 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 09:50:08,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:50:08,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:50:08,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:50:08,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 09:50:08,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:50:08,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:50:08,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2018-12-02 09:50:08,646 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2018-12-02 09:50:08,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:50:09,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:50:09,920 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:50:09,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:50:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:50:09,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:50:09,964 INFO L478 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 [2018-12-02 09:50:09,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:50:09,972 INFO L478 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 [2018-12-02 09:50:09,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:50:09,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:50:09,979 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 09:50:11,125 WARN L180 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 16 [2018-12-02 09:50:11,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:50:11,138 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 09:50:11,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:50:11,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:50:11,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:50:11,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-02 09:50:11,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:50:11,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:50:11,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:25 [2018-12-02 09:50:11,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:50:11,294 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:50:11,295 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:50:11,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-12-02 09:50:11,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:50:11,316 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 09:50:11,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:50:11,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:50:11,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:11 [2018-12-02 09:50:11,375 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2018-12-02 09:50:11,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:50:12,771 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2018-12-02 09:50:12,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 09:50:12,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 20 [2018-12-02 09:50:12,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 09:50:12,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 09:50:12,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1015, Unknown=1, NotChecked=64, Total=1190 [2018-12-02 09:50:12,787 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand 21 states. [2018-12-02 09:50:15,428 WARN L180 SmtUtils]: Spent 2.44 s on a formula simplification. DAG size of input: 33 DAG size of output: 23 [2018-12-02 09:50:30,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:50:30,119 INFO L93 Difference]: Finished difference Result 132 states and 138 transitions. [2018-12-02 09:50:30,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 09:50:30,119 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2018-12-02 09:50:30,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:50:30,120 INFO L225 Difference]: With dead ends: 132 [2018-12-02 09:50:30,120 INFO L226 Difference]: Without dead ends: 132 [2018-12-02 09:50:30,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 100 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=177, Invalid=1548, Unknown=1, NotChecked=80, Total=1806 [2018-12-02 09:50:30,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-02 09:50:30,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 109. [2018-12-02 09:50:30,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-02 09:50:30,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2018-12-02 09:50:30,122 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 47 [2018-12-02 09:50:30,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:50:30,122 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2018-12-02 09:50:30,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 09:50:30,122 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-12-02 09:50:30,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 09:50:30,122 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:50:30,122 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:50:30,123 INFO L423 AbstractCegarLoop]: === Iteration 26 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:50:30,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:50:30,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1880256639, now seen corresponding path program 1 times [2018-12-02 09:50:30,123 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:50:30,123 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/cvc4 Starting monitored process 42 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:50:30,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:50:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:50:30,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:50:30,180 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 09:50:30,180 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 09:50:30,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:50:30,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:50:30,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:50:30,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:50:30,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:50:30,182 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand 5 states. [2018-12-02 09:50:30,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:50:30,202 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2018-12-02 09:50:30,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:50:30,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-02 09:50:30,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:50:30,203 INFO L225 Difference]: With dead ends: 110 [2018-12-02 09:50:30,203 INFO L226 Difference]: Without dead ends: 110 [2018-12-02 09:50:30,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:50:30,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-02 09:50:30,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-12-02 09:50:30,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-02 09:50:30,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2018-12-02 09:50:30,205 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 47 [2018-12-02 09:50:30,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:50:30,206 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2018-12-02 09:50:30,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:50:30,206 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2018-12-02 09:50:30,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 09:50:30,206 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:50:30,206 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:50:30,207 INFO L423 AbstractCegarLoop]: === Iteration 27 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:50:30,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:50:30,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1240788270, now seen corresponding path program 1 times [2018-12-02 09:50:30,207 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:50:30,207 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/cvc4 Starting monitored process 43 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:50:30,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:50:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:50:30,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:50:30,362 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 09:50:30,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:50:30,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:50:30,363 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-12-02 09:50:32,372 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-02 09:50:32,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:50:32,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:50:32,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-02 09:50:32,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:50:32,386 INFO L267 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. [2018-12-02 09:50:32,386 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-12-02 09:50:32,452 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 09:50:32,452 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 09:50:32,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:50:32,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 09:50:32,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 09:50:32,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 09:50:32,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=57, Unknown=1, NotChecked=14, Total=90 [2018-12-02 09:50:32,455 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 10 states. [2018-12-02 09:50:32,989 WARN L180 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-02 09:50:33,519 WARN L180 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-12-02 09:50:33,846 WARN L180 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-02 09:50:36,659 WARN L180 SmtUtils]: Spent 753.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-12-02 09:50:36,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:50:36,975 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2018-12-02 09:50:36,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 09:50:36,976 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2018-12-02 09:50:36,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:50:36,976 INFO L225 Difference]: With dead ends: 111 [2018-12-02 09:50:36,976 INFO L226 Difference]: Without dead ends: 111 [2018-12-02 09:50:36,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=42, Invalid=143, Unknown=1, NotChecked=24, Total=210 [2018-12-02 09:50:36,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-02 09:50:36,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2018-12-02 09:50:36,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-02 09:50:36,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2018-12-02 09:50:36,978 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 48 [2018-12-02 09:50:36,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:50:36,978 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2018-12-02 09:50:36,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 09:50:36,979 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2018-12-02 09:50:36,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 09:50:36,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:50:36,979 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:50:36,979 INFO L423 AbstractCegarLoop]: === Iteration 28 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:50:36,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:50:36,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1240788271, now seen corresponding path program 1 times [2018-12-02 09:50:36,979 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:50:36,980 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/cvc4 Starting monitored process 44 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:50:36,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:50:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:50:37,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:50:37,163 INFO L478 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 [2018-12-02 09:50:37,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:50:37,172 INFO L478 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 [2018-12-02 09:50:37,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:50:37,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:50:37,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 09:50:38,234 WARN L180 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 12 [2018-12-02 09:50:38,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:50:38,241 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 09:50:38,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:50:38,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:50:38,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:50:38,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 09:50:38,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:50:38,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:50:38,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:15 [2018-12-02 09:50:39,243 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 09:50:39,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:50:39,252 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 09:50:39,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:50:39,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:50:39,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:50:39,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 09:50:39,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:50:39,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:50:39,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2018-12-02 09:50:39,339 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:50:39,340 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 09:50:39,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:50:39,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:50:39,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:50:39,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 09:50:39,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:50:39,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:50:39,363 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-12-02 09:50:39,461 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 8 not checked. [2018-12-02 09:50:39,461 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:50:40,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:50:40,139 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:50:40,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:50:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:50:40,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:50:40,190 INFO L478 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 [2018-12-02 09:50:40,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:50:40,202 INFO L478 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 [2018-12-02 09:50:40,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:50:40,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:50:40,212 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 09:50:41,179 WARN L180 SmtUtils]: Spent 908.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-02 09:50:41,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:50:41,188 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 09:50:41,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:50:41,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:50:41,207 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:50:41,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-02 09:50:41,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:50:41,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:50:41,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:27 [2018-12-02 09:50:41,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:50:41,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 09:50:41,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:50:41,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:50:41,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:50:41,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:50:41,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-12-02 09:50:41,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:50:41,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:50:41,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:11 [2018-12-02 09:50:41,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:50:41,429 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 09:50:41,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:50:41,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:50:41,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:50:41,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 09:50:41,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:50:41,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:50:41,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:9 [2018-12-02 09:50:41,455 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 8 not checked. [2018-12-02 09:50:41,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:50:41,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 09:50:41,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 20 [2018-12-02 09:50:41,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 09:50:41,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 09:50:41,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=585, Unknown=1, NotChecked=48, Total=702 [2018-12-02 09:50:41,676 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand 21 states. [2018-12-02 09:50:44,104 WARN L180 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 33 DAG size of output: 23 [2018-12-02 09:51:05,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:51:05,610 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2018-12-02 09:51:05,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 09:51:05,611 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 48 [2018-12-02 09:51:05,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:51:05,611 INFO L225 Difference]: With dead ends: 128 [2018-12-02 09:51:05,611 INFO L226 Difference]: Without dead ends: 128 [2018-12-02 09:51:05,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=125, Invalid=1068, Unknown=1, NotChecked=66, Total=1260 [2018-12-02 09:51:05,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-02 09:51:05,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 106. [2018-12-02 09:51:05,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-02 09:51:05,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2018-12-02 09:51:05,613 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 48 [2018-12-02 09:51:05,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:51:05,613 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2018-12-02 09:51:05,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 09:51:05,613 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2018-12-02 09:51:05,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 09:51:05,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:51:05,614 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:51:05,614 INFO L423 AbstractCegarLoop]: === Iteration 29 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:51:05,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:51:05,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1959437562, now seen corresponding path program 1 times [2018-12-02 09:51:05,614 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:51:05,614 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/cvc4 Starting monitored process 46 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:51:05,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:51:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:51:05,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:51:05,681 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 09:51:05,681 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 09:51:05,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:51:05,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 09:51:05,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:51:05,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:51:05,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:51:05,684 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand 5 states. [2018-12-02 09:51:05,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:51:05,708 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2018-12-02 09:51:05,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:51:05,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-02 09:51:05,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:51:05,709 INFO L225 Difference]: With dead ends: 105 [2018-12-02 09:51:05,709 INFO L226 Difference]: Without dead ends: 105 [2018-12-02 09:51:05,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:51:05,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-02 09:51:05,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-02 09:51:05,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-02 09:51:05,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2018-12-02 09:51:05,711 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 53 [2018-12-02 09:51:05,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:51:05,712 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2018-12-02 09:51:05,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:51:05,712 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2018-12-02 09:51:05,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 09:51:05,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:51:05,712 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:51:05,713 INFO L423 AbstractCegarLoop]: === Iteration 30 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:51:05,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:51:05,713 INFO L82 PathProgramCache]: Analyzing trace with hash -613022222, now seen corresponding path program 1 times [2018-12-02 09:51:05,713 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:51:05,713 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/cvc4 Starting monitored process 47 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:51:05,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:51:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:51:05,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:51:05,839 INFO L478 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 [2018-12-02 09:51:05,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:51:05,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:51:05,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 09:51:05,866 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 09:51:05,867 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 09:51:05,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:51:05,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:51:05,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 09:51:05,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 09:51:05,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:51:05,870 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 6 states. [2018-12-02 09:51:06,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:51:06,118 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2018-12-02 09:51:06,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 09:51:06,118 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-02 09:51:06,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:51:06,119 INFO L225 Difference]: With dead ends: 122 [2018-12-02 09:51:06,119 INFO L226 Difference]: Without dead ends: 122 [2018-12-02 09:51:06,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:51:06,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-02 09:51:06,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 104. [2018-12-02 09:51:06,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-02 09:51:06,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2018-12-02 09:51:06,121 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 54 [2018-12-02 09:51:06,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:51:06,121 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2018-12-02 09:51:06,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 09:51:06,121 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2018-12-02 09:51:06,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 09:51:06,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:51:06,121 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:51:06,122 INFO L423 AbstractCegarLoop]: === Iteration 31 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:51:06,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:51:06,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1858618114, now seen corresponding path program 1 times [2018-12-02 09:51:06,122 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:51:06,122 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/cvc4 Starting monitored process 48 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:51:06,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:51:06,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:51:06,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:51:06,245 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 09:51:06,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:51:06,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:51:06,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-12-02 09:51:06,331 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 09:51:06,331 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 09:51:06,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:51:06,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 09:51:06,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 09:51:06,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 09:51:06,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-12-02 09:51:06,333 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 13 states. [2018-12-02 09:51:07,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:51:07,101 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2018-12-02 09:51:07,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 09:51:07,102 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-12-02 09:51:07,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:51:07,103 INFO L225 Difference]: With dead ends: 139 [2018-12-02 09:51:07,103 INFO L226 Difference]: Without dead ends: 139 [2018-12-02 09:51:07,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2018-12-02 09:51:07,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-02 09:51:07,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 126. [2018-12-02 09:51:07,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-02 09:51:07,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2018-12-02 09:51:07,105 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 62 [2018-12-02 09:51:07,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:51:07,106 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2018-12-02 09:51:07,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 09:51:07,106 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2018-12-02 09:51:07,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 09:51:07,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:51:07,106 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:51:07,107 INFO L423 AbstractCegarLoop]: === Iteration 32 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:51:07,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:51:07,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1858618113, now seen corresponding path program 1 times [2018-12-02 09:51:07,107 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:51:07,107 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/cvc4 Starting monitored process 49 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:51:07,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:51:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:51:07,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:51:07,637 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 09:51:07,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:51:08,500 INFO L478 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 16 treesize of output 14 [2018-12-02 09:51:08,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:51:08,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-12-02 09:51:08,519 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:51:08,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 09:51:08,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:27 [2018-12-02 09:51:10,307 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2018-12-02 09:51:10,584 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 09:51:10,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:51:10,587 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:51:10,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:51:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:51:10,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:51:11,966 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 09:51:11,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:51:12,242 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-02 09:51:12,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:51:12,274 INFO L478 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 8 treesize of output 6 [2018-12-02 09:51:12,275 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:51:12,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:51:12,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:67, output treesize:14 [2018-12-02 09:51:16,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 44 [2018-12-02 09:51:16,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-02 09:51:16,218 INFO L478 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 32 treesize of output 28 [2018-12-02 09:51:16,218 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:51:16,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-02 09:51:16,308 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:96 [2018-12-02 09:51:16,870 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 31 [2018-12-02 09:51:17,307 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 09:51:17,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 09:51:17,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 20, 19] total 48 [2018-12-02 09:51:17,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-02 09:51:17,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-02 09:51:17,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2173, Unknown=2, NotChecked=0, Total=2352 [2018-12-02 09:51:17,323 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. Second operand 49 states. [2018-12-02 09:51:23,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:51:23,919 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2018-12-02 09:51:23,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-02 09:51:23,921 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 62 [2018-12-02 09:51:23,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:51:23,921 INFO L225 Difference]: With dead ends: 127 [2018-12-02 09:51:23,921 INFO L226 Difference]: Without dead ends: 127 [2018-12-02 09:51:23,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 193 SyntacticMatches, 9 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=385, Invalid=4169, Unknown=2, NotChecked=0, Total=4556 [2018-12-02 09:51:23,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-02 09:51:23,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2018-12-02 09:51:23,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-12-02 09:51:23,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2018-12-02 09:51:23,924 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 62 [2018-12-02 09:51:23,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:51:23,924 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2018-12-02 09:51:23,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-02 09:51:23,924 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-12-02 09:51:23,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 09:51:23,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:51:23,924 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:51:23,924 INFO L423 AbstractCegarLoop]: === Iteration 33 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:51:23,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:51:23,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1947796072, now seen corresponding path program 1 times [2018-12-02 09:51:23,925 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:51:23,925 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/cvc4 Starting monitored process 51 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:51:23,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:51:24,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:51:24,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:51:24,100 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 09:51:24,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:51:24,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:51:24,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-12-02 09:51:24,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:51:24,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:51:24,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-02 09:51:24,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:51:24,227 INFO L267 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. [2018-12-02 09:51:24,228 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:23 [2018-12-02 09:51:24,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:51:24,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:51:24,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 09:51:24,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:51:24,268 INFO L267 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. [2018-12-02 09:51:24,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2018-12-02 09:51:24,569 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 09:51:24,569 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 09:51:24,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:51:24,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-12-02 09:51:24,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 09:51:24,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 09:51:24,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2018-12-02 09:51:24,573 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 21 states. [2018-12-02 09:51:28,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:51:28,665 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2018-12-02 09:51:28,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-02 09:51:28,666 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-12-02 09:51:28,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:51:28,666 INFO L225 Difference]: With dead ends: 132 [2018-12-02 09:51:28,666 INFO L226 Difference]: Without dead ends: 132 [2018-12-02 09:51:28,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=1078, Unknown=0, NotChecked=0, Total=1190 [2018-12-02 09:51:28,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-02 09:51:28,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 102. [2018-12-02 09:51:28,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-02 09:51:28,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2018-12-02 09:51:28,668 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 104 transitions. Word has length 64 [2018-12-02 09:51:28,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:51:28,668 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 104 transitions. [2018-12-02 09:51:28,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 09:51:28,669 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2018-12-02 09:51:28,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 09:51:28,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:51:28,669 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2018-12-02 09:51:28,669 INFO L423 AbstractCegarLoop]: === Iteration 34 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:51:28,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:51:28,669 INFO L82 PathProgramCache]: Analyzing trace with hash -574918422, now seen corresponding path program 1 times [2018-12-02 09:51:28,669 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:51:28,670 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/cvc4 Starting monitored process 52 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:51:28,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:51:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:51:28,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:51:28,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 09:51:28,863 INFO L478 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 10 treesize of output 9 [2018-12-02 09:51:28,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:51:28,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:51:28,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:51:28,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-02 09:51:29,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 24 [2018-12-02 09:51:29,423 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 09:51:29,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:51:29,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:51:29,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:51:29,429 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2018-12-02 09:51:29,492 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 09:51:29,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:51:30,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2018-12-02 09:51:30,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2018-12-02 09:51:30,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:51:30,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:51:30,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 09:51:30,970 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:7 [2018-12-02 09:51:31,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2018-12-02 09:51:31,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2018-12-02 09:51:31,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:51:31,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:51:31,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 09:51:31,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:25 [2018-12-02 09:51:31,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2018-12-02 09:51:31,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2018-12-02 09:51:31,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:51:31,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:51:31,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 09:51:31,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:25 [2018-12-02 09:51:31,488 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-02 09:51:31,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 09:51:31,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [22] total 35 [2018-12-02 09:51:31,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-02 09:51:31,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-02 09:51:31,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1168, Unknown=0, NotChecked=0, Total=1260 [2018-12-02 09:51:31,491 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. Second operand 36 states. [2018-12-02 09:51:34,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:51:34,866 INFO L93 Difference]: Finished difference Result 139 states and 141 transitions. [2018-12-02 09:51:34,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-02 09:51:34,867 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 71 [2018-12-02 09:51:34,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:51:34,867 INFO L225 Difference]: With dead ends: 139 [2018-12-02 09:51:34,867 INFO L226 Difference]: Without dead ends: 139 [2018-12-02 09:51:34,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=194, Invalid=2562, Unknown=0, NotChecked=0, Total=2756 [2018-12-02 09:51:34,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-02 09:51:34,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 124. [2018-12-02 09:51:34,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-02 09:51:34,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 128 transitions. [2018-12-02 09:51:34,870 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 128 transitions. Word has length 71 [2018-12-02 09:51:34,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:51:34,870 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 128 transitions. [2018-12-02 09:51:34,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-02 09:51:34,870 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2018-12-02 09:51:34,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 09:51:34,870 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:51:34,870 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2018-12-02 09:51:34,870 INFO L423 AbstractCegarLoop]: === Iteration 35 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:51:34,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:51:34,871 INFO L82 PathProgramCache]: Analyzing trace with hash -642601829, now seen corresponding path program 1 times [2018-12-02 09:51:34,871 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:51:34,871 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/cvc4 Starting monitored process 53 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:51:34,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:51:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:51:34,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:51:35,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 09:51:35,054 INFO L478 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 10 treesize of output 9 [2018-12-02 09:51:35,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:51:35,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:51:35,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:51:35,060 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-02 09:51:35,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 24 [2018-12-02 09:51:35,687 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 09:51:35,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:51:35,698 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 09:51:35,698 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:51:35,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:51:35,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:51:35,703 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2018-12-02 09:51:35,795 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 09:51:35,795 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:51:37,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2018-12-02 09:51:37,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2018-12-02 09:51:37,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:51:37,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:51:37,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 09:51:37,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:7 [2018-12-02 09:51:37,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2018-12-02 09:51:37,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2018-12-02 09:51:37,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:51:37,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:51:37,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 09:51:37,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:25 [2018-12-02 09:51:37,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2018-12-02 09:51:37,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2018-12-02 09:51:37,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:51:37,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:51:37,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 09:51:37,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:25 [2018-12-02 09:51:37,834 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-02 09:51:37,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 09:51:37,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [24] total 37 [2018-12-02 09:51:37,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-02 09:51:37,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-02 09:51:37,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1238, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 09:51:37,837 INFO L87 Difference]: Start difference. First operand 124 states and 128 transitions. Second operand 37 states. [2018-12-02 09:51:40,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:51:40,635 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2018-12-02 09:51:40,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-02 09:51:40,635 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-12-02 09:51:40,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:51:40,636 INFO L225 Difference]: With dead ends: 139 [2018-12-02 09:51:40,636 INFO L226 Difference]: Without dead ends: 138 [2018-12-02 09:51:40,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=194, Invalid=2458, Unknown=0, NotChecked=0, Total=2652 [2018-12-02 09:51:40,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-02 09:51:40,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 122. [2018-12-02 09:51:40,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-02 09:51:40,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2018-12-02 09:51:40,638 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 72 [2018-12-02 09:51:40,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:51:40,638 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2018-12-02 09:51:40,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-02 09:51:40,638 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2018-12-02 09:51:40,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 09:51:40,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:51:40,639 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2018-12-02 09:51:40,639 INFO L423 AbstractCegarLoop]: === Iteration 36 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:51:40,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:51:40,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1554367744, now seen corresponding path program 1 times [2018-12-02 09:51:40,639 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:51:40,639 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/cvc4 Starting monitored process 54 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:51:40,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:51:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:51:40,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:51:40,713 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 09:51:40,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:51:40,742 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 09:51:40,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:51:40,743 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:51:40,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:51:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:51:40,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:51:40,780 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 09:51:40,780 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:51:40,821 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 09:51:40,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 09:51:40,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4] total 4 [2018-12-02 09:51:40,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:51:40,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:51:40,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:51:40,837 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 5 states. [2018-12-02 09:51:40,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:51:40,864 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2018-12-02 09:51:40,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:51:40,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-02 09:51:40,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:51:40,864 INFO L225 Difference]: With dead ends: 121 [2018-12-02 09:51:40,864 INFO L226 Difference]: Without dead ends: 121 [2018-12-02 09:51:40,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:51:40,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-02 09:51:40,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-12-02 09:51:40,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-02 09:51:40,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 123 transitions. [2018-12-02 09:51:40,866 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 123 transitions. Word has length 73 [2018-12-02 09:51:40,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:51:40,866 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 123 transitions. [2018-12-02 09:51:40,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:51:40,867 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 123 transitions. [2018-12-02 09:51:40,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 09:51:40,867 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:51:40,867 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2018-12-02 09:51:40,867 INFO L423 AbstractCegarLoop]: === Iteration 37 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:51:40,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:51:40,867 INFO L82 PathProgramCache]: Analyzing trace with hash -933085808, now seen corresponding path program 1 times [2018-12-02 09:51:40,867 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:51:40,867 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/cvc4 Starting monitored process 56 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:51:40,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:51:40,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:51:40,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:51:41,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 09:51:41,082 INFO L478 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 10 treesize of output 9 [2018-12-02 09:51:41,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:51:41,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:51:41,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:51:41,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-02 09:51:41,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 24 [2018-12-02 09:51:41,673 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 09:51:41,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:51:41,682 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 09:51:41,682 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:51:41,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:51:41,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:51:41,687 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2018-12-02 09:51:41,751 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 09:51:41,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:51:43,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2018-12-02 09:51:43,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2018-12-02 09:51:43,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:51:43,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:51:43,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 09:51:43,233 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:10 [2018-12-02 09:51:43,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2018-12-02 09:51:43,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2018-12-02 09:51:43,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:51:43,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:51:43,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 09:51:43,457 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:25 [2018-12-02 09:51:43,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2018-12-02 09:51:43,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2018-12-02 09:51:43,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:51:43,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:51:43,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 09:51:43,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:25 [2018-12-02 09:51:43,773 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 09:51:43,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 09:51:43,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [24] total 37 [2018-12-02 09:51:43,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-02 09:51:43,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-02 09:51:43,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1308, Unknown=0, NotChecked=0, Total=1406 [2018-12-02 09:51:43,777 INFO L87 Difference]: Start difference. First operand 121 states and 123 transitions. Second operand 38 states. [2018-12-02 09:51:46,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:51:46,508 INFO L93 Difference]: Finished difference Result 120 states and 122 transitions. [2018-12-02 09:51:46,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-02 09:51:46,508 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 73 [2018-12-02 09:51:46,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:51:46,509 INFO L225 Difference]: With dead ends: 120 [2018-12-02 09:51:46,509 INFO L226 Difference]: Without dead ends: 120 [2018-12-02 09:51:46,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=181, Invalid=2369, Unknown=0, NotChecked=0, Total=2550 [2018-12-02 09:51:46,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-02 09:51:46,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-12-02 09:51:46,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-02 09:51:46,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 122 transitions. [2018-12-02 09:51:46,511 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 122 transitions. Word has length 73 [2018-12-02 09:51:46,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:51:46,511 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 122 transitions. [2018-12-02 09:51:46,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-02 09:51:46,512 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2018-12-02 09:51:46,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 09:51:46,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:51:46,512 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2018-12-02 09:51:46,512 INFO L423 AbstractCegarLoop]: === Iteration 38 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:51:46,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:51:46,513 INFO L82 PathProgramCache]: Analyzing trace with hash 940759944, now seen corresponding path program 1 times [2018-12-02 09:51:46,513 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:51:46,513 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/cvc4 Starting monitored process 57 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:51:46,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:51:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:51:46,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:51:46,639 INFO L478 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 [2018-12-02 09:51:46,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:51:46,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:51:46,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 09:51:46,664 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 09:51:46,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:51:46,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:51:46,687 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:51:46,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:51:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:51:46,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:51:46,722 INFO L478 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 [2018-12-02 09:51:46,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:51:46,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:51:46,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 09:51:46,727 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 09:51:46,727 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:51:46,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 09:51:46,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-12-02 09:51:46,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 09:51:46,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 09:51:46,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=26, Unknown=4, NotChecked=0, Total=42 [2018-12-02 09:51:46,766 INFO L87 Difference]: Start difference. First operand 120 states and 122 transitions. Second operand 6 states. [2018-12-02 09:51:47,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:51:47,012 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2018-12-02 09:51:47,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 09:51:47,012 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2018-12-02 09:51:47,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:51:47,013 INFO L225 Difference]: With dead ends: 124 [2018-12-02 09:51:47,013 INFO L226 Difference]: Without dead ends: 124 [2018-12-02 09:51:47,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=26, Unknown=4, NotChecked=0, Total=42 [2018-12-02 09:51:47,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-02 09:51:47,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-12-02 09:51:47,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-02 09:51:47,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2018-12-02 09:51:47,015 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 74 [2018-12-02 09:51:47,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:51:47,015 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2018-12-02 09:51:47,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 09:51:47,015 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2018-12-02 09:51:47,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 09:51:47,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:51:47,015 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2018-12-02 09:51:47,016 INFO L423 AbstractCegarLoop]: === Iteration 39 === [alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err4REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err5REQUIRES_VIOLATION, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-02 09:51:47,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:51:47,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1139111093, now seen corresponding path program 1 times [2018-12-02 09:51:47,016 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:51:47,016 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/cvc4 Starting monitored process 59 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:51:47,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:51:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:51:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:51:47,678 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 09:51:47,697 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-02 09:51:47,698 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-02 09:51:47,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 09:51:47 BoogieIcfgContainer [2018-12-02 09:51:47,707 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 09:51:47,707 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 09:51:47,707 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 09:51:47,708 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 09:51:47,708 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:45:06" (3/4) ... [2018-12-02 09:51:47,709 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 09:51:47,718 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-02 09:51:47,718 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-02 09:51:47,753 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0e916c44-3e48-491a-a6a1-b93ff2f9efd9/bin-2019/utaipan/witness.graphml [2018-12-02 09:51:47,753 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 09:51:47,754 INFO L168 Benchmark]: Toolchain (without parser) took 401817.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.8 MB). Free memory was 938.0 MB in the beginning and 959.9 MB in the end (delta: -21.9 MB). Peak memory consumption was 157.9 MB. Max. memory is 11.5 GB. [2018-12-02 09:51:47,754 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 09:51:47,754 INFO L168 Benchmark]: CACSL2BoogieTranslator took 388.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -168.0 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2018-12-02 09:51:47,754 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.45 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. [2018-12-02 09:51:47,754 INFO L168 Benchmark]: Boogie Preprocessor took 18.70 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. [2018-12-02 09:51:47,754 INFO L168 Benchmark]: RCFGBuilder took 280.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 11.5 GB. [2018-12-02 09:51:47,754 INFO L168 Benchmark]: TraceAbstraction took 401057.69 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 40.4 MB). Free memory was 1.1 GB in the beginning and 959.9 MB in the end (delta: 102.6 MB). Peak memory consumption was 143.0 MB. Max. memory is 11.5 GB. [2018-12-02 09:51:47,755 INFO L168 Benchmark]: Witness Printer took 45.71 ms. Allocated memory is still 1.2 GB. Free memory is still 959.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 09:51:47,755 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 388.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -168.0 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.45 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. * Boogie Preprocessor took 18.70 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 280.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 401057.69 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 40.4 MB). Free memory was 1.1 GB in the beginning and 959.9 MB in the end (delta: 102.6 MB). Peak memory consumption was 143.0 MB. Max. memory is 11.5 GB. * Witness Printer took 45.71 ms. Allocated memory is still 1.2 GB. Free memory is still 959.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1486]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L1135] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; VAL [\old(ldv_global_msg_list)=null, \old(ldv_global_msg_list)=null, ldv_global_msg_list={1114772347:0}] [L1514] CALL entry_point() VAL [ldv_global_msg_list={1114772347:0}] [L1491] CALL, EXPR ldv_malloc(sizeof(struct ldv_i2c_client)) VAL [\old(size)=20, ldv_global_msg_list={1114772347:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=20, \result={-1343361123:0}, ldv_global_msg_list={1114772347:0}, malloc(size)={-1343361123:0}, size=20] [L1491] RET, EXPR ldv_malloc(sizeof(struct ldv_i2c_client)) VAL [ldv_global_msg_list={1114772347:0}, ldv_malloc(sizeof(struct ldv_i2c_client))={-1343361123:0}] [L1491] struct ldv_i2c_client *c11 = (struct ldv_i2c_client *)ldv_malloc(sizeof(struct ldv_i2c_client)); [L1492] COND FALSE !(!c11) VAL [c11={-1343361123:0}, ldv_global_msg_list={1114772347:0}] [L1494] CALL, EXPR ldv_malloc(sizeof(struct ldv_m88ts2022_config)) VAL [\old(size)=4, ldv_global_msg_list={1114772347:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=4, \result={-1089599296:0}, ldv_global_msg_list={1114772347:0}, malloc(size)={-1089599296:0}, size=4] [L1494] RET, EXPR ldv_malloc(sizeof(struct ldv_m88ts2022_config)) VAL [c11={-1343361123:0}, ldv_global_msg_list={1114772347:0}, ldv_malloc(sizeof(struct ldv_m88ts2022_config))={-1089599296:0}] [L1493-L1494] struct ldv_m88ts2022_config *cfg = (struct ldv_m88ts2022_config *) ldv_malloc(sizeof(struct ldv_m88ts2022_config)); [L1495] COND FALSE !(!cfg) VAL [c11={-1343361123:0}, cfg={-1089599296:0}, ldv_global_msg_list={1114772347:0}] [L1496] c11->dev.platform_data = cfg VAL [c11={-1343361123:0}, cfg={-1089599296:0}, ldv_global_msg_list={1114772347:0}] [L1498] CALL, EXPR ldv_malloc(sizeof(struct ldv_dvb_frontend)) VAL [\old(size)=4, ldv_global_msg_list={1114772347:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=4, \result={-1123653551:0}, ldv_global_msg_list={1114772347:0}, malloc(size)={-1123653551:0}, size=4] [L1498] RET, EXPR ldv_malloc(sizeof(struct ldv_dvb_frontend)) VAL [c11={-1343361123:0}, cfg={-1089599296:0}, ldv_global_msg_list={1114772347:0}, ldv_malloc(sizeof(struct ldv_dvb_frontend))={-1123653551:0}] [L1497-L1498] struct ldv_dvb_frontend *fe = (struct ldv_dvb_frontend *) ldv_malloc(sizeof(struct ldv_dvb_frontend)); [L1499] COND FALSE !(!fe) VAL [c11={-1343361123:0}, cfg={-1089599296:0}, fe={-1123653551:0}, ldv_global_msg_list={1114772347:0}] [L1500] cfg->fe = fe VAL [c11={-1343361123:0}, cfg={-1089599296:0}, fe={-1123653551:0}, ldv_global_msg_list={1114772347:0}] [L1501] CALL alloc_2_11(c11) VAL [client={-1343361123:0}, ldv_global_msg_list={1114772347:0}] [L1470] EXPR client->dev.platform_data VAL [client={-1343361123:0}, client={-1343361123:0}, client->dev.platform_data={-1089599296:0}, ldv_global_msg_list={1114772347:0}] [L1470] struct ldv_m88ts2022_config *cfg = client->dev.platform_data; [L1471] EXPR cfg->fe VAL [cfg={-1089599296:0}, cfg->fe={-1123653551:0}, client={-1343361123:0}, client={-1343361123:0}, ldv_global_msg_list={1114772347:0}] [L1471] struct ldv_dvb_frontend *fe = cfg->fe; [L1472] CALL, EXPR ldv_malloc(sizeof(struct Data11)) VAL [\old(size)=12, ldv_global_msg_list={1114772347:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=12, \result={1114772346:0}, ldv_global_msg_list={1114772347:0}, malloc(size)={1114772346:0}, size=12] [L1472] RET, EXPR ldv_malloc(sizeof(struct Data11)) VAL [cfg={-1089599296:0}, client={-1343361123:0}, client={-1343361123:0}, fe={-1123653551:0}, ldv_global_msg_list={1114772347:0}, ldv_malloc(sizeof(struct Data11))={1114772346:0}] [L1472] struct Data11 *priv = (struct Data11*)ldv_malloc(sizeof(struct Data11)); [L1473] COND FALSE !(!priv) VAL [cfg={-1089599296:0}, client={-1343361123:0}, client={-1343361123:0}, fe={-1123653551:0}, ldv_global_msg_list={1114772347:0}, priv={1114772346:0}] [L1474] fe->tuner_priv = priv VAL [cfg={-1089599296:0}, client={-1343361123:0}, client={-1343361123:0}, fe={-1123653551:0}, ldv_global_msg_list={1114772347:0}, priv={1114772346:0}] [L1475] CALL ldv_i2c_set_clientdata(client, priv) VAL [data={1114772346:0}, dev={-1343361123:0}, ldv_global_msg_list={1114772347:0}] [L1462] CALL ldv_dev_set_drvdata(&dev->dev, data) VAL [data={1114772346:0}, dev={-1343361123:0}, ldv_global_msg_list={1114772347:0}] [L1198] dev->driver_data = data VAL [data={1114772346:0}, data={1114772346:0}, dev={-1343361123:0}, dev={-1343361123:0}, ldv_global_msg_list={1114772347:0}] [L1462] RET ldv_dev_set_drvdata(&dev->dev, data) VAL [data={1114772346:0}, data={1114772346:0}, dev={-1343361123:0}, dev={-1343361123:0}, ldv_global_msg_list={1114772347:0}] [L1475] RET ldv_i2c_set_clientdata(client, priv) VAL [cfg={-1089599296:0}, client={-1343361123:0}, client={-1343361123:0}, fe={-1123653551:0}, ldv_global_msg_list={1114772347:0}, priv={1114772346:0}] [L1476] free(priv) VAL [cfg={-1089599296:0}, client={-1343361123:0}, client={-1343361123:0}, fe={-1123653551:0}, ldv_global_msg_list={1114772347:0}, priv={1114772346:0}] [L1476] free(priv) [L1477] return 0; VAL [\result=0, cfg={-1089599296:0}, client={-1343361123:0}, client={-1343361123:0}, fe={-1123653551:0}, ldv_global_msg_list={1114772347:0}, priv={1114772346:0}] [L1501] RET alloc_2_11(c11) VAL [alloc_2_11(c11)=0, c11={-1343361123:0}, cfg={-1089599296:0}, fe={-1123653551:0}, ldv_global_msg_list={1114772347:0}] [L1502] CALL free_11(c11) VAL [client={-1343361123:0}, ldv_global_msg_list={1114772347:0}] [L1484] CALL, EXPR ldv_i2c_get_clientdata(client) VAL [dev={-1343361123:0}, ldv_global_msg_list={1114772347:0}] [L1457] CALL, EXPR ldv_dev_get_drvdata(&dev->dev) VAL [dev={-1343361123:0}, ldv_global_msg_list={1114772347:0}] [L1193] EXPR dev->driver_data VAL [dev={-1343361123:0}, dev={-1343361123:0}, dev->driver_data={1114772346:0}, ldv_global_msg_list={1114772347:0}] [L1193] return dev->driver_data; [L1457] RET, EXPR ldv_dev_get_drvdata(&dev->dev) VAL [dev={-1343361123:0}, dev={-1343361123:0}, ldv_dev_get_drvdata(&dev->dev)={1114772346:0}, ldv_global_msg_list={1114772347:0}] [L1457] return ldv_dev_get_drvdata(&dev->dev); [L1484] RET, EXPR ldv_i2c_get_clientdata(client) VAL [client={-1343361123:0}, client={-1343361123:0}, ldv_global_msg_list={1114772347:0}, ldv_i2c_get_clientdata(client)={1114772346:0}] [L1484] void *priv = (struct Data11*)ldv_i2c_get_clientdata(client); [L1485] COND TRUE \read(*priv) VAL [client={-1343361123:0}, client={-1343361123:0}, ldv_global_msg_list={1114772347:0}, priv={1114772346:0}] [L1486] free(priv) VAL [client={-1343361123:0}, client={-1343361123:0}, ldv_global_msg_list={1114772347:0}, priv={1114772346:0}] [L1486] free(priv) VAL [client={-1343361123:0}, client={-1343361123:0}, ldv_global_msg_list={1114772347:0}, priv={1114772346:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 103 locations, 25 error locations. UNSAFE Result, 401.0s OverallTime, 39 OverallIterations, 4 TraceHistogramMax, 279.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3081 SDtfs, 2639 SDslu, 17213 SDs, 0 SdLazy, 19785 SolverSat, 944 SolverUnsat, 218 SolverUnknown, 0 SolverNotchecked, 195.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3389 GetRequests, 2603 SyntacticMatches, 57 SemanticMatches, 729 ConstructedPredicates, 23 IntricatePredicates, 1 DeprecatedPredicates, 4645 ImplicationChecksByTransitivity, 185.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 38 MinimizatonAttempts, 638 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 116.9s InterpolantComputationTime, 2367 NumberOfCodeBlocks, 2367 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 3002 ConstructedInterpolants, 254 QuantifiedInterpolants, 852362 SizeOfPredicates, 444 NumberOfNonLiveVariables, 9002 ConjunctsInSsa, 1213 ConjunctsInUnsatCore, 75 InterpolantComputations, 19 PerfectInterpolantSequences, 830/1140 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...