./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f4d5612c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fd4ad7692f5709ff8aaeaf10c342a0f425eb83bd ............................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fd4ad7692f5709ff8aaeaf10c342a0f425eb83bd ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported: (forall ((|v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4| (_ BitVec 32))) (exists ((v_DerPreprocessor_18 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_19 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32))) (or (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|)) (not (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base| (let ((.cse0 (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv4 32)))) (store (store (store (store (store (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv12 32)) v_DerPreprocessor_17) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv13 32)) v_DerPreprocessor_18) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv14 32)) v_DerPreprocessor_19) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv15 32)) v_DerPreprocessor_20) .cse0 .cse0) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv8 32)) .cse0))) |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|)))))) --- Real Ultimate output --- This is Ultimate 0.1.24-f4d5612 [2019-11-28 12:43:47,043 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 12:43:47,045 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 12:43:47,062 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 12:43:47,063 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 12:43:47,064 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 12:43:47,066 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 12:43:47,075 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 12:43:47,080 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 12:43:47,083 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 12:43:47,084 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 12:43:47,086 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 12:43:47,086 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 12:43:47,089 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 12:43:47,090 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 12:43:47,091 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 12:43:47,093 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 12:43:47,094 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 12:43:47,096 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 12:43:47,100 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 12:43:47,104 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 12:43:47,108 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 12:43:47,109 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 12:43:47,110 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 12:43:47,114 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 12:43:47,115 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 12:43:47,115 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 12:43:47,116 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 12:43:47,117 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 12:43:47,118 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 12:43:47,118 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 12:43:47,119 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 12:43:47,119 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 12:43:47,120 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 12:43:47,122 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 12:43:47,122 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 12:43:47,123 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 12:43:47,123 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 12:43:47,123 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 12:43:47,124 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 12:43:47,126 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 12:43:47,126 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 12:43:47,158 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 12:43:47,162 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 12:43:47,163 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 12:43:47,164 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 12:43:47,164 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 12:43:47,164 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 12:43:47,165 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 12:43:47,165 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 12:43:47,165 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 12:43:47,166 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 12:43:47,166 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 12:43:47,167 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 12:43:47,167 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 12:43:47,168 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 12:43:47,168 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 12:43:47,169 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 12:43:47,169 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 12:43:47,169 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 12:43:47,170 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 12:43:47,170 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 12:43:47,170 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 12:43:47,170 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 12:43:47,171 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 12:43:47,171 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 12:43:47,171 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 12:43:47,172 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 12:43:47,172 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 12:43:47,172 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fd4ad7692f5709ff8aaeaf10c342a0f425eb83bd [2019-11-28 12:43:47,458 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 12:43:47,477 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 12:43:47,481 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 12:43:47,483 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 12:43:47,483 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 12:43:47,484 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2019-11-28 12:43:47,551 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/663e5c913/d31e7c2328cd4a9aa135196d0b3a3aea/FLAG6ac07e00c [2019-11-28 12:43:48,056 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 12:43:48,056 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2019-11-28 12:43:48,076 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/663e5c913/d31e7c2328cd4a9aa135196d0b3a3aea/FLAG6ac07e00c [2019-11-28 12:43:48,378 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/663e5c913/d31e7c2328cd4a9aa135196d0b3a3aea [2019-11-28 12:43:48,382 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 12:43:48,383 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 12:43:48,384 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 12:43:48,384 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 12:43:48,387 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 12:43:48,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:43:48" (1/1) ... [2019-11-28 12:43:48,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34aa0f63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:43:48, skipping insertion in model container [2019-11-28 12:43:48,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:43:48" (1/1) ... [2019-11-28 12:43:48,403 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 12:43:48,461 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 12:43:48,992 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 12:43:49,012 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2019-11-28 12:43:49,013 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@72991309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:43:49, skipping insertion in model container [2019-11-28 12:43:49,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 12:43:49,014 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-28 12:43:49,017 INFO L168 Benchmark]: Toolchain (without parser) took 632.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -189.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-28 12:43:49,017 INFO L168 Benchmark]: CDTParser took 0.60 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 12:43:49,019 INFO L168 Benchmark]: CACSL2BoogieTranslator took 630.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -189.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-28 12:43:49,021 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.60 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 630.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -189.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-f4d5612 [2019-11-28 12:43:50,570 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 12:43:50,573 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 12:43:50,584 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 12:43:50,585 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 12:43:50,586 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 12:43:50,587 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 12:43:50,589 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 12:43:50,595 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 12:43:50,596 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 12:43:50,597 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 12:43:50,598 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 12:43:50,598 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 12:43:50,600 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 12:43:50,601 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 12:43:50,603 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 12:43:50,604 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 12:43:50,606 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 12:43:50,609 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 12:43:50,612 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 12:43:50,615 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 12:43:50,617 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 12:43:50,620 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 12:43:50,620 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 12:43:50,624 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 12:43:50,626 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 12:43:50,626 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 12:43:50,628 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 12:43:50,628 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 12:43:50,630 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 12:43:50,630 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 12:43:50,631 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 12:43:50,632 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 12:43:50,632 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 12:43:50,634 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 12:43:50,634 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 12:43:50,635 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 12:43:50,636 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 12:43:50,636 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 12:43:50,638 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 12:43:50,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 12:43:50,640 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-28 12:43:50,674 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 12:43:50,678 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 12:43:50,679 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 12:43:50,681 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 12:43:50,681 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 12:43:50,681 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 12:43:50,682 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 12:43:50,682 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 12:43:50,682 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 12:43:50,682 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 12:43:50,683 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 12:43:50,684 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 12:43:50,684 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 12:43:50,685 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 12:43:50,685 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 12:43:50,685 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 12:43:50,685 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-28 12:43:50,686 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-28 12:43:50,686 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 12:43:50,686 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 12:43:50,686 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 12:43:50,687 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 12:43:50,687 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 12:43:50,688 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 12:43:50,688 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 12:43:50,688 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 12:43:50,688 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 12:43:50,689 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-28 12:43:50,689 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-28 12:43:50,689 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-28 12:43:50,690 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fd4ad7692f5709ff8aaeaf10c342a0f425eb83bd [2019-11-28 12:43:50,962 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 12:43:50,975 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 12:43:50,978 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 12:43:50,979 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 12:43:50,980 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 12:43:50,981 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2019-11-28 12:43:51,037 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70cd5fe58/50a32151868f43709ef966573d75cb70/FLAGa32a8bba9 [2019-11-28 12:43:51,481 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 12:43:51,482 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2019-11-28 12:43:51,501 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70cd5fe58/50a32151868f43709ef966573d75cb70/FLAGa32a8bba9 [2019-11-28 12:43:51,784 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70cd5fe58/50a32151868f43709ef966573d75cb70 [2019-11-28 12:43:51,787 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 12:43:51,789 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 12:43:51,790 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 12:43:51,790 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 12:43:51,795 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 12:43:51,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:43:51" (1/1) ... [2019-11-28 12:43:51,798 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@da5c581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:43:51, skipping insertion in model container [2019-11-28 12:43:51,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:43:51" (1/1) ... [2019-11-28 12:43:51,808 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 12:43:51,876 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 12:43:52,298 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 12:43:52,319 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-28 12:43:52,341 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 12:43:52,389 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 12:43:52,403 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 12:43:52,495 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 12:43:52,597 INFO L208 MainTranslator]: Completed translation [2019-11-28 12:43:52,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:43:52 WrapperNode [2019-11-28 12:43:52,598 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 12:43:52,599 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 12:43:52,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 12:43:52,599 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 12:43:52,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:43:52" (1/1) ... [2019-11-28 12:43:52,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:43:52" (1/1) ... [2019-11-28 12:43:52,637 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:43:52" (1/1) ... [2019-11-28 12:43:52,638 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:43:52" (1/1) ... [2019-11-28 12:43:52,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:43:52" (1/1) ... [2019-11-28 12:43:52,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:43:52" (1/1) ... [2019-11-28 12:43:52,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:43:52" (1/1) ... [2019-11-28 12:43:52,697 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 12:43:52,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 12:43:52,698 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 12:43:52,698 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 12:43:52,699 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:43:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 12:43:52,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 12:43:52,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 12:43:52,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-28 12:43:52,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-28 12:43:52,761 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-28 12:43:52,761 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-28 12:43:52,761 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-28 12:43:52,761 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-28 12:43:52,762 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-28 12:43:52,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-28 12:43:52,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-28 12:43:52,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-28 12:43:52,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-28 12:43:52,763 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-28 12:43:52,763 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-28 12:43:52,763 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-28 12:43:52,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-28 12:43:52,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-28 12:43:52,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-28 12:43:52,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-28 12:43:52,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-28 12:43:52,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-28 12:43:52,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-28 12:43:52,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-28 12:43:52,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-28 12:43:52,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-28 12:43:52,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-28 12:43:52,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-28 12:43:52,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-28 12:43:52,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-28 12:43:52,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-28 12:43:52,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-28 12:43:52,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-28 12:43:52,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-28 12:43:52,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-28 12:43:52,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-28 12:43:52,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-28 12:43:52,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-28 12:43:52,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-28 12:43:52,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-28 12:43:52,768 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-28 12:43:52,769 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-28 12:43:52,769 INFO L138 BoogieDeclarations]: Found implementation of procedure f_22_get [2019-11-28 12:43:52,769 INFO L138 BoogieDeclarations]: Found implementation of procedure f_22_put [2019-11-28 12:43:52,769 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-28 12:43:52,769 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 12:43:52,770 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-28 12:43:52,770 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-28 12:43:52,770 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-28 12:43:52,770 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 12:43:52,770 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 12:43:52,771 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 12:43:52,771 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 12:43:52,771 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 12:43:52,771 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 12:43:52,772 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 12:43:52,772 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 12:43:52,772 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 12:43:52,772 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 12:43:52,772 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 12:43:52,773 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 12:43:52,773 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 12:43:52,773 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 12:43:52,773 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 12:43:52,773 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 12:43:52,774 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-28 12:43:52,774 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-28 12:43:52,774 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-28 12:43:52,774 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-28 12:43:52,774 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-28 12:43:52,775 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 12:43:52,775 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 12:43:52,775 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 12:43:52,775 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 12:43:52,775 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 12:43:52,776 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 12:43:52,776 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 12:43:52,776 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 12:43:52,776 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 12:43:52,776 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 12:43:52,777 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 12:43:52,777 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 12:43:52,777 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 12:43:52,777 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 12:43:52,778 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 12:43:52,778 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 12:43:52,778 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 12:43:52,778 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 12:43:52,778 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 12:43:52,779 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 12:43:52,779 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 12:43:52,779 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 12:43:52,779 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 12:43:52,780 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 12:43:52,780 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 12:43:52,780 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 12:43:52,780 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 12:43:52,780 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 12:43:52,781 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 12:43:52,781 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 12:43:52,781 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 12:43:52,781 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 12:43:52,781 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 12:43:52,782 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 12:43:52,782 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 12:43:52,782 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 12:43:52,782 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 12:43:52,783 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 12:43:52,783 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 12:43:52,783 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 12:43:52,783 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 12:43:52,783 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-28 12:43:52,784 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 12:43:52,784 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 12:43:52,784 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-28 12:43:52,784 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 12:43:52,785 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 12:43:52,785 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-28 12:43:52,785 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 12:43:52,785 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 12:43:52,785 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 12:43:52,786 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 12:43:52,786 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 12:43:52,786 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 12:43:52,786 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 12:43:52,787 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 12:43:52,787 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 12:43:52,787 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 12:43:52,787 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 12:43:52,788 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 12:43:52,788 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 12:43:52,788 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 12:43:52,788 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 12:43:52,788 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 12:43:52,789 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 12:43:52,789 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 12:43:52,789 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 12:43:52,789 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 12:43:52,790 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 12:43:52,790 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 12:43:52,790 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 12:43:52,790 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 12:43:52,791 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 12:43:52,791 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 12:43:52,791 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 12:43:52,791 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 12:43:52,791 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 12:43:52,792 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 12:43:52,792 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 12:43:52,792 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 12:43:52,792 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 12:43:52,792 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 12:43:52,793 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 12:43:52,793 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 12:43:52,793 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 12:43:52,793 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 12:43:52,793 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-28 12:43:52,794 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 12:43:52,794 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-28 12:43:52,794 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-28 12:43:52,794 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-28 12:43:52,795 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-28 12:43:52,795 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-28 12:43:52,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 12:43:52,795 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-28 12:43:52,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-28 12:43:52,796 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-28 12:43:52,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 12:43:52,796 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-28 12:43:52,796 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-28 12:43:52,796 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-28 12:43:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 12:43:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-28 12:43:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-28 12:43:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-28 12:43:52,798 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-28 12:43:52,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-28 12:43:52,798 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-28 12:43:52,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 12:43:52,798 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-28 12:43:52,799 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-28 12:43:52,799 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-28 12:43:52,799 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-28 12:43:52,799 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-28 12:43:52,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-28 12:43:52,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-28 12:43:52,800 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-28 12:43:52,800 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-28 12:43:52,800 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-28 12:43:52,801 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-28 12:43:52,801 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-28 12:43:52,801 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-28 12:43:52,801 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-28 12:43:52,801 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-28 12:43:52,802 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-28 12:43:52,802 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-28 12:43:52,802 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-28 12:43:52,802 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-28 12:43:52,802 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-28 12:43:52,803 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-28 12:43:52,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-28 12:43:52,803 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-28 12:43:52,803 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-28 12:43:52,804 INFO L130 BoogieDeclarations]: Found specification of procedure f_22_get [2019-11-28 12:43:52,804 INFO L130 BoogieDeclarations]: Found specification of procedure f_22_put [2019-11-28 12:43:52,804 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-28 12:43:52,804 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 12:43:52,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 12:43:52,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 12:43:52,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-28 12:43:52,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 12:43:52,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-28 12:43:52,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-28 12:43:52,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-28 12:43:52,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-28 12:43:52,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-28 12:43:53,533 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 12:43:53,925 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 12:43:54,270 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 12:43:54,270 INFO L287 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-28 12:43:54,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:43:54 BoogieIcfgContainer [2019-11-28 12:43:54,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 12:43:54,276 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 12:43:54,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 12:43:54,279 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 12:43:54,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:43:51" (1/3) ... [2019-11-28 12:43:54,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a78f811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:43:54, skipping insertion in model container [2019-11-28 12:43:54,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:43:52" (2/3) ... [2019-11-28 12:43:54,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a78f811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:43:54, skipping insertion in model container [2019-11-28 12:43:54,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:43:54" (3/3) ... [2019-11-28 12:43:54,284 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test22_5.i [2019-11-28 12:43:54,294 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 12:43:54,305 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2019-11-28 12:43:54,318 INFO L249 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2019-11-28 12:43:54,342 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 12:43:54,343 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 12:43:54,343 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 12:43:54,343 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 12:43:54,344 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 12:43:54,344 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 12:43:54,344 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 12:43:54,345 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 12:43:54,372 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states. [2019-11-28 12:43:54,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 12:43:54,382 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:43:54,383 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:43:54,384 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:43:54,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:43:54,390 INFO L82 PathProgramCache]: Analyzing trace with hash -604206848, now seen corresponding path program 1 times [2019-11-28 12:43:54,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:43:54,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1421444459] [2019-11-28 12:43:54,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-28 12:43:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:43:54,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 12:43:54,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:43:54,726 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 12:43:54,727 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:43:54,736 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:43:54,737 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:43:54,737 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 12:43:54,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:43:54,776 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:43:54,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:43:54,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1421444459] [2019-11-28 12:43:54,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:43:54,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-28 12:43:54,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753675213] [2019-11-28 12:43:54,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 12:43:54,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:43:54,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 12:43:54,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 12:43:54,880 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 5 states. [2019-11-28 12:43:55,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:43:55,177 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2019-11-28 12:43:55,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 12:43:55,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-28 12:43:55,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:43:55,193 INFO L225 Difference]: With dead ends: 137 [2019-11-28 12:43:55,194 INFO L226 Difference]: Without dead ends: 134 [2019-11-28 12:43:55,197 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 12:43:55,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-28 12:43:55,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 128. [2019-11-28 12:43:55,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-28 12:43:55,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2019-11-28 12:43:55,257 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 17 [2019-11-28 12:43:55,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:43:55,258 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2019-11-28 12:43:55,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 12:43:55,259 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2019-11-28 12:43:55,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 12:43:55,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:43:55,260 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:43:55,474 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-28 12:43:55,475 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:43:55,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:43:55,475 INFO L82 PathProgramCache]: Analyzing trace with hash -604206847, now seen corresponding path program 1 times [2019-11-28 12:43:55,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:43:55,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1651976407] [2019-11-28 12:43:55,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-28 12:43:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:43:55,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 12:43:55,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:43:55,670 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 12:43:55,671 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:43:55,678 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:43:55,678 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:43:55,678 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 12:43:55,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:43:55,725 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:43:56,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:43:56,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1651976407] [2019-11-28 12:43:56,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:43:56,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-28 12:43:56,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690402900] [2019-11-28 12:43:56,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 12:43:56,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:43:56,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 12:43:56,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 12:43:56,038 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand 10 states. [2019-11-28 12:43:56,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:43:56,704 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2019-11-28 12:43:56,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 12:43:56,706 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-28 12:43:56,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:43:56,707 INFO L225 Difference]: With dead ends: 133 [2019-11-28 12:43:56,708 INFO L226 Difference]: Without dead ends: 133 [2019-11-28 12:43:56,708 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-28 12:43:56,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-28 12:43:56,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 128. [2019-11-28 12:43:56,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-28 12:43:56,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2019-11-28 12:43:56,725 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 17 [2019-11-28 12:43:56,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:43:56,726 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2019-11-28 12:43:56,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 12:43:56,726 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2019-11-28 12:43:56,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 12:43:56,727 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:43:56,730 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:43:56,942 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-28 12:43:56,943 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:43:56,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:43:56,943 INFO L82 PathProgramCache]: Analyzing trace with hash -575577697, now seen corresponding path program 1 times [2019-11-28 12:43:56,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:43:56,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697911841] [2019-11-28 12:43:56,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-28 12:43:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:43:57,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 12:43:57,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:43:57,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:43:57,086 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:43:57,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:43:57,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697911841] [2019-11-28 12:43:57,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:43:57,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-28 12:43:57,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368055717] [2019-11-28 12:43:57,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 12:43:57,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:43:57,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 12:43:57,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 12:43:57,131 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 5 states. [2019-11-28 12:43:57,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:43:57,160 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2019-11-28 12:43:57,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 12:43:57,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-28 12:43:57,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:43:57,162 INFO L225 Difference]: With dead ends: 127 [2019-11-28 12:43:57,162 INFO L226 Difference]: Without dead ends: 127 [2019-11-28 12:43:57,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 12:43:57,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-28 12:43:57,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2019-11-28 12:43:57,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-28 12:43:57,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2019-11-28 12:43:57,173 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 17 [2019-11-28 12:43:57,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:43:57,173 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2019-11-28 12:43:57,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 12:43:57,173 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2019-11-28 12:43:57,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 12:43:57,175 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:43:57,175 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:43:57,388 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-28 12:43:57,389 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:43:57,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:43:57,390 INFO L82 PathProgramCache]: Analyzing trace with hash -811306797, now seen corresponding path program 1 times [2019-11-28 12:43:57,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:43:57,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1545058017] [2019-11-28 12:43:57,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-28 12:43:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:43:57,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 12:43:57,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:43:57,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:43:57,569 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:43:57,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:43:57,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1545058017] [2019-11-28 12:43:57,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:43:57,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-28 12:43:57,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440202066] [2019-11-28 12:43:57,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 12:43:57,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:43:57,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 12:43:57,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 12:43:57,666 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand 5 states. [2019-11-28 12:43:57,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:43:57,694 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions. [2019-11-28 12:43:57,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 12:43:57,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 12:43:57,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:43:57,696 INFO L225 Difference]: With dead ends: 127 [2019-11-28 12:43:57,696 INFO L226 Difference]: Without dead ends: 127 [2019-11-28 12:43:57,699 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 12:43:57,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-28 12:43:57,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2019-11-28 12:43:57,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-28 12:43:57,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2019-11-28 12:43:57,717 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 31 [2019-11-28 12:43:57,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:43:57,717 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2019-11-28 12:43:57,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 12:43:57,718 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2019-11-28 12:43:57,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 12:43:57,719 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:43:57,719 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:43:57,920 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-28 12:43:57,920 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:43:57,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:43:57,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1220131022, now seen corresponding path program 1 times [2019-11-28 12:43:57,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:43:57,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1565874882] [2019-11-28 12:43:57,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-28 12:43:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:43:58,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 12:43:58,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:43:58,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:43:58,171 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:43:58,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:43:58,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1565874882] [2019-11-28 12:43:58,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:43:58,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 9 [2019-11-28 12:43:58,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503195197] [2019-11-28 12:43:58,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 12:43:58,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:43:58,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 12:43:58,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-28 12:43:58,225 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand 9 states. [2019-11-28 12:43:58,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:43:58,348 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2019-11-28 12:43:58,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 12:43:58,349 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-11-28 12:43:58,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:43:58,351 INFO L225 Difference]: With dead ends: 142 [2019-11-28 12:43:58,351 INFO L226 Difference]: Without dead ends: 142 [2019-11-28 12:43:58,351 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-28 12:43:58,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-28 12:43:58,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2019-11-28 12:43:58,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-28 12:43:58,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 146 transitions. [2019-11-28 12:43:58,376 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 146 transitions. Word has length 31 [2019-11-28 12:43:58,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:43:58,377 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 146 transitions. [2019-11-28 12:43:58,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 12:43:58,377 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2019-11-28 12:43:58,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 12:43:58,379 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:43:58,379 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:43:58,601 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-28 12:43:58,602 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:43:58,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:43:58,602 INFO L82 PathProgramCache]: Analyzing trace with hash 536113147, now seen corresponding path program 1 times [2019-11-28 12:43:58,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:43:58,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011007741] [2019-11-28 12:43:58,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-28 12:43:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:43:58,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 12:43:58,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:43:58,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:43:58,763 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:43:58,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:43:58,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1011007741] [2019-11-28 12:43:58,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:43:58,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-28 12:43:58,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211519644] [2019-11-28 12:43:58,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 12:43:58,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:43:58,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 12:43:58,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 12:43:58,820 INFO L87 Difference]: Start difference. First operand 138 states and 146 transitions. Second operand 6 states. [2019-11-28 12:43:58,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:43:58,872 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2019-11-28 12:43:58,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 12:43:58,873 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-28 12:43:58,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:43:58,875 INFO L225 Difference]: With dead ends: 144 [2019-11-28 12:43:58,875 INFO L226 Difference]: Without dead ends: 140 [2019-11-28 12:43:58,875 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-28 12:43:58,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-28 12:43:58,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-11-28 12:43:58,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-28 12:43:58,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 148 transitions. [2019-11-28 12:43:58,883 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 148 transitions. Word has length 32 [2019-11-28 12:43:58,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:43:58,884 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 148 transitions. [2019-11-28 12:43:58,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 12:43:58,884 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2019-11-28 12:43:58,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 12:43:58,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:43:58,885 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:43:59,099 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-28 12:43:59,099 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:43:59,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:43:59,100 INFO L82 PathProgramCache]: Analyzing trace with hash 690495131, now seen corresponding path program 1 times [2019-11-28 12:43:59,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:43:59,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925687099] [2019-11-28 12:43:59,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-28 12:43:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:43:59,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 12:43:59,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:43:59,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:43:59,305 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:43:59,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:43:59,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1925687099] [2019-11-28 12:43:59,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 12:43:59,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-28 12:43:59,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155846822] [2019-11-28 12:43:59,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 12:43:59,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:43:59,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 12:43:59,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-28 12:43:59,436 INFO L87 Difference]: Start difference. First operand 140 states and 148 transitions. Second operand 10 states. [2019-11-28 12:43:59,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:43:59,660 INFO L93 Difference]: Finished difference Result 148 states and 158 transitions. [2019-11-28 12:43:59,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 12:43:59,662 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-11-28 12:43:59,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:43:59,663 INFO L225 Difference]: With dead ends: 148 [2019-11-28 12:43:59,663 INFO L226 Difference]: Without dead ends: 144 [2019-11-28 12:43:59,664 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-11-28 12:43:59,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-28 12:43:59,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-11-28 12:43:59,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-28 12:43:59,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2019-11-28 12:43:59,671 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 34 [2019-11-28 12:43:59,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:43:59,671 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2019-11-28 12:43:59,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 12:43:59,671 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2019-11-28 12:43:59,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 12:43:59,673 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:43:59,673 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:43:59,879 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-28 12:43:59,880 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:43:59,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:43:59,881 INFO L82 PathProgramCache]: Analyzing trace with hash 780110635, now seen corresponding path program 1 times [2019-11-28 12:43:59,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:43:59,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1248472348] [2019-11-28 12:43:59,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-28 12:44:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:44:00,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 12:44:00,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:44:00,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 12:44:00,059 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:44:00,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 12:44:00,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1248472348] [2019-11-28 12:44:00,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:44:00,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-28 12:44:00,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405095986] [2019-11-28 12:44:00,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 12:44:00,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:44:00,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 12:44:00,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 12:44:00,277 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand 3 states. [2019-11-28 12:44:00,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:44:00,446 INFO L93 Difference]: Finished difference Result 157 states and 165 transitions. [2019-11-28 12:44:00,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 12:44:00,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-28 12:44:00,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:44:00,448 INFO L225 Difference]: With dead ends: 157 [2019-11-28 12:44:00,448 INFO L226 Difference]: Without dead ends: 137 [2019-11-28 12:44:00,448 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 12:44:00,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-28 12:44:00,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 127. [2019-11-28 12:44:00,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-28 12:44:00,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 133 transitions. [2019-11-28 12:44:00,454 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 133 transitions. Word has length 36 [2019-11-28 12:44:00,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:44:00,455 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 133 transitions. [2019-11-28 12:44:00,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 12:44:00,455 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 133 transitions. [2019-11-28 12:44:00,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-28 12:44:00,456 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:44:00,456 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:44:00,656 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-28 12:44:00,657 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:44:00,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:44:00,657 INFO L82 PathProgramCache]: Analyzing trace with hash -2002385957, now seen corresponding path program 2 times [2019-11-28 12:44:00,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:44:00,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [543370959] [2019-11-28 12:44:00,659 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-28 12:44:00,785 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 12:44:00,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 12:44:00,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 12:44:00,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:44:00,799 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 12:44:00,800 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:44:00,802 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:44:00,802 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:44:00,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 12:44:00,948 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-28 12:44:00,948 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:44:01,043 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-28 12:44:01,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [543370959] [2019-11-28 12:44:01,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:44:01,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-28 12:44:01,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399414345] [2019-11-28 12:44:01,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 12:44:01,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:44:01,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 12:44:01,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-28 12:44:01,045 INFO L87 Difference]: Start difference. First operand 127 states and 133 transitions. Second operand 12 states. [2019-11-28 12:44:01,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:44:01,921 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2019-11-28 12:44:01,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 12:44:01,921 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-11-28 12:44:01,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:44:01,922 INFO L225 Difference]: With dead ends: 152 [2019-11-28 12:44:01,923 INFO L226 Difference]: Without dead ends: 152 [2019-11-28 12:44:01,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-28 12:44:01,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-28 12:44:01,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 126. [2019-11-28 12:44:01,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-28 12:44:01,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2019-11-28 12:44:01,930 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 38 [2019-11-28 12:44:01,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:44:01,930 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2019-11-28 12:44:01,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 12:44:01,930 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2019-11-28 12:44:01,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-28 12:44:01,931 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:44:01,931 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:44:02,135 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-28 12:44:02,136 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:44:02,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:44:02,136 INFO L82 PathProgramCache]: Analyzing trace with hash -2002385956, now seen corresponding path program 1 times [2019-11-28 12:44:02,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:44:02,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469403513] [2019-11-28 12:44:02,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-28 12:44:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:44:02,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 12:44:02,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:44:02,402 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:44:02,402 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:44:02,727 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:44:02,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469403513] [2019-11-28 12:44:02,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 12:44:02,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-28 12:44:02,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705284694] [2019-11-28 12:44:02,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 12:44:02,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:44:02,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 12:44:02,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-11-28 12:44:02,728 INFO L87 Difference]: Start difference. First operand 126 states and 132 transitions. Second operand 18 states. [2019-11-28 12:44:03,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:44:03,553 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2019-11-28 12:44:03,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 12:44:03,554 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-11-28 12:44:03,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:44:03,555 INFO L225 Difference]: With dead ends: 138 [2019-11-28 12:44:03,555 INFO L226 Difference]: Without dead ends: 134 [2019-11-28 12:44:03,556 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=223, Invalid=377, Unknown=0, NotChecked=0, Total=600 [2019-11-28 12:44:03,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-28 12:44:03,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-11-28 12:44:03,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-28 12:44:03,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 140 transitions. [2019-11-28 12:44:03,561 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 140 transitions. Word has length 38 [2019-11-28 12:44:03,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:44:03,562 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 140 transitions. [2019-11-28 12:44:03,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 12:44:03,562 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 140 transitions. [2019-11-28 12:44:03,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-28 12:44:03,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:44:03,563 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:44:03,767 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-28 12:44:03,768 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:44:03,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:44:03,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1528032860, now seen corresponding path program 2 times [2019-11-28 12:44:03,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:44:03,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491800765] [2019-11-28 12:44:03,771 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-11-28 12:44:03,913 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 12:44:03,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 12:44:03,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 12:44:03,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:44:03,935 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 12:44:03,936 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:44:03,941 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:44:03,942 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:44:03,942 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 12:44:04,167 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-28 12:44:04,168 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:44:04,981 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-28 12:44:04,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [491800765] [2019-11-28 12:44:04,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:44:04,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-28 12:44:04,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94385282] [2019-11-28 12:44:04,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-28 12:44:04,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:44:04,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-28 12:44:04,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-28 12:44:04,983 INFO L87 Difference]: Start difference. First operand 134 states and 140 transitions. Second operand 23 states. [2019-11-28 12:44:07,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:44:07,278 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2019-11-28 12:44:07,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 12:44:07,279 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2019-11-28 12:44:07,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:44:07,280 INFO L225 Difference]: With dead ends: 133 [2019-11-28 12:44:07,280 INFO L226 Difference]: Without dead ends: 133 [2019-11-28 12:44:07,281 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-28 12:44:07,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-28 12:44:07,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-11-28 12:44:07,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-28 12:44:07,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 139 transitions. [2019-11-28 12:44:07,286 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 139 transitions. Word has length 46 [2019-11-28 12:44:07,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:44:07,286 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 139 transitions. [2019-11-28 12:44:07,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-28 12:44:07,287 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 139 transitions. [2019-11-28 12:44:07,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 12:44:07,288 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:44:07,288 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:44:07,492 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-28 12:44:07,492 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:44:07,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:44:07,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1472640772, now seen corresponding path program 1 times [2019-11-28 12:44:07,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:44:07,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [920101320] [2019-11-28 12:44:07,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-11-28 12:44:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:44:07,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 12:44:07,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:44:07,919 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:44:07,920 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:44:08,026 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-28 12:44:08,840 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:44:08,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [920101320] [2019-11-28 12:44:08,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 12:44:08,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-11-28 12:44:08,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120149799] [2019-11-28 12:44:08,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-28 12:44:08,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:44:08,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-28 12:44:08,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2019-11-28 12:44:08,843 INFO L87 Difference]: Start difference. First operand 133 states and 139 transitions. Second operand 34 states. [2019-11-28 12:44:09,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:44:09,615 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2019-11-28 12:44:09,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 12:44:09,616 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 51 [2019-11-28 12:44:09,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:44:09,617 INFO L225 Difference]: With dead ends: 139 [2019-11-28 12:44:09,618 INFO L226 Difference]: Without dead ends: 135 [2019-11-28 12:44:09,618 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=250, Invalid=940, Unknown=0, NotChecked=0, Total=1190 [2019-11-28 12:44:09,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-28 12:44:09,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-11-28 12:44:09,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-28 12:44:09,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 141 transitions. [2019-11-28 12:44:09,624 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 141 transitions. Word has length 51 [2019-11-28 12:44:09,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:44:09,624 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 141 transitions. [2019-11-28 12:44:09,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-28 12:44:09,625 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 141 transitions. [2019-11-28 12:44:09,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 12:44:09,626 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:44:09,626 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:44:09,840 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-28 12:44:09,840 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:44:09,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:44:09,841 INFO L82 PathProgramCache]: Analyzing trace with hash 680412260, now seen corresponding path program 2 times [2019-11-28 12:44:09,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:44:09,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [902973529] [2019-11-28 12:44:09,842 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-11-28 12:44:09,979 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 12:44:09,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 12:44:09,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 12:44:09,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:44:10,003 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 12:44:10,004 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:44:10,006 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:44:10,006 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:44:10,006 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 12:44:10,186 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 12:44:10,186 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:44:10,259 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 12:44:10,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [902973529] [2019-11-28 12:44:10,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:44:10,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-28 12:44:10,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896108283] [2019-11-28 12:44:10,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 12:44:10,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:44:10,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 12:44:10,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-28 12:44:10,261 INFO L87 Difference]: Start difference. First operand 135 states and 141 transitions. Second operand 12 states. [2019-11-28 12:44:11,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:44:11,106 INFO L93 Difference]: Finished difference Result 159 states and 173 transitions. [2019-11-28 12:44:11,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 12:44:11,106 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-11-28 12:44:11,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:44:11,109 INFO L225 Difference]: With dead ends: 159 [2019-11-28 12:44:11,109 INFO L226 Difference]: Without dead ends: 159 [2019-11-28 12:44:11,110 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-28 12:44:11,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-28 12:44:11,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 133. [2019-11-28 12:44:11,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-28 12:44:11,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 139 transitions. [2019-11-28 12:44:11,117 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 139 transitions. Word has length 53 [2019-11-28 12:44:11,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:44:11,117 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 139 transitions. [2019-11-28 12:44:11,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 12:44:11,118 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 139 transitions. [2019-11-28 12:44:11,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 12:44:11,118 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:44:11,118 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:44:11,323 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-28 12:44:11,324 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:44:11,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:44:11,324 INFO L82 PathProgramCache]: Analyzing trace with hash 680412261, now seen corresponding path program 1 times [2019-11-28 12:44:11,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:44:11,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166928932] [2019-11-28 12:44:11,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-11-28 12:44:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:44:11,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 12:44:11,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:44:11,524 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 12:44:11,524 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:44:11,531 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:44:11,531 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:44:11,532 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 12:44:11,758 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 12:44:11,759 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:44:12,536 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 12:44:12,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166928932] [2019-11-28 12:44:12,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:44:12,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-28 12:44:12,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805490061] [2019-11-28 12:44:12,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-28 12:44:12,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:44:12,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-28 12:44:12,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-28 12:44:12,538 INFO L87 Difference]: Start difference. First operand 133 states and 139 transitions. Second operand 23 states. [2019-11-28 12:44:14,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:44:14,600 INFO L93 Difference]: Finished difference Result 131 states and 137 transitions. [2019-11-28 12:44:14,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 12:44:14,602 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2019-11-28 12:44:14,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:44:14,604 INFO L225 Difference]: With dead ends: 131 [2019-11-28 12:44:14,604 INFO L226 Difference]: Without dead ends: 131 [2019-11-28 12:44:14,604 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 80 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-28 12:44:14,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-28 12:44:14,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-11-28 12:44:14,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-28 12:44:14,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 137 transitions. [2019-11-28 12:44:14,612 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 137 transitions. Word has length 53 [2019-11-28 12:44:14,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:44:14,614 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 137 transitions. [2019-11-28 12:44:14,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-28 12:44:14,614 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 137 transitions. [2019-11-28 12:44:14,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-28 12:44:14,615 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:44:14,615 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:44:14,827 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-28 12:44:14,827 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:44:14,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:44:14,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1848313328, now seen corresponding path program 1 times [2019-11-28 12:44:14,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:44:14,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290072258] [2019-11-28 12:44:14,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-11-28 12:44:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:44:15,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 12:44:15,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:44:15,047 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 12:44:15,047 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:44:15,194 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 12:44:15,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1290072258] [2019-11-28 12:44:15,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:44:15,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2019-11-28 12:44:15,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981464314] [2019-11-28 12:44:15,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 12:44:15,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:44:15,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 12:44:15,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 12:44:15,196 INFO L87 Difference]: Start difference. First operand 131 states and 137 transitions. Second operand 8 states. [2019-11-28 12:44:15,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:44:15,250 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2019-11-28 12:44:15,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 12:44:15,251 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-11-28 12:44:15,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:44:15,252 INFO L225 Difference]: With dead ends: 133 [2019-11-28 12:44:15,252 INFO L226 Difference]: Without dead ends: 131 [2019-11-28 12:44:15,253 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-28 12:44:15,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-28 12:44:15,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-11-28 12:44:15,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-28 12:44:15,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 136 transitions. [2019-11-28 12:44:15,257 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 136 transitions. Word has length 60 [2019-11-28 12:44:15,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:44:15,258 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 136 transitions. [2019-11-28 12:44:15,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 12:44:15,258 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 136 transitions. [2019-11-28 12:44:15,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-28 12:44:15,259 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:44:15,259 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:44:15,464 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-28 12:44:15,464 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:44:15,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:44:15,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1123996245, now seen corresponding path program 1 times [2019-11-28 12:44:15,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:44:15,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242401673] [2019-11-28 12:44:15,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-11-28 12:44:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:44:15,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 12:44:15,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:44:15,707 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 12:44:15,707 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:44:15,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 12:44:15,925 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 12:44:15,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242401673] [2019-11-28 12:44:15,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:44:15,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 11 [2019-11-28 12:44:15,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201507464] [2019-11-28 12:44:15,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 12:44:15,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:44:15,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 12:44:15,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-28 12:44:15,928 INFO L87 Difference]: Start difference. First operand 131 states and 136 transitions. Second operand 11 states. [2019-11-28 12:44:16,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:44:16,017 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2019-11-28 12:44:16,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 12:44:16,018 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-11-28 12:44:16,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:44:16,019 INFO L225 Difference]: With dead ends: 135 [2019-11-28 12:44:16,019 INFO L226 Difference]: Without dead ends: 131 [2019-11-28 12:44:16,020 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-28 12:44:16,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-28 12:44:16,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-11-28 12:44:16,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-28 12:44:16,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2019-11-28 12:44:16,024 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 65 [2019-11-28 12:44:16,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:44:16,025 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2019-11-28 12:44:16,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 12:44:16,025 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2019-11-28 12:44:16,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-28 12:44:16,026 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:44:16,026 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:44:16,235 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-28 12:44:16,235 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:44:16,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:44:16,236 INFO L82 PathProgramCache]: Analyzing trace with hash -638447166, now seen corresponding path program 1 times [2019-11-28 12:44:16,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:44:16,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552286798] [2019-11-28 12:44:16,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-11-28 12:44:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:44:16,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-28 12:44:16,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:44:16,511 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 12:44:16,512 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:44:16,514 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:44:16,514 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:44:16,514 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 12:44:16,879 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 12:44:16,879 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:44:17,085 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 12:44:17,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1552286798] [2019-11-28 12:44:17,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:44:17,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18, 17] imperfect sequences [] total 18 [2019-11-28 12:44:17,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084436773] [2019-11-28 12:44:17,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 12:44:17,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:44:17,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 12:44:17,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-11-28 12:44:17,087 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand 19 states. [2019-11-28 12:44:18,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:44:18,543 INFO L93 Difference]: Finished difference Result 183 states and 200 transitions. [2019-11-28 12:44:18,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-28 12:44:18,543 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 76 [2019-11-28 12:44:18,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:44:18,545 INFO L225 Difference]: With dead ends: 183 [2019-11-28 12:44:18,545 INFO L226 Difference]: Without dead ends: 183 [2019-11-28 12:44:18,546 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 128 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2019-11-28 12:44:18,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-28 12:44:18,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 157. [2019-11-28 12:44:18,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-28 12:44:18,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 167 transitions. [2019-11-28 12:44:18,554 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 167 transitions. Word has length 76 [2019-11-28 12:44:18,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:44:18,555 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 167 transitions. [2019-11-28 12:44:18,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 12:44:18,555 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 167 transitions. [2019-11-28 12:44:18,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-28 12:44:18,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:44:18,556 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:44:18,760 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-11-28 12:44:18,761 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:44:18,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:44:18,762 INFO L82 PathProgramCache]: Analyzing trace with hash -638447165, now seen corresponding path program 1 times [2019-11-28 12:44:18,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:44:18,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1021851128] [2019-11-28 12:44:18,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-11-28 12:44:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:44:18,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-28 12:44:18,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:44:19,007 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 12:44:19,007 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:44:19,013 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:44:19,013 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:44:19,014 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 12:44:19,605 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 12:44:19,606 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:44:21,825 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 12:44:21,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1021851128] [2019-11-28 12:44:21,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:44:21,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19, 18] imperfect sequences [] total 36 [2019-11-28 12:44:21,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093493657] [2019-11-28 12:44:21,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-28 12:44:21,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:44:21,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-28 12:44:21,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1229, Unknown=0, NotChecked=0, Total=1332 [2019-11-28 12:44:21,828 INFO L87 Difference]: Start difference. First operand 157 states and 167 transitions. Second operand 37 states. [2019-11-28 12:44:26,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:44:26,066 INFO L93 Difference]: Finished difference Result 155 states and 163 transitions. [2019-11-28 12:44:26,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 12:44:26,067 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 76 [2019-11-28 12:44:26,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:44:26,069 INFO L225 Difference]: With dead ends: 155 [2019-11-28 12:44:26,069 INFO L226 Difference]: Without dead ends: 155 [2019-11-28 12:44:26,070 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 112 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=151, Invalid=1741, Unknown=0, NotChecked=0, Total=1892 [2019-11-28 12:44:26,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-28 12:44:26,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-11-28 12:44:26,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-28 12:44:26,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 163 transitions. [2019-11-28 12:44:26,076 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 163 transitions. Word has length 76 [2019-11-28 12:44:26,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:44:26,076 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 163 transitions. [2019-11-28 12:44:26,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-28 12:44:26,077 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 163 transitions. [2019-11-28 12:44:26,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-28 12:44:26,078 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:44:26,078 INFO L410 BasicCegarLoop]: trace histogram [16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:44:26,290 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-11-28 12:44:26,290 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:44:26,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:44:26,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1131008798, now seen corresponding path program 1 times [2019-11-28 12:44:26,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:44:26,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791209019] [2019-11-28 12:44:26,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-11-28 12:44:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:44:26,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 12:44:26,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:44:26,594 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 12:44:26,595 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:44:26,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 12:44:26,815 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 12:44:26,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791209019] [2019-11-28 12:44:26,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:44:26,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 14 [2019-11-28 12:44:26,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258725210] [2019-11-28 12:44:26,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 12:44:26,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:44:26,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 12:44:26,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-11-28 12:44:26,817 INFO L87 Difference]: Start difference. First operand 155 states and 163 transitions. Second operand 14 states. [2019-11-28 12:44:26,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:44:26,965 INFO L93 Difference]: Finished difference Result 159 states and 165 transitions. [2019-11-28 12:44:26,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 12:44:26,969 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 83 [2019-11-28 12:44:26,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:44:26,970 INFO L225 Difference]: With dead ends: 159 [2019-11-28 12:44:26,970 INFO L226 Difference]: Without dead ends: 153 [2019-11-28 12:44:26,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-11-28 12:44:26,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-28 12:44:26,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-11-28 12:44:26,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-28 12:44:26,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 159 transitions. [2019-11-28 12:44:26,976 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 159 transitions. Word has length 83 [2019-11-28 12:44:26,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:44:26,977 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 159 transitions. [2019-11-28 12:44:26,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 12:44:26,977 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 159 transitions. [2019-11-28 12:44:26,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-28 12:44:26,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:44:26,979 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:44:27,179 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-11-28 12:44:27,180 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:44:27,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:44:27,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1628283129, now seen corresponding path program 1 times [2019-11-28 12:44:27,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:44:27,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [227566487] [2019-11-28 12:44:27,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-11-28 12:44:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:44:27,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-28 12:44:27,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:44:27,438 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 12:44:27,438 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:44:27,439 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:44:27,439 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:44:27,440 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 12:44:27,852 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 12:44:27,852 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:44:28,117 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 12:44:28,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [227566487] [2019-11-28 12:44:28,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:44:28,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22, 21] imperfect sequences [] total 22 [2019-11-28 12:44:28,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100717377] [2019-11-28 12:44:28,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-28 12:44:28,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:44:28,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-28 12:44:28,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-11-28 12:44:28,119 INFO L87 Difference]: Start difference. First operand 153 states and 159 transitions. Second operand 23 states. [2019-11-28 12:44:29,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:44:29,946 INFO L93 Difference]: Finished difference Result 186 states and 202 transitions. [2019-11-28 12:44:29,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-28 12:44:29,946 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 89 [2019-11-28 12:44:29,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:44:29,948 INFO L225 Difference]: With dead ends: 186 [2019-11-28 12:44:29,948 INFO L226 Difference]: Without dead ends: 186 [2019-11-28 12:44:29,949 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 144 SyntacticMatches, 12 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2019-11-28 12:44:29,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-28 12:44:29,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 159. [2019-11-28 12:44:29,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-28 12:44:29,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2019-11-28 12:44:29,956 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 169 transitions. Word has length 89 [2019-11-28 12:44:29,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:44:29,957 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 169 transitions. [2019-11-28 12:44:29,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-28 12:44:29,957 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2019-11-28 12:44:29,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-28 12:44:29,958 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:44:29,958 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:44:30,171 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-11-28 12:44:30,172 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:44:30,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:44:30,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1628283130, now seen corresponding path program 1 times [2019-11-28 12:44:30,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:44:30,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1078378211] [2019-11-28 12:44:30,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-11-28 12:44:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:44:30,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 50 conjunts are in the unsatisfiable core [2019-11-28 12:44:30,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:44:30,477 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 12:44:30,478 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:44:30,498 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:44:30,498 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:44:30,499 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 12:44:31,114 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 12:44:31,114 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:44:33,726 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 12:44:33,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1078378211] [2019-11-28 12:44:33,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:44:33,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23, 22] imperfect sequences [] total 44 [2019-11-28 12:44:33,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930610326] [2019-11-28 12:44:33,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-11-28 12:44:33,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:44:33,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-11-28 12:44:33,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1853, Unknown=0, NotChecked=0, Total=1980 [2019-11-28 12:44:33,729 INFO L87 Difference]: Start difference. First operand 159 states and 169 transitions. Second operand 45 states. [2019-11-28 12:44:38,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:44:38,592 INFO L93 Difference]: Finished difference Result 157 states and 166 transitions. [2019-11-28 12:44:38,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-28 12:44:38,593 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 89 [2019-11-28 12:44:38,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:44:38,594 INFO L225 Difference]: With dead ends: 157 [2019-11-28 12:44:38,595 INFO L226 Difference]: Without dead ends: 157 [2019-11-28 12:44:38,596 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 128 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=189, Invalid=2673, Unknown=0, NotChecked=0, Total=2862 [2019-11-28 12:44:38,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-28 12:44:38,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-11-28 12:44:38,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-28 12:44:38,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 166 transitions. [2019-11-28 12:44:38,602 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 166 transitions. Word has length 89 [2019-11-28 12:44:38,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:44:38,603 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 166 transitions. [2019-11-28 12:44:38,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-11-28 12:44:38,603 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 166 transitions. [2019-11-28 12:44:38,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-28 12:44:38,604 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:44:38,605 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:44:38,817 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-11-28 12:44:38,818 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:44:38,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:44:38,818 INFO L82 PathProgramCache]: Analyzing trace with hash 822322196, now seen corresponding path program 1 times [2019-11-28 12:44:38,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:44:38,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [626325240] [2019-11-28 12:44:38,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-11-28 12:44:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:44:39,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-28 12:44:39,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:44:39,942 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 12:44:39,942 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:44:40,856 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 12:44:40,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [626325240] [2019-11-28 12:44:40,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:44:40,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23, 21] imperfect sequences [] total 43 [2019-11-28 12:44:40,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581444663] [2019-11-28 12:44:40,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-11-28 12:44:40,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:44:40,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-11-28 12:44:40,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1726, Unknown=0, NotChecked=0, Total=1892 [2019-11-28 12:44:40,858 INFO L87 Difference]: Start difference. First operand 157 states and 166 transitions. Second operand 44 states. [2019-11-28 12:44:43,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:44:43,655 INFO L93 Difference]: Finished difference Result 156 states and 165 transitions. [2019-11-28 12:44:43,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-28 12:44:43,657 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 92 [2019-11-28 12:44:43,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:44:43,659 INFO L225 Difference]: With dead ends: 156 [2019-11-28 12:44:43,659 INFO L226 Difference]: Without dead ends: 156 [2019-11-28 12:44:43,660 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 136 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=230, Invalid=2422, Unknown=0, NotChecked=0, Total=2652 [2019-11-28 12:44:43,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-28 12:44:43,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2019-11-28 12:44:43,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-28 12:44:43,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 165 transitions. [2019-11-28 12:44:43,664 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 165 transitions. Word has length 92 [2019-11-28 12:44:43,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:44:43,665 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 165 transitions. [2019-11-28 12:44:43,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-11-28 12:44:43,665 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 165 transitions. [2019-11-28 12:44:43,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-28 12:44:43,666 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:44:43,666 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:44:43,877 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-11-28 12:44:43,877 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:44:43,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:44:43,878 INFO L82 PathProgramCache]: Analyzing trace with hash -692582595, now seen corresponding path program 1 times [2019-11-28 12:44:43,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:44:43,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1117179601] [2019-11-28 12:44:43,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-11-28 12:44:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:44:44,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 122 conjunts are in the unsatisfiable core [2019-11-28 12:44:44,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:44:44,253 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-28 12:44:44,253 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:44:44,267 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:44:44,267 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:44:44,268 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-11-28 12:44:44,314 INFO L343 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2019-11-28 12:44:44,314 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2019-11-28 12:44:44,314 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:44:44,326 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:44:44,327 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:44:44,327 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-11-28 12:44:44,435 INFO L343 Elim1Store]: treesize reduction 10, result has 87.7 percent of original size [2019-11-28 12:44:44,435 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 93 [2019-11-28 12:44:44,436 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:44:44,495 INFO L588 ElimStorePlain]: treesize reduction 54, result has 40.0 percent of original size [2019-11-28 12:44:44,495 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:44:44,496 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-11-28 12:45:09,162 WARN L192 SmtUtils]: Spent 24.62 s on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-11-28 12:45:09,163 INFO L343 Elim1Store]: treesize reduction 43, result has 70.9 percent of original size [2019-11-28 12:45:09,163 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 132 [2019-11-28 12:45:09,164 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:45:09,258 INFO L588 ElimStorePlain]: treesize reduction 96, result has 33.3 percent of original size [2019-11-28 12:45:09,259 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:45:09,259 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:48 [2019-11-28 12:45:09,407 INFO L343 Elim1Store]: treesize reduction 172, result has 16.9 percent of original size [2019-11-28 12:45:09,407 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 58 treesize of output 66 [2019-11-28 12:45:09,408 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:45:09,434 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:45:09,435 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:45:09,435 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:59 [2019-11-28 12:45:09,621 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 28 [2019-11-28 12:45:09,621 INFO L343 Elim1Store]: treesize reduction 246, result has 15.2 percent of original size [2019-11-28 12:45:09,622 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 69 treesize of output 80 [2019-11-28 12:45:09,622 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:45:09,652 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:45:09,652 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:45:09,652 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:74, output treesize:70 [2019-11-28 12:45:10,150 WARN L192 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 69 [2019-11-28 12:45:10,151 INFO L343 Elim1Store]: treesize reduction 170, result has 57.2 percent of original size [2019-11-28 12:45:10,152 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 81 treesize of output 269 [2019-11-28 12:45:10,153 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:45:12,392 WARN L192 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-11-28 12:45:12,393 INFO L588 ElimStorePlain]: treesize reduction 174, result has 32.0 percent of original size [2019-11-28 12:45:12,393 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:45:12,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:86, output treesize:82 [2019-11-28 12:45:12,715 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 38 [2019-11-28 12:45:12,715 INFO L343 Elim1Store]: treesize reduction 430, result has 12.6 percent of original size [2019-11-28 12:45:12,716 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 28 case distinctions, treesize of input 91 treesize of output 108 [2019-11-28 12:45:12,717 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:45:12,770 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:45:12,771 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:45:12,771 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:96, output treesize:92 [2019-11-28 12:45:13,753 WARN L192 SmtUtils]: Spent 853.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 89 [2019-11-28 12:45:13,754 INFO L343 Elim1Store]: treesize reduction 322, result has 48.6 percent of original size [2019-11-28 12:45:13,754 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 103 treesize of output 357 [2019-11-28 12:45:13,756 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:45:14,012 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 45 [2019-11-28 12:45:14,013 INFO L588 ElimStorePlain]: treesize reduction 234, result has 30.4 percent of original size [2019-11-28 12:45:14,013 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:45:14,013 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:106, output treesize:102 [2019-11-28 12:45:14,513 WARN L192 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 48 [2019-11-28 12:45:14,514 INFO L343 Elim1Store]: treesize reduction 662, result has 10.8 percent of original size [2019-11-28 12:45:14,514 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 45 case distinctions, treesize of input 113 treesize of output 136 [2019-11-28 12:45:14,516 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:45:14,582 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:45:14,582 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:45:14,582 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:118, output treesize:114 [2019-11-28 12:45:15,741 WARN L192 SmtUtils]: Spent 996.00 ms on a formula simplification. DAG size of input: 289 DAG size of output: 109 [2019-11-28 12:45:15,742 INFO L343 Elim1Store]: treesize reduction 522, result has 42.3 percent of original size [2019-11-28 12:45:15,742 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 55 case distinctions, treesize of input 125 treesize of output 445 [2019-11-28 12:45:15,744 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:45:18,166 WARN L192 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 95 DAG size of output: 55 [2019-11-28 12:45:18,166 INFO L588 ElimStorePlain]: treesize reduction 294, result has 30.0 percent of original size [2019-11-28 12:45:18,167 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:45:18,167 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:130, output treesize:126 [2019-11-28 12:45:18,977 WARN L192 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 338 DAG size of output: 58 [2019-11-28 12:45:18,977 INFO L343 Elim1Store]: treesize reduction 942, result has 9.4 percent of original size [2019-11-28 12:45:18,977 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 66 case distinctions, treesize of input 135 treesize of output 164 [2019-11-28 12:45:18,978 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:45:19,068 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:45:19,069 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:45:19,069 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:140, output treesize:136 [2019-11-28 12:45:20,027 WARN L192 SmtUtils]: Spent 692.00 ms on a formula simplification. DAG size of input: 392 DAG size of output: 63 [2019-11-28 12:45:20,028 INFO L343 Elim1Store]: treesize reduction 1100, result has 8.9 percent of original size [2019-11-28 12:45:20,028 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 78 case distinctions, treesize of input 146 treesize of output 178 [2019-11-28 12:45:20,029 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:45:20,122 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:45:20,123 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:45:20,123 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:151, output treesize:147 [2019-11-28 12:45:22,166 WARN L192 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 451 DAG size of output: 139 [2019-11-28 12:45:22,166 INFO L343 Elim1Store]: treesize reduction 912, result has 35.4 percent of original size [2019-11-28 12:45:22,167 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 91 case distinctions, treesize of input 158 treesize of output 577 [2019-11-28 12:45:22,168 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:45:22,635 WARN L192 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 65 [2019-11-28 12:45:22,636 INFO L588 ElimStorePlain]: treesize reduction 384, result has 29.0 percent of original size [2019-11-28 12:45:22,636 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:45:22,637 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:161, output treesize:157 [2019-11-28 12:45:22,904 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-28 12:48:03,841 WARN L192 SmtUtils]: Spent 2.68 m on a formula simplification. DAG size of input: 513 DAG size of output: 196 [2019-11-28 12:48:03,842 INFO L343 Elim1Store]: treesize reduction 945, result has 41.7 percent of original size [2019-11-28 12:48:03,842 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 105 case distinctions, treesize of input 170 treesize of output 759 [2019-11-28 12:48:03,846 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:48:04,439 WARN L192 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 69 [2019-11-28 12:48:04,440 INFO L588 ElimStorePlain]: treesize reduction 384, result has 30.6 percent of original size [2019-11-28 12:48:04,440 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:48:04,440 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:173, output treesize:169 [2019-11-28 12:48:04,749 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-28 12:48:05,966 WARN L192 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 578 DAG size of output: 78 [2019-11-28 12:48:05,968 INFO L343 Elim1Store]: treesize reduction 1646, result has 7.5 percent of original size [2019-11-28 12:48:05,969 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 120 case distinctions, treesize of input 179 treesize of output 220 [2019-11-28 12:48:05,971 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:48:06,095 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-28 12:48:06,096 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:48:06,096 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:48:06,096 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:179, output treesize:175 [2019-11-28 12:48:06,485 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-28 12:48:09,555 INFO L508 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 12:48:09,603 INFO L588 ElimStorePlain]: treesize reduction 88, result has 32.3 percent of original size [2019-11-28 12:48:09,603 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 12:48:09,603 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:42 [2019-11-28 12:48:11,611 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$.offset)| |c_ldv_kobject_init_internal_#in~kobj.base| (let ((.cse0 (bvadd |c_ldv_kobject_init_internal_#in~kobj.offset| (_ bv4 32)))) (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_ldv_kobject_init_internal_#in~kobj.base|) (bvadd |c_ldv_kobject_init_internal_#in~kobj.offset| (_ bv12 32)) v_DerPreprocessor_1) (bvadd |c_ldv_kobject_init_internal_#in~kobj.offset| (_ bv13 32)) v_DerPreprocessor_2) (bvadd |c_ldv_kobject_init_internal_#in~kobj.offset| (_ bv14 32)) v_DerPreprocessor_3) (bvadd |c_ldv_kobject_init_internal_#in~kobj.offset| (_ bv15 32)) v_DerPreprocessor_4) .cse0 .cse0) (bvadd |c_ldv_kobject_init_internal_#in~kobj.offset| (_ bv8 32)) .cse0))) |c_#memory_$Pointer$.offset|)) is different from true [2019-11-28 12:48:13,626 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$.offset)| |c_ldv_kobject_init_#in~kobj.base| (let ((.cse0 (bvadd |c_ldv_kobject_init_#in~kobj.offset| (_ bv4 32)))) (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_ldv_kobject_init_#in~kobj.base|) (bvadd |c_ldv_kobject_init_#in~kobj.offset| (_ bv12 32)) v_DerPreprocessor_1) (bvadd |c_ldv_kobject_init_#in~kobj.offset| (_ bv13 32)) v_DerPreprocessor_2) (bvadd |c_ldv_kobject_init_#in~kobj.offset| (_ bv14 32)) v_DerPreprocessor_3) (bvadd |c_ldv_kobject_init_#in~kobj.offset| (_ bv15 32)) v_DerPreprocessor_4) .cse0 .cse0) (bvadd |c_ldv_kobject_init_#in~kobj.offset| (_ bv8 32)) .cse0))) |c_#memory_$Pointer$.offset|)) is different from true [2019-11-28 12:48:13,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,651 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,666 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,693 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,721 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,786 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,808 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:13,809 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:48:13,810 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 16 select indices, 16 select index equivalence classes, 120 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 185 treesize of output 195 [2019-11-28 12:48:13,811 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:48:13,915 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-28 12:48:13,916 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:48:13,916 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:48:13,916 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:188, output treesize:114 [2019-11-28 12:48:17,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:17,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:17,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:17,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:17,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:17,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:17,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:17,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:17,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:17,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:17,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:17,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:17,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:17,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:17,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:17,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:17,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:17,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:17,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:17,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:17,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:17,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:17,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:18,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:18,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:18,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:18,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:18,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:18,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:18,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:18,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:18,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:18,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:18,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:18,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:18,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:18,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:18,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:18,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:18,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:18,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:18,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:48:18,023 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:48:18,024 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 120 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 133 treesize of output 121 [2019-11-28 12:48:18,025 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:48:18,070 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:48:18,071 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:48:18,071 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:138, output treesize:90 [2019-11-28 12:48:20,151 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:48:20,152 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 66 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 94 treesize of output 42 [2019-11-28 12:48:20,152 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:48:20,154 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:48:20,154 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:48:20,154 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:94, output treesize:3 [2019-11-28 12:48:20,637 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:48:20,637 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:48:22,451 INFO L508 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 12:48:22,466 INFO L588 ElimStorePlain]: treesize reduction 83, result has 24.5 percent of original size [2019-11-28 12:48:22,467 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 12:48:22,467 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:27 [2019-11-28 12:48:23,143 INFO L508 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 12:48:23,204 INFO L588 ElimStorePlain]: treesize reduction 82, result has 34.4 percent of original size [2019-11-28 12:48:23,204 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 12:48:23,204 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:43 [2019-11-28 12:50:37,109 WARN L192 SmtUtils]: Spent 2.17 m on a formula simplification that was a NOOP. DAG size: 152 [2019-11-28 12:50:37,397 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-28 12:50:38,759 WARN L192 SmtUtils]: Spent 1.36 s on a formula simplification that was a NOOP. DAG size: 63 [2019-11-28 12:50:40,049 WARN L192 SmtUtils]: Spent 1.29 s on a formula simplification that was a NOOP. DAG size: 63 [2019-11-28 12:50:40,596 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-28 12:50:40,784 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-28 12:50:40,921 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-28 12:50:41,062 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-28 12:50:53,554 WARN L192 SmtUtils]: Spent 12.23 s on a formula simplification that was a NOOP. DAG size: 108 [2019-11-28 12:50:58,604 WARN L192 SmtUtils]: Spent 5.05 s on a formula simplification that was a NOOP. DAG size: 74 [2019-11-28 12:51:05,514 WARN L192 SmtUtils]: Spent 6.91 s on a formula simplification that was a NOOP. DAG size: 78 [2019-11-28 12:51:12,280 WARN L192 SmtUtils]: Spent 6.76 s on a formula simplification that was a NOOP. DAG size: 78 [2019-11-28 12:51:13,376 WARN L192 SmtUtils]: Spent 361.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-28 12:51:13,548 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-28 12:51:13,665 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-28 12:51:13,806 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-28 12:51:13,999 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-28 12:51:14,107 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-28 12:51:14,141 INFO L508 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 12:51:14,157 INFO L588 ElimStorePlain]: treesize reduction 91, result has 31.1 percent of original size [2019-11-28 12:51:14,157 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 12:51:14,157 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:41 [2019-11-28 12:51:15,192 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-28 12:51:15,358 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-28 12:51:15,456 INFO L508 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 12:51:15,518 INFO L588 ElimStorePlain]: treesize reduction 90, result has 37.9 percent of original size [2019-11-28 12:51:15,518 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 12:51:15,519 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:88, output treesize:55 [2019-11-28 12:51:16,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 12:51:16,195 INFO L377 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 8 treesize of output 4 [2019-11-28 12:51:16,195 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:51:16,227 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:51:16,428 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-11-28 12:51:16,430 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported: (forall ((|v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4| (_ BitVec 32))) (exists ((v_DerPreprocessor_18 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_19 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32))) (or (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|)) (not (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base| (let ((.cse0 (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv4 32)))) (store (store (store (store (store (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv12 32)) v_DerPreprocessor_17) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv13 32)) v_DerPreprocessor_18) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv14 32)) v_DerPreprocessor_19) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv15 32)) v_DerPreprocessor_20) .cse0 .cse0) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv8 32)) .cse0))) |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|)))))) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:689) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:505) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) 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:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-28 12:51:16,436 INFO L168 Benchmark]: Toolchain (without parser) took 444648.14 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 442.0 MB). Free memory was 946.9 MB in the beginning and 1.4 GB in the end (delta: -474.6 MB). Peak memory consumption was 584.6 MB. Max. memory is 11.5 GB. [2019-11-28 12:51:16,437 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 12:51:16,437 INFO L168 Benchmark]: CACSL2BoogieTranslator took 808.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -149.6 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-28 12:51:16,437 INFO L168 Benchmark]: Boogie Preprocessor took 98.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 12:51:16,438 INFO L168 Benchmark]: RCFGBuilder took 1574.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 986.0 MB in the end (delta: 110.6 MB). Peak memory consumption was 110.6 MB. Max. memory is 11.5 GB. [2019-11-28 12:51:16,438 INFO L168 Benchmark]: TraceAbstraction took 442159.67 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 289.4 MB). Free memory was 986.0 MB in the beginning and 1.4 GB in the end (delta: -435.6 MB). Peak memory consumption was 471.1 MB. Max. memory is 11.5 GB. [2019-11-28 12:51:16,440 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 808.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -149.6 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 98.37 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 1574.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 986.0 MB in the end (delta: 110.6 MB). Peak memory consumption was 110.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 442159.67 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 289.4 MB). Free memory was 986.0 MB in the beginning and 1.4 GB in the end (delta: -435.6 MB). Peak memory consumption was 471.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported: (forall ((|v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4| (_ BitVec 32))) (exists ((v_DerPreprocessor_18 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_19 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32))) (or (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|)) (not (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base| (let ((.cse0 (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv4 32)))) (store (store (store (store (store (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv12 32)) v_DerPreprocessor_17) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv13 32)) v_DerPreprocessor_18) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv14 32)) v_DerPreprocessor_19) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv15 32)) v_DerPreprocessor_20) .cse0 .cse0) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv8 32)) .cse0))) |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|)))))) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: (forall ((|v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4| (_ BitVec 32))) (exists ((v_DerPreprocessor_18 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_19 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32))) (or (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|)) (not (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base| (let ((.cse0 (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv4 32)))) (store (store (store (store (store (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv12 32)) v_DerPreprocessor_17) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv13 32)) v_DerPreprocessor_18) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv14 32)) v_DerPreprocessor_19) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv15 32)) v_DerPreprocessor_20) .cse0 .cse0) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv8 32)) .cse0))) |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|)))))): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:689) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...